Research map / Learning theory and algorithms / Prediction and decision losses
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.
Guillaume Lecué, Lucie Neirac
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
- Robust high dimensional learning for Lipschitz and convex losses (JMLR 2020 · similarity 0.89)
- A Two-Stage Approach for Learning a Sparse Model with Sharp Excess Risk Analysis (AAAI 2017 · similarity 0.88)
- Theoretical Analysis of Adversarial Learning: A Minimax Approach (NeurIPS 2019 · similarity 0.88)
- Efficient online algorithms for fast-rate regret bounds under sparsity (NeurIPS 2018 · similarity 0.88)
- Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models (NeurIPS 2024 · similarity 0.87)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.86)
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.
