Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso
Roberto I. Oliveira, Philip Thompson

TL;DR
This paper develops localization techniques to derive risk bounds in stochastic convex optimization and Lasso estimation, especially under heavy-tailed distributions, leading to improved understanding of risk inflation and persistence.
Contribution
It introduces a localization toolbox that yields sharp risk bounds for portfolio optimization and Lasso estimators under weak moment conditions, advancing prior methods.
Findings
Risk bounds depend on intrinsic dimension g, not the full problem dimension.
Localization reduces the impact of risk inflation caused by heavy tails.
Established persistence for Lasso with heavy-tailed covariates.
Abstract
``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization literature. In addition, there is an obvious interest in both communities in obtaining risk bounds that require weak moment assumptions or ``heavier-tails''. In this work we use a localization toolbox to derive risk bounds in two specific applications. The first is in portfolio risk minimization with conditional value-at-risk constraints. We consider a setting where, among all assets with high returns, there is a portion of dimension , unknown to the investor, that has significant less risk than the other remaining portion. Our rates for the SAA problem show that ``risk inflation'', caused by a multiplicative factor, affects the statistical rate only via…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Statistical Methods and Inference · Machine Learning and Algorithms
