Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Noisy Gradient Descent Algorithms

In course

PHYS-754: Lecture series on scientific machine learning

This lecture presents ongoing work on how scientific questions can be tackled using machine learning. Machine learning enables extracting knowledge from data computationally and in an automatized way. We will learn on examples how this is influencing the v ...

Description

This lecture discusses the motivation behind noisy gradient descent algorithms, their performance compared to message passing and SCPs, and the use of the spiked mixed matrix tensor model to analyze large-scale algorithms. It also covers the Bayesian estimator, approximate message passing, and the Langevin algorithm, exploring their properties and performance in high-dimensional non-convex optimization problems.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Instructors (10)

Giuseppe Carleo is a computational quantum physicist, whose main focus is the development of advanced numerical algorithms tostudy challenging problems involving strongly interacting quantum systems.He is best known for the introduction of machine learning techniques to study both equilibrium and dynamical properties,based on a neural-network representations of quantum states, as well for the time-dependent variational Monte Carlo method.He earned a Ph.D. in Condensed Matter Theory from the International School for Advanced Studies (SISSA) in Italy in 2011.He held postdoctoral positions at the Institut d’Optique in France and ETH Zurich in Switzerland, where he alsoserved as a lecturer in computational quantum physics.In 2018, he joined the Flatiron Institute in New York City in 2018 at the Center for Computational Quantum Physics (CCQ), working as a Research Scientist and project leader, and also leading the development of the open-source project NetKet.Since September 2020 he is an assistant professor at EPFL, in Switzerland, leading the Computational Quantum Science Laboratory (CQSL).

Paolo De Los Rios

Paolo De Los Rios earned his master in Electronic Engineering at the Turin Institute of Technology (Politecnico di Torino) in May 1993. In November 1993 he moved to Trieste, Italy, to enter the PhD program in Theoretical Condensed Matter Theory at the International School for Advanced Studies (SISSA/ISAS) where he obtained the PhD degree in October 1996 for his work on the statistical physics of disordered systems. After a one year postdoc at the Max-Planck Institute for the Physics of Complex Systems in Dresden, Germany, in November 1997 he moved to the University of Fribourg, Switzerland, to join the group of Prof. Yi-Cheng Zhang. There he has worked on various applications of statistical physics to complex systems. In September 2000 he has been appointed Assistant Professor in Statistical Physics of Living Matter and Complex Systems at the Institute of Theoretical Physics of the University of Lausanne, Switzerland. Since April 2010 he is Associate Professor at the Institute of Theoretical Physics of the Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland.

Michele Ceriotti

Official source

Related concepts (8)

Bias of an estimator

In statistics, the bias of an estimator (or bias function) is the difference between this estimator's expected value and the true value of the parameter being estimated. An estimator or decision rule with zero bias is called unbiased. In statistics, "bias" is an property of an estimator. Bias is a distinct concept from consistency: consistent estimators converge in probability to the true value of the parameter, but may be biased or unbiased; see bias versus consistency for more.

Invariant estimator

In statistics, the concept of being an invariant estimator is a criterion that can be used to compare the properties of different estimators for the same quantity. It is a way of formalising the idea that an estimator should have certain intuitively appealing qualities. Strictly speaking, "invariant" would mean that the estimates themselves are unchanged when both the measurements and the parameters are transformed in a compatible way, but the meaning has been extended to allow the estimates to change in appropriate ways with such transformations.

Minimum-variance unbiased estimator

In statistics a minimum-variance unbiased estimator (MVUE) or uniformly minimum-variance unbiased estimator (UMVUE) is an unbiased estimator that has lower variance than any other unbiased estimator for all possible values of the parameter. For practical statistics problems, it is important to determine the MVUE if one exists, since less-than-optimal procedures would naturally be avoided, other things being equal. This has led to substantial development of statistical theory related to the problem of optimal estimation.

Dimensionality reduction

Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the low-dimensional representation retains some meaningful properties of the original data, ideally close to its intrinsic dimension. Working in high-dimensional spaces can be undesirable for many reasons; raw data are often sparse as a consequence of the curse of dimensionality, and analyzing the data is usually computationally intractable (hard to control or deal with).

Principal component analysis

Principal component analysis (PCA) is a popular technique for analyzing large datasets containing a high number of dimensions/features per observation, increasing the interpretability of data while preserving the maximum amount of information, and enabling the visualization of multidimensional data. Formally, PCA is a statistical technique for reducing the dimensionality of a dataset. This is accomplished by linearly transforming the data into a new coordinate system where (most of) the variation in the data can be described with fewer dimensions than the initial data.

Related lectures (21)

Monte Carlo: Markov Chains

Covers unsupervised learning, dimensionality reduction, SVD, low-rank estimation, PCA, and Monte Carlo Markov Chains.

Shrinkage Estimation of Large Covariance Matrices

Explores shrinkage estimation of high-dimensional covariance matrices, comparing linear and nonlinear approaches for improved accuracy.

Flexibility of Models & Bias-Variance Trade-Off

Delves into the trade-off between model flexibility and bias-variance in error decomposition, polynomial regression, KNN, and the curse of dimensionality.

Frequency Moments: Estimators and Algorithms

Covers the concept of frequency moments and introduces algorithms for estimating them efficiently.

Principal Components: Properties & Applications