Research map / Learning theory and algorithms / Sample complexity
Minimizing Quadratic Functions in Constant Time
Read the paperCheck your idea against 108,967 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use uniform random index sampling and solve the restricted quadratic problem | Quadratic minimization for Pearson divergence · Pearson divergence | absolute approximation error | Helped |
| Use uniform random index sampling and solve the restricted quadratic problem | Quadratic minimization for Pearson divergence · Pearson divergence | runtime | Helped |
| Increase the sampled index count from k=20 to k=160 (ablation) | Proposed sampling method · Pearson divergence | absolute approximation error: 0.0027±0.0028 -> 0.0003±0.0003 (n=500); 0.0012±0.0012 -> 0.0002±0.0001 (n=1000); 0.0021±0.0019 -> 0.0003±0.0003 (n=2000) | Helped |
Closest papers by meaning
- Stochastic Optimization with Arbitrary Recurrent Data Sampling (ICML 2024 · similarity 0.83)
- Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent (ICML 2025 · similarity 0.82)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.82)
- Sample complexity of stochastic optimization with integer variables (NeurIPS 2026 · similarity 0.82)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.82)
- Toward a Unified Theory of Gradient Descent under Generalized Smoothness (ICML 2025 · similarity 0.82)
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.