153 citations · 165 across the 10 of their papers we have counts for
10 papers
Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares
Nicolas Boumal, Christopher Criscitiello, Quentin Rebjock
The Polyak-Łojasiewicz (PŁ) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function $f \colon \mat…
Sensor network localization has a benign landscape after low-dimensional relaxation
Christopher Criscitiello, Andrew D. McRae, Quentin Rebjock +1
We consider the sensor network localization problem, which is closely related to multidimensional scaling and Euclidean distance matrix completion. Given a ground truth configurati…
Optimization over bounded-rank matrices through a desingularization enables joint global and local guarantees
Quentin Rebjock, Nicolas Boumal
Convergence guarantees for optimization over bounded-rank matrices are delicate to obtain because the feasible set is a nonsmooth and nonconvex algebraic variety. Existing techniqu…
Synchronization on circles and spheres with nonlinear interactions
Christopher Criscitiello, Quentin Rebjock, Andrew D. McRae +1
We consider the dynamics of points on a sphere in () which attract each other according to a function of their inner products. When is linear (…
Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices
Quentin Rebjock, Nicolas Boumal
Trust-region methods (TR) can converge quadratically to minima where the Hessian is positive definite. However, if the minima are not isolated, then the Hessian there cannot be pos…
Fast convergence to non-isolated minima: four equivalent conditions for functions
Quentin Rebjock, Nicolas Boumal
Optimization algorithms can see their local convergence rates deteriorate when the Hessian at the optimum is singular. These singularities are inescapable when the optima are non-i…
Online false discovery rate control for anomaly detection in time series
Quentin Rebjock, Barış Kurt, Tim Januschowski +1
This article proposes novel rules for false discovery rate control (FDRC) geared towards online anomaly detection in time series. Online FDRC rules allow to control the properties…
A simple and effective predictive resource scaling heuristic for large-scale cloud applications
Valentin Flunkert, Quentin Rebjock, Joel Castellon +2
We propose a simple yet effective policy for the predictive auto-scaling of horizontally scalable applications running in cloud environments, where compute resources can only be ad…
FANOK: Knockoffs in Linear Time
Armin Askari, Quentin Rebjock, Alexandre d'Aspremont +1
We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large scale feature selection problems. Identifying…
Error Feedback Fixes SignSGD and other Gradient Compression Schemes
Sai Praneeth Karimireddy, Quentin Rebjock, Sebastian U. Stich +1
Sign-based algorithms (e.g. signSGD) have been proposed as a biased gradient compression technique to alleviate the communication bottleneck in training large neural networks acros…