Publications related to Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators

Related publications (31)

Gibbs sampling the posterior of neural networks

Lenka Zdeborová, Emanuele Troiani, Giovanni Piccioli

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Iop Publishing Ltd2024

Geometric Learning: Leveraging differential geometry for learning and control

Bernardo Fichera

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

EPFL2024

Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks

Nicolas Henri Bernard Flammarion, Scott William Pesme, Hristo Georgiev Papazov

In this work, we investigate the effect of momentum on the optimisation trajectory of gradient descent. We leverage a continuous-time approach in the analysis of momentum gradient descent with step size

\gamma

and momentum parameter

\beta

that allows u ...

2024

Into the ice: Exploration and data capturing in glacial moulins by a tethered robot

Josephine Anna Eleanor Hughes, Max Mirko Polzin

Glacial moulins (cylindrical meltwater drainage shafts) provide valuable insights into glacier dynamics, but are inaccessible and hazardous environments for humans to study. Exploring them using passive sensor probes has revealed their complex geometry, wh ...

Wiley2024

On the Generalization of Stochastic Gradient Descent with Momentum

Volkan Cevher, Kimon Antonakopoulos

While momentum-based accelerated variants of stochastic gradient descent (SGD) are widely used when training machine learning models, there is little theoretical understanding on the generalization error of such methods. In this work, we first show that th ...

Microtome Publishing2024

Anomalous and Chern topological waves in hyperbolic networks

Romain Christophe Rémy Fleury, Haoye Qin, Zhe Zhang, 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 ...

Nature Research2024

Phenomenological theory of variational quantum ground-state preparation

Ivano Tavernelli, Giuseppe Carleo

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

Amer Physical Soc2023

Robust Collaborative Learning with Linear Gradient Overhead

Rachid Guerraoui, Nirupam Gupta, Rafaël Benjamin Pinot, Le Nguyen Hoang, Sadegh Farhadkhani, John Stephan

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

PLMR2023

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Thanh Trung Huynh

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

Wiley-Hindawi2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Universal and adaptive methods for robust stochastic optimization

Ali Kavis

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

EPFL2023

Towards Stable and Efficient Adversarial Training against $l_1$ Bounded Adversarial Attacks

Sabine Süsstrunk, Mathieu Salzmann, Chen Liu, Yulun Jiang

We address the problem of stably and efficiently training a deep neural network robust to adversarial perturbations bounded by an

l_1

norm. We demonstrate that achieving robustness against

l_1

-bounded perturbations is more challenging than in the

l_2

...

2023

A structured prediction approach for robot imitation learning

Aude Billard, Iason Batzianoulis

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

Stochastic adaptive resampling for the estimation of discrete choice models

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Nicola Marco Ortelli

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

2023

Localization errors of the stochastic heat equation

David Jean-Michel Candil

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

EPFL2022

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

Christopher Arnold Criscitiello, Nicolas Boumal

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

Reduced representations of complexes, signals, and multifiltrations

Celia Camille Hacker

The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...

EPFL2022

Multi-Level Monte Carlo Methods for Uncertainty Quantification and Risk-Averse Optimisation

Sundar Subramaniam Ganesh

This work aims to study the effects of wind uncertainties in civil engineering structural design. Optimising the design of a structure for safety or operability without factoring in these uncertainties can result in a design that is not robust to these per ...

EPFL2022

Relative, local and global dimension in complex networks

Alexis Arnaudon

Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and distorted by inhomogenei ...

Nature Portfolio2022

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Volkan Cevher, Ali Kavis, Kimon Antonakopoulos, Leello Tadesse Dadi, Efstratios Panteleimon Skoulakis

We propose an adaptive variance-reduction method, called AdaSpider, for minimization of L-smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines an AdaGrad-inspired [Duchi et al., 2011, McMahan & Streeter, 2010], but a fai ...

2022