Lecture

Explicit Stabilised Methods: Applications to Bayesian Inverse Problems

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.

Description

This lecture by the instructor focuses on explicit stabilised Runge-Kutta methods and their application to Bayesian inverse problems. The content covers the statement of optimization and sampling problems, applications in machine learning and imaging inverse problems, gradient flow, Langevin dynamics, speed of convergence, numerical discretisation, quadratic minimisation, and the use of stabilised methods in optimization and sampling. The lecture also delves into the implementation, complexity, and cost reduction of these methods, as well as their use in optimisation and sampling for imaging inverse problems. The presentation concludes with discussions on stiffness through smoothing, the behaviour of the auto-correlation function, and future work in the field.

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Statistics

Data collection: Statistical sampling

Related concepts (32)

Sampling (statistics)

In statistics, quality assurance, and survey methodology, sampling is the selection of a subset or a statistical sample (termed sample for short) of individuals from within a statistical population to estimate characteristics of the whole population. Statisticians attempt to collect samples that are representative of the population. Sampling has lower costs and faster data collection compared to recording data from the entire population, and thus, it can provide insights in cases where it is infeasible to measure an entire population.

Runge–Kutta methods

In numerical analysis, the Runge–Kutta methods (ˈrʊŋəˈkʊtɑː ) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations. These methods were developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta. The most widely known member of the Runge–Kutta family is generally referred to as "RK4", the "classic Runge–Kutta method" or simply as "the Runge–Kutta method".

Stratified sampling

In statistics, stratified sampling is a method of sampling from a population which can be partitioned into subpopulations. In statistical surveys, when subpopulations within an overall population vary, it could be advantageous to sample each subpopulation (stratum) independently. Stratification is the process of dividing members of the population into homogeneous subgroups before sampling. The strata should define a partition of the population.

Computational mathematics

Computational mathematics is an area of mathematics devoted to the interaction between mathematics and computer computation. A large part of computational mathematics consists roughly of using mathematics for allowing and improving computer computation in areas of science and engineering where mathematics are useful. This involves in particular algorithm design, computational complexity, numerical methods and computer algebra. Computational mathematics refers also to the use of computers for mathematics itself.

Convenience sampling

Convenience sampling (also known as grab sampling, accidental sampling, or opportunity sampling) is a type of non-probability sampling that involves the sample being drawn from that part of the population that is close to hand. This type of sampling is most useful for pilot testing. Convenience sampling is not often recommended for research due to the possibility of sampling error and lack of representation of the population. But it can be handy depending on the situation. In some situations, convenience sampling is the only possible option.

Related lectures (64)

Digital Signal Processing: Theory

Covers the theory of digital signal processing, including sampling, transformation methods, digitization, and PID controllers.

Eigenvalues and Optimization: Numerical Analysis Techniques

Discusses eigenvalues, their calculation methods, and their applications in optimization and numerical analysis.

Implicit Schemes in Numerical Analysis

Explores implicit schemes in numerical analysis, emphasizing stability and convergence properties in solving differential equations.

Runge-Kutta Methods: Approximating Differential Equations

Covers the stages of the explicit Runge-Kutta method for approximating y(t) with detailed explanations.

Other Methods: Crank-Nicolson