activity
20102026
most citedGlobal rates of convergence for nonconvex optimization on manifolds

285 citations · 499 across the 55 of their papers we have counts for

collaborators

58 papers

math.OC2026

Stochastic Nonconvex Bilevel Optimization: Improved Rates Without Rare-Visit Assumption

Daniel Cortild, Mathias Staudigl, Juan Peypouquet +1

We investigate stochastic simple bilevel optimization with smooth and possibly nonconvex upper- and lower-level objectives. Existing stochastic extensions of dynamic barrier gradie…

math.OC2026

A note on the complexity of random subspace model-based methods for derivative-free optimization

Coralia Cartis, Lindon Roberts

We demonstrate that, with a suitable rescaling, using Johnson-Lindenstrauss transforms (JLTs) in the random subspace model-based derivative-free optimization (DFO) algorithm from […

cs.LG2026

An Optimisation Framework for the Well-Conditioned Training of Physics-Informed Neural Networks

Joseph Webb, Sadok Jerad, Coralia Cartis

Physics-informed neural networks (PINNs) have emerged as a promising route to solve partial differential equations, yet they have struggled to reach the precision of classical solv…

math.OC2026

Stochastic Krasnoselskii-Mann Iterations: Convergence without Uniformly Bounded Variance

Daniel Cortild, Coralia Cartis, Juan Peypouquet

We investigate the Stochastic Krasnoselskii-Mann iterations for expected nonexpansive fixed-point problems in a real separable Hilbert space. We establish convergence guarantees un…

cs.LG2026

Efficient Techniques for Data Reconstruction, with Finite-Width Recovery Guarantees

Edward Tansley, Roy Makhlouf, Estelle Massart +1

Data reconstruction attacks on trained neural networks aim to recover the data on which the network has been trained and pose a significant threat to privacy, especially if the tra…

math.OC2026

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with Global Rate

Sichao Xiong, Sadok Jerad, Coralia Cartis

We introduce PF-AGD, the first parameter-free, deterministic, accelerated first-order method to achieve oracle complexity bound when minimizing sufficiently…