Research map / Learning theory and algorithms / Kernels and regression theory
Globally Convergent Newton Methods for Ill-conditioned Generalized Self-concordant Losses
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 the proposed globally convergent Newton method instead of K-SVRG | Kernel logistic regression · Susy and Higgs | passes on data to convergence | Helped |
| Use the proposed globally convergent Newton method instead of K-SVRG | Kernel logistic regression · Susy test set | test error: 19.5% vs 19.5% | No clear effect |
Closest papers by meaning
- Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization (NeurIPS 2021 · similarity 0.89)
- Gradient Regularized Newton Boosting Trees with Global Convergence (NeurIPS 2026 · similarity 0.87)
- 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.85)
- A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees (NeurIPS 2025 · similarity 0.85)
- Inexact Newton-type Methods for Optimisation with Nonnegativity Constraints (ICML 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.