Lecture

Probability and Statistics

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

MATH-232: Probability and statistics (for IC)

Cours d'introduction à la théorie des probabilités et aux statistiques. ...

Description

This lecture covers topics such as p-quantile, normal approximation to the binomial distribution, de Moivre-Laplace theorem, and joint distributions. It explains the concepts of exponential family distributions, marginal and conditional distributions, and cumulative distribution functions. Examples include calculating joint cumulative distribution functions and conditional probability mass functions.

Instructors (2)

Emmanuel Abbé

Teaching & PhD PhD Students Denys Pushkin, Ortal Yona Senouf, Vladyslav Shashkov Past EPFL PhD Students Elisabetta Cornacchia, Aryo Lotfi Courses Reasoning in artificial intelligence MATH-700 Large language models have raised the potential of artificial intelligence in various applications, including science and mathematics, but their reasoning capabilities remain under investigations. This class focuses on defining, measuring and improving the reasoning capabilities of such AI models. Awa

Raphaël Jean Berthier

Official source

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Mathematics

Probability theory: Topics in probability theory

Related concepts (32)

Cumulative distribution function

In probability theory and statistics, the cumulative distribution function (CDF) of a real-valued random variable , or just distribution function of , evaluated at , is the probability that will take a value less than or equal to . Every probability distribution supported on the real numbers, discrete or "mixed" as well as continuous, is uniquely identified by a right-continuous monotone increasing function (a càdlàg function) satisfying and .

Conditional probability

In probability theory, conditional probability is a measure of the probability of an event occurring, given that another event (by assumption, presumption, assertion or evidence) has already occurred. This particular method relies on event B occurring with some sort of relationship with another event A. In this event, the event B can be analyzed by a conditional probability with respect to A. If the event of interest is A and the event B is known or assumed to have occurred, "the conditional probability of A given B", or "the probability of A under the condition B", is usually written as P(AB) or occasionally P_B(A).

Multivariate normal distribution

In probability theory and statistics, the multivariate normal distribution, multivariate Gaussian distribution, or joint normal distribution is a generalization of the one-dimensional (univariate) normal distribution to higher dimensions. One definition is that a random vector is said to be k-variate normally distributed if every linear combination of its k components has a univariate normal distribution. Its importance derives mainly from the multivariate central limit theorem.

Quantile function

In probability and statistics, the quantile function outputs the value of a random variable such that its probability is less than or equal to an input probability value. Intuitively, the quantile function associates with a range at and below a probability input the likelihood that a random variable is realized in that range for some probability distribution. It is also called the percentile function (after the percentile), percent-point function or inverse cumulative distribution function (after the cumulative distribution function).

Merge sort

In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.

Related lectures (64)

Normal Distribution: Properties and Calculations

Covers properties and calculations related to the normal distribution, including probabilities and quantiles.

Continuous Random Variables

Explores continuous random variables, density functions, joint variables, independence, and conditional densities.

Elements of Statistics: Probability and Random Variables

Introduces key concepts in probability and random variables, covering statistics, distributions, and covariance.

Probability and Statistics

Explores joint random variables, conditional density, and independence in probability and statistics.

Probability and Statistics

Covers fundamental concepts in probability and statistics, including distributions, properties, and expectations of random variables.

Related concepts (32)

Cumulative distribution function

Conditional probability

Multivariate normal distribution

Quantile function

Merge sort