Sciweavers

    20 search results - page 2 / 4
    » Convergence rate analysis of an asynchronous space decomposi...
    Sort
    View
    CORR
    2008
    Springer
    133views Education» more  CORR 2008»
    Estimating divergence functionals and the likelihood ratio by convex risk minimization
    13 years 5 months ago
    Estimating divergence functionals and the likelihood ratio by convex risk minimization
    Download  oz.berkeley.edu
    We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
    XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
    claim paper
    Read More »
    JMLR
    2012
    187views Programming Languages» more  JMLR 2012»
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    11 years 7 months ago
    Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
    Download  www.eecs.berkeley.edu
    Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
    Garvesh Raskutti, Martin J. Wainwright, Bin Yu
    claim paper
    Read More »
    SIAMJO
    2008
    112views more  SIAMJO 2008»
    Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
    13 years 4 months ago
    Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
    Download  www.caam.rice.edu
    This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern Search for constrained n...
    Charles Audet, J. E. Dennis, Sébastien Le D...
    claim paper
    Read More »
    MP
    2002
    195views more  MP 2002»
    Nonlinear rescaling vs. smoothing technique in convex optimization
    13 years 4 months ago
    Nonlinear rescaling vs. smoothing technique in convex optimization
    Download  cs.gmu.edu
    We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
    Roman A. Polyak
    claim paper
    Read More »
    SIAMSC
    2008
    165views more  SIAMSC 2008»
    Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
    13 years 4 months ago
    Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
    Download  www.math.uni-bremen.de
    Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
    Kristian Bredies, Dirk A. Lorenz
    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.