Nicolas Boumal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Nicolas Boumal has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Amit Singer
Program in Applied and Computational Mathematics, Princeton University, Princeton, NJ, USA
1 shared publicationBamdev Mishra
Department of Electrical Engineering and Computer Science Université de Liège Liège Belgium
1 shared publicationP. -A. Absil
Department of Mathematical Engineering Université catholique de Louvain Louvain-La-Neuve Belgium
1 shared publicationP.- A. Absil
Department of Mathematical Engineering, ICTEAM Institute, Université catholique de Louvain, Louvain-la-Neuve, Belgium
1 shared publicationRodolphe Sepulchre
Department of Electrical Engineering and Computer Science Université de Liège Liège Belgium
1 shared publicationVincent D. Blondel
Department of Mathematical Engineering, ICTEAM Institute, Université catholique de Louvain, Louvain-la-Neuve, Belgium
1 shared publication
Latest Publications
- 1 January 2015
- Published by Springer Nature
- p. 467-475
Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
- 1 January 2015
- Published by Springer Nature
- p. 467-475
Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
- Open Access
- 26 September 2013
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 3 (1) , 1-39
Cramer-Rao bounds for synchronization of rotations
Synchronization of rotations is the problem of estimating a set of rotations Ri ∈ SO(n), i=1⋯ N, based on noisy measurements of relative rotations RiRj⊤. This fundamental problem has found many recent applications, most importantly in structural biology. We provide a framework to study synchronization as estimation on Riemannian manifolds for arbitrary n under a large family of noise models. The noise models we address encompass zero-mean isotropic noise, and we develop tools for Gaussian-like as well as heavy-tail types of noise in particular. As a main contribution, we derive the Cramér–Rao bounds of synchronization, that is, lower bounds on the variance of unbiased estimators. We find that these bounds are structured by the pseudoinverse of the measurement graph Laplacian, where edge weights are proportional to measurement quality. We leverage this to provide visualization tools for these bounds and interpretation in terms of random walks in both the anchored and anchor-free scenarios. Similar bounds previously established were limited to rotations in the plane and Gaussian-like noise.
- 26 September 2013
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 3 (1) , 1-39
Open AccessCramer-Rao bounds for synchronization of rotations
Synchronization of rotations is the problem of estimating a set of rotations Ri ∈ SO(n), i=1⋯ N, based on noisy measurements of relative rotations RiRj⊤. This fundamental problem has found many recent applications, most importantly in structural biology. We provide a framework to study synchronization as estimation on Riemannian manifolds for arbitrary n under a large family of noise models. The noise models we address encompass zero-mean isotropic noise, and we develop tools for Gaussian-like as well as heavy-tail types of noise in particular. As a main contribution, we derive the Cramér–Rao bounds of synchronization, that is, lower bounds on the variance of unbiased estimators. We find that these bounds are structured by the pseudoinverse of the measurement graph Laplacian, where edge weights are proportional to measurement quality. We leverage this to provide visualization tools for these bounds and interpretation in terms of random walks in both the anchored and anchor-free scenarios. Similar bounds previously established were limited to rotations in the plane and Gaussian-like noise.
- Open Access
Manopt, a Matlab toolbox for optimization on manifolds
Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design efficient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. Such structured constraints appear pervasively in machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent component analysis, metric learning, dimensionality reduction and so on. The Manopt toolbox, available at www.manopt.org, is a user-friendly, documented piece of software dedicated to simplify experimenting with state of the art Riemannian optimization algorithms. We aim particularly at reaching practitioners outside our field.
Open AccessManopt, a Matlab toolbox for optimization on manifolds
Optimization on manifolds is a rapidly developing branch of nonlinear optimization. Its focus is on problems where the smooth geometry of the search space can be leveraged to design efficient numerical algorithms. In particular, optimization on manifolds is well-suited to deal with rank and orthogonality constraints. Such structured constraints appear pervasively in machine learning applications, including low-rank matrix completion, sensor network localization, camera network registration, independent component analysis, metric learning, dimensionality reduction and so on. The Manopt toolbox, available at www.manopt.org, is a user-friendly, documented piece of software dedicated to simplify experimenting with state of the art Riemannian optimization algorithms. We aim particularly at reaching practitioners outside our field.