Publication

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Publications associées (30)

Universal and adaptive methods for robust stochastic optimization

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

Distributional Regression and Autoregression via Optimal Transport

Laya Ghodrati

We present a framework for performing regression when both covariate and response are probability distributions on a compact and convex subset of

\R^d

. Our regression model is based on the theory of optimal transport and links the conditional Fr'echet m ...

EPFL2023

Personalized Privacy-Preserving Distributed Learning on Heterogeneous Data

Michael Christoph Gastpar, Aditya Pradeep

One major challenge in distributed learning is to efficiently learn for each client when the data across clients is heterogeneous or non iid (not independent or identically distributed). This provides a significant challenge as the data of the other client ...

2023

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Baiwei Guo, Giancarlo Ferrari Trecate, Yuning Jiang, Maryam Kamgarpour

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

IEEE2023

Functional data analysis with rough sample paths?

Victor Panaretos, Neda Mohammadi Jouzdani

Functional data are typically modeled as sample paths of smooth stochastic processes in order to mitigate the fact that they are often observed discretely and noisily, occasionally irregularly and sparsely. The smoothness assumption is imposed to allow for ...

TAYLOR & FRANCIS LTD2024

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

End-to-End Learning for Stochastic Optimization: A Bayesian Perspective

Daniel Kuhn, Yves Rychener, Tobias Sutter

We develop a principled approach to end-to-end learning in stochastic optimization. First, we show that the standard end-to-end learning algorithm admits a Bayesian interpretation and trains a posterior Bayes action map. Building on the insights of this an ...

2023

Hamiltonian Deep Neural Networks Guaranteeing Non-Vanishing Gradients by Design

Giancarlo Ferrari Trecate, Clara Lucía Galimberti, Liang Xu, Luca Furieri

Deep Neural Networks (DNNs) training can be difficult due to vanishing and exploding gradients during weight optimization through backpropagation. To address this problem, we propose a general class of Hamiltonian DNNs (H-DNNs) that stem from the discretiz ...

2023

Probabilistic methods for neural combinatorial optimization

Nikolaos Karalias

The monumental progress in the development of machine learning models has led to a plethora of applications with transformative effects in engineering and science. This has also turned the attention of the research community towards the pursuit of construc ...

EPFL2023

LDP and CLT for SPDEs with transport noise

Lucio Galeati

In this work we consider solutions to stochastic partial differential equations with transport noise, which are known to converge, in a suitable scaling limit, to solution of the corresponding deterministic PDE with an additional viscosity term. Large devi ...

SPRINGER2023

Publications associées (30)

Universal and adaptive methods for robust stochastic optimization

Ali Kavis

EPFL2023

Distributional Regression and Autoregression via Optimal Transport

Laya Ghodrati

We present a framework for performing regression when both covariate and response are probability distributions on a compact and convex subset of

\R^d

. Our regression model is based on the theory of optimal transport and links the conditional Fr'echet m ...

EPFL2023