On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “nonconvex-convex”

Hybrid Variance-Reduced SGD Algorithms For Nonconvex-Concave Minimax Problemsmath.OC

New algorithm solves nonconvex-convex minimax problems efficiently.

problem Solving nonconvex-convex minimax problems with nonsmooth, nonconvex, and nonlinearity.

method Hybrid variance-reduced SGD algorithm combining smoothing and biased techniques.

result Achieves O(T^(-2/3)) convergence rate and best oracle complexity.

minimax problems nonconvex-convex variance reduction smoothing hybrid biased

2020-06-27abs ↗pdf ↗

Beyond Lipschitz: Sharp Generalization and Excess Risk Bounds for Full-Batch GDstat.ML

Full-batch GD achieves generalization close to any stationary point with fewer assumptions.

problem Generalization and excess risk bounds for smooth losses, including non-Lipschitz and nonconvex cases.

method Path-dependent analysis of GD's generalization error, focusing on optimization error and stability.

result Generalization error is tightly bound in terms of optimization error and iteration count, bypassing common assumptions.

Gradient Descent Generalization Excess Risk Smooth Losses Optimization Error

2022-04-26abs ↗pdf ↗