MOOC
Introduction to optimization on smooth manifolds: first order methods
Related publications (1,000)
From low-rank retractions to dynamical low-rank approximation and back
Daniel Kressner, Axel Elie Joseph Séguin, Gianluca Ceruti
In algorithms for solving optimization problems constrained to a smooth manifold, retractions are a well-established tool to ensure that the iterates stay on the manifold. More recently, it has been demonstrated that retractions are a useful concept for ot ...
Springer2024Scalable constrained optimization
Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...
EPFL2024Geometric Learning: Leveraging differential geometry for learning and control
In this thesis, we concentrate on advancing high-level behavioral control policies for robotic systems within the framework of Dynamical Systems (DS). Throughout the course of this research, a unifying thread weaving through diverse fields emerges, and tha ...
EPFL2024SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION
Daniel Kressner, Alice Cortinovis
This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...
Siam Publications2024Anomalous and Chern topological waves in hyperbolic networks
Romain Christophe Rémy Fleury, Haoye Qin, Aleksi Antoine Bossart, Zhechen Zhang
Hyperbolic lattices are a new type of synthetic materials based on regular tessellations in non-Euclidean spaces with constant negative curvature. While so far, there has been several theoretical investigations of hyperbolic topological media, experimental ...
2024The effect of smooth parametrizations on nonconvex optimization landscapes
We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...
Springer Heidelberg2024Randomized low-rank approximation and its applications
In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...
EPFL2024A method and system for optimizing design, implantation, and stimulation protocols of electrodes stimulating the nervous system
Silvestro Micera, Simone Romeni
A method for optimizing at least one of a geometry, an implantation procedure, and/or stimulation protocol of one or more electrodes for an electrical stimulation of a target structure in a nervous system of a living being by a computer device, the method ...
2024Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning
Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...
EPFL2024Biobased surfactant
Jeremy Luterbacher, Songlan Sun, Stefania Bertella, Anastasiia Komarova
The present invention relates to a compound of the general formula (I), and (II)wherein one of R11 and R12 is hydrogen and the other is -CH2-R70, and one of R13 and R14 is hydrogen and the other is -CH2-R71, or wherein one of R11 and R12 is hydrogen and th ...
2024