Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Person

Quentin Rebjock

This person has left EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (4)

Page 1 of 1

Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices

Nicolas Boumal, Quentin Rebjock

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 positive definite. The weaker Polyak–Łojasiewicz (PŁ) condition is compatible w ...

2024

Error Feedback Fixes SignSGD and other Gradient Compression Schemes

Martin Jaggi, Sebastian Urban Stich, Sai Praneeth Reddy Karimireddy, Quentin Rebjock

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 across multiple workers. We show simple convex counter-examples where signSGD doe ...

PMLR2019

Fast convergence to non-isolated minima: four equivalent conditions for C2 functions

Nicolas Boumal, Quentin Rebjock

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-isolated. Yet, under the right circumstances, several algorithms preserve the ...

2024

FANOK: Knockoffs in Linear Time

Quentin Rebjock

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 the knockoff distribution requires solving a large-scale semidefinite progra ...

SIAM PUBLICATIONS2021