Research map / Learning theory and algorithms / Prediction and decision losses
Safe Grid Search with Optimal Complexity
Eugene Ndiaye, Tam Le, Olivier Fercoq, Joseph Salmon, Ichiro Takeuchi
Read the paperCheck your idea against 137,217 papers
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 |
|---|---|---|---|
| Use the safe validation-error path with a prescribed accuracy | Hyperparameter selection over a regularization range · Hold-out validation | validation error gap from the optimum: ε_v | Improved |
Closest papers by meaning
- Path following algorithms for $\ell_2$-regularized $M$-estimation with approximation guarantee (NeurIPS 2023 · similarity 0.88)
- Gradient Descent Converges Arbitrarily Fast for Logistic Regression via Large and Adaptive Stepsizes (ICML 2025 · similarity 0.86)
- Large Stepsizes Accelerate Gradient Descent for Regularized Logistic Regression (NeurIPS 2025 · similarity 0.86)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.86)
- Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression (ICML 2025 · similarity 0.85)
- Estimating Generalization Performance Along the Trajectory of Proximal SGD in Robust Regression (NeurIPS 2024 · 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.
