Sciweavers

    2 search results - page 1 / 1
    » Computational Equivalence of Fixed Points and No Regret Algo...
    Sort
    View
    NIPS
    2007
    139views Information Technology» more  NIPS 2007»
    Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria
    13 years 6 months ago
    Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria
    Download  books.nips.cc
    We study the relation between notions of game-theoretic equilibria which are based on stability under a set of deviations, and empirical equilibria which are reached by rational p...
    Elad Hazan, Satyen Kale
    claim paper
    Read More »
    COLT
    2008
    Springer
    103views Machine Learning» more  COLT 2008»
    More Efficient Internal-Regret-Minimizing Algorithms
    13 years 6 months ago
    More Efficient Internal-Regret-Minimizing Algorithms
    Download  www.cs.brown.edu
    Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
    Amy R. Greenwald, Zheng Li, Warren Schudy
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.