Sciweavers

    569 search results - page 19 / 114
    » Online Bounds for Bayesian Algorithms
    Sort
    View
    NIPS
    2008
    124views Information Technology» more  NIPS 2008»
    On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
    15 years 1 months ago
    On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
    Download  ttic.uchicago.edu
    This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
    Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
    claim paper
    Read More »
    NIPS
    2003
    146views Information Technology» more  NIPS 2003»
    On the Concentration of Expectation and Approximate Inference in Layered Networks
    15 years 1 months ago
    On the Concentration of Expectation and Approximate Inference in Layered Networks
    Download  www.cs.berkeley.edu
    We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
    XuanLong Nguyen, Michael I. Jordan
    claim paper
    Read More »
    NIPS
    2003
    119views Information Technology» more  NIPS 2003»
    Online Learning of Non-stationary Sequences
    15 years 1 months ago
    Online Learning of Non-stationary Sequences
    Download  books.nips.cc
    We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
    Claire Monteleoni, Tommi Jaakkola
    claim paper
    Read More »
    FOCS
    2008
    IEEE
    79views Theoretical Computer Science» more  FOCS 2008»
    The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
    15 years 6 months ago
    The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
    Download  www2.lns.mit.edu
    We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
    Michael Ben-Or, Avinatan Hassidim
    claim paper
    Read More »
    AOR
    2006
    99views more  AOR 2006»
    On-line bin Packing with Two Item Sizes
    14 years 12 months ago
    On-line bin Packing with Two Item Sizes
    Download  www.cs.rhul.ac.uk
    The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...
    Gregory Gutin, Tommy R. Jensen, Anders Yeo
    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-2025, USA.