Lecture

Statistical Hypothesis Testing

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 the comparison of two simple hypotheses, Neyman-Pearson lemma, rejection regions, optimal tests, probabilities, likelihood, maximum likelihood estimation, observed and expected information, and the construction of confidence intervals. It also discusses the likelihood ratio statistic, limit distribution of the maximum likelihood estimator, and the elements of a statistical hypothesis test. The instructor explains the importance of p-values, power of tests, and decision-making based on statistical evidence.

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, Statistical hypothesis testing

Related concepts (32)

Statistical hypothesis testing

A statistical hypothesis test is a method of statistical inference used to decide whether the data at hand sufficiently support a particular hypothesis. Hypothesis testing allows us to make probabilistic statements about population parameters. While hypothesis testing was popularized early in the 20th century, early forms were used in the 1700s. The first use is credited to John Arbuthnot (1710), followed by Pierre-Simon Laplace (1770s), in analyzing the human sex ratio at birth; see .

Maximum likelihood estimation

In statistics, maximum likelihood estimation (MLE) is a method of estimating the parameters of an assumed probability distribution, given some observed data. This is achieved by maximizing a likelihood function so that, under the assumed statistical model, the observed data is most probable. The point in the parameter space that maximizes the likelihood function is called the maximum likelihood estimate. The logic of maximum likelihood is both intuitive and flexible, and as such the method has become a dominant means of statistical inference.

Merge algorithm

Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements of the inputs lists in sorted order. These algorithms are used as subroutines in various sorting algorithms, most famously merge sort. The merge algorithm plays a critical role in the merge sort algorithm, a comparison-based sorting algorithm.

Power of a test

In statistics, the power of a binary hypothesis test is the probability that the test correctly rejects the null hypothesis () when a specific alternative hypothesis () is true. It is commonly denoted by , and represents the chances of a true positive detection conditional on the actual existence of an effect to detect. Statistical power ranges from 0 to 1, and as the power of a test increases, the probability of making a type II error by wrongly failing to reject the null hypothesis decreases.

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)

Probability and Statistics

Delves into probability, statistics, paradoxes, and random variables, showcasing their real-world applications and properties.

Probability Distributions in Environmental Studies

Explores probability distributions for random variables in air pollution and climate change studies, covering descriptive and inferential statistics.

Estimation and Confidence Intervals

Explores bias, variance, and confidence intervals in parameter estimation using examples and distributions.

Probabilities and Statistics

Covers fundamental concepts in probabilities and statistics, including linear regression, exploratory statistics, and the analysis of probabilities.

Likelihood Ratio Tests: Optimality and Extensions