Research map / Learning theory and algorithms / Sample complexity
New Bounds for Hyperparameter Tuning of Regression Problems Across Instances
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.
Closest papers by meaning
- Provably tuning the ElasticNet across instances (NeurIPS 2022 · similarity 0.88)
- Provably Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function (ICML 2026 · similarity 0.88)
- Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression (ICML 2025 · similarity 0.85)
- Generalization in Kernel Regression Under Realistic Assumptions (ICML 2024 · similarity 0.85)
- Gradient Descent Converges Arbitrarily Fast for Logistic Regression via Large and Adaptive Stepsizes (ICML 2025 · similarity 0.85)
- Finite-Sample Performance of Gradient Descent in Logistic Regression with Gaussian Design (NeurIPS 2026 · similarity 0.84)
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.