Research map / Learning theory and algorithms / Sample complexity
Towards Problem-dependent Optimal Learning Rates
Yunbei Xu, Assaf J. Zeevi
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Apply the new variance-dependent rate to non-parametric classes of polynomial growth | Moment-penalized estimator · Non-parametric class, traditional regime B~1, V*~n^-a | rate improvement over previous | Improved |
Closest papers by meaning
- Stochastic Approximation with Decision-Dependent Distributions: Asymptotic Normality and Optimality (JMLR 2024 · similarity 0.87)
- The Empirical Mean is Minimax Optimal for Local Glivenko-Cantelli (ICML 2025 · similarity 0.86)
- Supervised Learning with General Risk Functionals (ICML 2022 · similarity 0.86)
- Sharp Rates in Dependent Learning Theory: Avoiding Sample Size Deflation for the Square Loss (ICML 2024 · similarity 0.86)
- A New Concentration Inequality for Sampling Without Replacement and Its Application for Transductive Learning (ICML 2025 · similarity 0.85)
- The Bias-Variance Tradeoff in Data-Driven Optimization: A Local Misspecification Perspective (NeurIPS 2025 · similarity 0.85)
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.
