Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization

We propose ALFCG (Adaptive Lipschitz-Free Conditional Gradient), the first textitadaptive projection-free framework for stochastic composite nonconvex minimization that textitrequires neither global smoothness constants nor line search. Unlike prior conditional gradient methods that use openloop diminishing stepsizes, conservative Lipschitz constants, or costly backtracking, ALFCG maintains a self-normalized accumulator of historical iterate differences to estimate local smoothness and minimize a quadratic surrogate model at each step. This retains the simplicity of Frank-Wolfe while adapting to unknown geometry. We study three variants. ALFCG-FS addresses finite-sum problems with a SPIDER estimator. ALFCG-MVR1 and ALFCG-MVR2 handle stochastic expectation problems by using momentum-based variance reduction with single-batch and two-batch updates, and operate under average and individual smoothness, respectively. To reach an ε-stationary point, ALFCG-FS attains O(N+√Nε-2) iteration complexity, while ALFCG-MVR1 and ALFCG-MVR2 achieve tildeO(σ2ε-4+ε-2) and tildeO(σε-3+ε-2), where N is the number of components and σ is the noise level. In contrast to typical O(ε-4) or O(ε-3) rates, our bounds reduce to the optimal rate up to logarithmic factors tildeO(ε-2) as the noise level σ → 0. Extensive experiments on multiclass classification over nuclear norm balls and ℓp balls show that ALFCG generally outperforms state-of-the-art conditional gradient baselines.