• Login
    View Item 
    •   Home
    • Research
    • Preprints
    • View Item
    •   Home
    • Research
    • Preprints
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1901.08689.pdf
    Size:
    1.141Mb
    Format:
    PDF
    Description:
    Preprint
    Download
    Type
    Preprint
    Authors
    Kovalev, Dmitry cc
    Horvath, Samuel
    Richtarik, Peter cc
    KAUST Department
    Computer Science
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Statistics
    Statistics Program
    Date
    2019-01-24
    Permanent link to this record
    http://hdl.handle.net/10754/653122
    
    Metadata
    Show full item record
    Abstract
    The stochastic variance-reduced gradient method (SVRG) and its acceleratedvariant (Katyusha) have attracted enormous attention in the machine learningcommunity in the last few years due to their superior theoretical propertiesand empirical behaviour on training supervised machine learning models via theempirical risk minimization paradigm. A key structural element in both of thesemethods is the inclusion of an outer loop at the beginning of which a full passover the training data is made in order to compute the exact gradient, which isthen used to construct a variance-reduced estimator of the gradient. In thiswork we design {\em loopless variants} of both of these methods. In particular,we remove the outer loop and replace its function by a coin flip performed ineach iteration designed to trigger, with a small probability, the computationof the gradient. We prove that the new methods enjoy the same superiortheoretical convergence properties as the original methods. However, wedemonstrate through numerical experiments that our methods have substantiallysuperior practical behavior.
    Publisher
    arXiv
    arXiv
    1901.08689
    Additional Links
    https://arxiv.org/pdf/1901.08689
    Collections
    Preprints; Computer Science Program; Statistics Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.