Publications related to Total Variation Regularization for Manifold-Valued Data

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 ...

Springer2024

A graph convolutional autoencoder approach to model order reduction for parametrized PDEs

Jan Sickmann Hesthaven, Federico Pichi

The present work proposes a framework for nonlinear model order reduction based on a Graph Convolutional Autoencoder (GCA-ROM). In the reduced order modeling (ROM) context, one is interested in obtaining real -time and many-query evaluations of parametric ...

Academic Press Inc Elsevier Science2024

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Axel Elie Joseph Séguin

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

EPFL2023

Floyd's manifold is a conjugation space

Jérôme Scherer

E. E. Floyd showed in 1973 that there exist only two nontrivial cobor-dism classes that contain manifolds with three cells, and that they lie in dimen-sions 10 and 5. We prove that there is an action of the cyclic group C2 on the 10-dimensional Floyd manif ...

Scuola Normale Superiore2023

Critical Schrodinger Cat Qubit

Vincenzo Savona, Luca Gravina, Fabrizio Minganti

Encoding quantum information onto bosonic systems is a promising route to quantum error correc-tion. In a cat code, this encoding relies on the confinement of the dynamics of the system onto the two-dimensional manifold spanned by Schrodinger cats of oppos ...

AMER PHYSICAL SOC2023

A structured prediction approach for robot imitation learning

Aude Billard, Iason Batzianoulis, Anqing Duan

We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised le ...

Sage Publications Ltd2023

Continuous-variable neural network quantum states and the quantum rotor model

Giuseppe Carleo

We initiate the study of neural network quantum state algorithms for analyzing continuous-variable quantum systems in which the quantum degrees of freedom correspond to coordinates on a smooth manifold. A simple family of continuous-variable trial wavefunc ...

SPRINGERNATURE2023

Biodegradable Implantable Microsystems

Jürgen Brugger, Jongeon Park

Biodegradable implanted devices and microsystems are candidates to fulfill the utmost required in-vivo assistance for a variety of envisioned bio-medical health care applications. They range from monitoring biomarkers, recording, and stimulation, to local ...

IEEE2023

Persistence and the Sheaf-Function Correspondence

Nicolas Michel Berkouk

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently in ...

Cambridge Univ Press2023

A Theory of Finite-Width Neural Networks: Generalization, Scaling Laws, and the Loss Landscape

Berfin Simsek

Deep learning has achieved remarkable success in various challenging tasks such as generating images from natural language or engaging in lengthy conversations with humans. The success in practice stems from the ability to successfully train massive neural ...

EPFL2023

A geometric optimal control approach for imitation and generalization of manipulation skills

Sylvain Calinon, Amirreza Razmjoo Fard, Jie Zhao

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Elsevier2023

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

Pascal Fua, Sean Lewis Hill, Amos Sironi, Jiancheng Yang, Jian Zhou, Siqi Liu, Xiang Li, Jie Zhou

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in m ...

2023

Bounded and unbounded cohomology of homeomorphism and diffeomorphism groups

Nicolas Monod

We determine the bounded cohomology of the group of homeomorphisms of certain low-dimensional manifolds. In particular, for the group of orientation-preserving homeomorphisms of the circle and of the closed 2-disc, it is isomorphic to the polynomial ring g ...

SPRINGER HEIDELBERG2023

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

Nicolas Boumal

We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle: On a nonsmooth se ...

SPRINGER HEIDELBERG2022

A b-symplectic slice theorem

Anna Kiesenhofer

In this article, motivated by the study of symplectic structures on manifolds with boundary and the systematic study of b-symplectic manifolds started in Guillemin, Miranda, and Pires Adv. Math. 264 (2014), 864-896, we prove a slice theorem for Lie group a ...

WILEY2022

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Nicolas Boumal, Christopher Arnold Criscitiello

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

SPRINGER2022

Continuation Methods For Riemannian Optimization

Daniel Kressner, Axel Elie Joseph Séguin

Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...

SIAM PUBLICATIONS2022

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Nicolas Henri Bernard Flammarion

We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...

Microtome Publishing2022

Learning to Represent and Reconstruct 3D Deformable Objects

Jan Bednarík

Representing and reconstructing 3D deformable shapes are two tightly linked problems that have long been studied within the computer vision field. Deformable shapes are truly ubiquitous in the real world, whether be it specific object classes such as human ...

EPFL2022

Slice Estimation in Diffusion MRI of Neonatal and Fetal Brains in Image and Spherical Harmonics Domains Using Autoencoders

Meritxell Bach Cuadra, Hamza Kebiri, Gabriel Girard, Erick Jorge Canales Rodriguez, Thomas Yu

Diffusion MRI (dMRI) of the developing brain can provide valuable insights into the white matter development. However, slice thickness in fetal dMRI is typically high (i.e., 3-5 mm) to freeze the in-plane motion, which reduces the sensitivity of the dMRI s ...

SPRINGER INTERNATIONAL PUBLISHING AG2022