Nicolas Boumal
11 papers · 2011–2023 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Conference Polyglot (4) π Academic Marathon (12) π§ Keyword Pioneer π Interdisciplinary Bridge π Cross-Pollinator (11)
π
Cross-Pollinator
(11)
πΊοΈ
Taxonomy Completionist
(13)
π§¬
Topic Evolution
π¬
Deep Specialist
(11)
π
Keyword Champion
(3)
ποΈ
Keyword Collector
(50)
π
Century Club
(11)
β
The Questioner
π
Trend Setter
Conferences
COLT (5)
NIPS (4)
AISTATS (1)
JMLR (1)
Top co-authors
Keywords
semidefinite programming
(4)
manifold optimization
(4)
low-rank matrix
(4)
geodesic convexity
(3)
matrix factorization
(2)
riemannian optimization
(2)
hyperbolic space
(2)
smoothed analysis
(2)
non-convex optimization
(2)
lower bound
(2)
low-rank optimization
(2)
riemannian gradient descent
(2)
riemannian manifold
(2)
matrix completion
(2)
riemannian geometry
(1)
query complexity
(1)
convex relaxation
(1)
low-rank matrices
(1)
constrained optimization
(1)
low-rank matrix completion
(1)
Papers
Open Problem: Polynomial linearly-convergent method for g-convex optimization?
COLT 2023
Curvature and complexity: Better lower bounds for geodesically convex optimization
COLT 2023
Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oracles
COLT 2022
Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates
AISTATS 2021
Efficiently escaping saddle points on manifolds
NIPS 2019
Smoothed analysis of the low-rank approach for smooth semidefinite programs
NIPS 2018
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
COLT 2018
On the low-rank approach for semidefinite programs arising in synchronization and community detection
COLT 2016
The non-convex Burer-Monteiro approach works on smooth semidefinite programs
NIPS 2016
Manopt, a Matlab Toolbox for Optimization on Manifolds
JMLR 2014
RTRMC: A Riemannian trust-region method for low-rank matrix completion
NIPS 2011