Stochastic variance reduced optimization for nonconvex sparse learning

Xingguo Li, Tuo Zhao, Raman Arora, Han Liu, Jarvis Haupt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Abstract

We propose a stochastic variance reduced optimization algorithm for solving a class of largescale nonconvex optimization problems with cardinality constraints, and provide sufficient conditions under which the proposed algorithm enjoys strong linear convergence guarantees and optimal estimation accuracy in high dimensions. Numerical experiments demonstrate the efficiency of our method in terms of both parameter estimation and computational performance.

Original languageEnglish (US)
Title of host publication33rd International Conference on Machine Learning, ICML 2016
EditorsMaria Florina Balcan, Kilian Q. Weinberger
PublisherInternational Machine Learning Society (IMLS)
Pages1448-1460
Number of pages13
ISBN (Electronic)9781510829008
StatePublished - 2016
Event33rd International Conference on Machine Learning, ICML 2016 - New York City, United States
Duration: Jun 19 2016Jun 24 2016

Publication series

Name33rd International Conference on Machine Learning, ICML 2016
Volume2

Other

Other33rd International Conference on Machine Learning, ICML 2016
Country/TerritoryUnited States
CityNew York City
Period6/19/166/24/16

Bibliographical note

Funding Information:
This research is supported by NSF CCF-1217751; NSF AST-1247885; DARPA Young Faculty Award N66001-14-1-4047; NSF DMS-1454377-CAREER; NSF IIS-1546482-BIGDATA; NIH R01MH102339; NSF IIS-1408910; NSFIIS-1332109; NIH R01GM083084.

Fingerprint

Dive into the research topics of 'Stochastic variance reduced optimization for nonconvex sparse learning'. Together they form a unique fingerprint.

Cite this