Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2014 | Published
Book Section - Chapter Open

Time–Data Tradeoffs by Aggressive Smoothing


This paper proposes a tradeoff between sample complexity and computation time that applies to statistical estimators based on convex optimization. As the amount of data increases, we can smooth optimization problems more and more aggressively to achieve accurate estimates more quickly. This work provides theoretical and experimental evidence of this tradeoff for a class of regularized linear inverse problems.

Additional Information

© 2014 Neural Information Processing Systems. JJB's and JAT's work was supported under ONR award N00014-11-1002, AFOSR award FA9550-09-1-0643, and a Sloan Research Fellowship. VC's work was supported in part by the European Commission under Grant MIRG-268398, ERC Future Proof, SNF 200021-132548, SNF 200021-146750 and SNF CRSII2-147633. SRB was previously with IBM Research, Yorktown Heights, NY 10598 during the completion of this work.

Attached Files

Published - 5259-time-data-tradeoffs-by-aggressive-smoothing.pdf


Files (524.1 kB)

Additional details

August 19, 2023
August 19, 2023