arXiv Analytics

Sign in

arXiv:2010.00848 [math.OC]AbstractReferencesReviewsResources

Nonsmoothness in Machine Learning: specific structure, proximal identification, and applications

Franck Iutzeler, Jérôme Malick

Published 2020-10-02Version 1

Nonsmoothness is often a curse for optimization; but it is sometimes a blessing, in particular for applications in machine learning. In this paper, we present the specific structure of nonsmooth optimization problems appearing in machine learning and illustrate how to leverage this structure in practice, for compression, acceleration, or dimension reduction. We pay a special attention to the presentation to make it concise and easily accessible, with both simple examples and general results.

Comments: Set-Valued and Variational Analysis, Springer, In press
Categories: math.OC, eess.SP, stat.ML
Related articles: Most relevant | Search more
arXiv:1211.3907 [math.OC] (Published 2012-11-16, updated 2013-06-11)
Distance Majorization and Its Applications
arXiv:1304.7892 [math.OC] (Published 2013-04-30)
Metric Regularity of the Sum of Multifunctions and Applications
arXiv:1101.1019 [math.OC] (Published 2011-01-05)
Symmetry in variational principles and applications