Sciweavers

    2 search results - page 1 / 1
    » Convex approximations to sparse PCA via Lagrangian duality
    Sort
    View
    ORL
    2011
    270views Operations Research» more  ORL 2011»
    Convex approximations to sparse PCA via Lagrangian duality
    12 years 11 months ago
    Convex approximations to sparse PCA via Lagrangian duality
    Download  www.tau.ac.il
    We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
    Ronny Luss, Marc Teboulle
    claim paper
    Read More »
    CORR
    2011
    Springer
    202views Education» more  CORR 2011»
    Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
    12 years 11 months ago
    Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
    Download  www.eecs.berkeley.edu
    We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
    Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
    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.