This paper addresses questions about root anti-concentration in online optimization, specifically for piecewise-Lipschitz functions. The research provides a sharp, dimension-free characterization for homogeneous feature curves, removing a previous {sqrt(N)} loss. For monic degree-d polynomials, the interval-hitting constant is finite if and only if ordered real-root laws have bounded densities. The paper also details two graph-learning applications, including a Gaussian-RBF harmonic classifier and a polynomial-kernel model, both achieving improved regret bounds. AI
IMPACT Provides theoretical advancements that could inform the development of more efficient online optimization algorithms for machine learning.
RANK_REASON The cluster contains an academic paper published on arXiv with a corresponding summary on Hugging Face.
Read on Hugging Face Daily Papers →
- alphaXiv
- arXiv
- Balcan
- CatalyzeX
- Connected Papers
- DagsHub
- Gaussian RBF
- Gotit.pub
- Hugging Face
- IArxiv
- Litmaps
- Pegden
- ScienceCast
- scite Smart Citations
- Sharma
AI-generated summary · Google Gemini · from 2 sources. How we write summaries →