Paper recorded by Signals 4 on 2026-10-01 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-01 on arXiv · recorded by Signals 4 on 2026-10-02
Category: cs.AI · 人工智能 · first seen 2026-10-02
Quasi-Newton (QN) methods have long been among the most effective methods for large-scale unconstrained convex optimization. Two obstacles have limited their use in deep learning: non-convexity and enormous parameter sizes. We introduce SoftServe, a family of QN methods designed to overcome these obstacles without line searches or ad hoc curvature corrections. SoftServe derives positivedefinite cu