Research map / Learning theory and algorithms / Prediction and decision losses
Robust high dimensional learning for Lipschitz and convex losses
Chinot Geoffrey, Lecué Guillaume, Lerasle Matthieu
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning with a linear loss function: excess risk and estimation bounds for ERM, minmax MOM and their regularized versions with applications to robustness in sparse PCA. (JMLR 2024 · similarity 0.89)
- Robust Methods for High-Dimensional Linear Learning (JMLR 2023 · similarity 0.88)
- On the Error Resistance of Hinge-Loss Minimization (NeurIPS 2020 · similarity 0.87)
- The Nyström method for convex loss functions (JMLR 2024 · similarity 0.87)
- On the Efficiency of ERM in Feature Learning (NeurIPS 2024 · similarity 0.87)
- Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails (ICML 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
