Lecture

Noisy Gradient Descent Algorithms

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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.

Instructors (10)

Alexander Mathis

Alexander studied pure mathematics with a minor in logic and theory of science at the Ludwig Maximilians University in Munich. For his PhD also at LMU, he worked on optimal coding approaches to elucidate the properties of grid cells. As a postdoctoral fellow with Prof. Venkatesh N. Murthy at Harvard University and Prof. Matthias Bethge at Tuebingen AI, he decided to study olfactory behaviors such as odor-guided navigation, social behaviors and the cocktail party problem in mice. During this time, he increasingly got interested sensorimotor behaviors beyond olfaction and started working on proprioception, motor adaption, as well as computer vision tools for measuring animal behavior. In his group, he is interested in elucidating how the brain gives rise to adaptive behavior. One of the major goals is to synthesize large datasets into computationally useful information. For those purposes, he develops algorithms and systems to analyze animal behavior (e.g. DeepLabCut), neural data, as well as creates experimentally testable computational models.

Giuseppe Carleo

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

Lenka Zdeborová

Lenka Zdeborová is a Professor of Physics and of Computer Science in École Polytechnique Fédérale de Lausanne where she leads the Statistical Physics of Computation Laboratory. She received a PhD in physics from University Paris-Sud and from Charles University in Prague in 2008. She spent two years in the Los Alamos National Laboratory as the Director's Postdoctoral Fellow. Between 2010 and 2020 she was a researcher at CNRS working in the Institute of Theoretical Physics in CEA Saclay, France. In 2014, she was awarded the CNRS bronze medal, in 2016 Philippe Meyer prize in theoretical physics and an ERC Starting Grant, in 2018 the Irène Joliot-Curie prize, in 2021 the Gibbs lectureship of AMS. She is an editorial board member for Journal of Physics A, Physical Review E, Physical Review X, SIMODS, Machine Learning: Science and Technology, and Information and Inference. Lenka's expertise is in applications of concepts from statistical physics, such as advanced mean field methods, replica method and related message-passing algorithms, to problems in machine learning, signal processing, inference and optimization. She enjoys erasing the boundaries between theoretical physics, mathematics and computer science.

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)

Dimensionality Reduction

Introduces artificial neural networks and explores various dimensionality reduction techniques like PCA, LDA, Kernel PCA, and t-SNE.

Monte Carlo: Markov Chains

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

PCA: Directions of Largest Variance Log in to Mediaspace to watch this video

Covers PCA, finding directions of largest variance, data dimensionality reduction, and limitations of PCA.

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