Lecture

Monte-Carlo Integration: Approximation and Variance

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 covers Monte-Carlo integration, focusing on the approximation of expectations and variances using random sampling. It explains how to estimate the variance of a function and the desired precision through the number of draws. The instructor also discusses the error components in conditional choice models and the parameters estimation using maximum simulated likelihood.

In MOOC

Selected Topics on Discrete Choice

The logit model is the workhorse of choice modelers. But it has some limitations. In particular, some assumptions used to derive it may not be consistent with the behavioral reality. It may lead to erroneous forecast. We illustrated using the so-called "red bud-blue bus" paradox, and Multivariate Extre Value models, addressing some of these issues, are introduced. The sampling procedure used to collect choice data has a critical impact on the model estimation procedure. We introduce classical sampling proc

Official source

Related concepts (25)

Simple random sample

In statistics, a simple random sample (or SRS) is a subset of individuals (a sample) chosen from a larger set (a population) in which a subset of individuals are chosen randomly, all with the same probability. It is a process of selecting a sample in a random way. In SRS, each subset of k individuals has the same probability of being chosen for the sample as any other subset of k individuals. A simple random sample is an unbiased sampling technique. Simple random sampling is a basic type of sampling and can be a component of other more complex sampling methods.

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.

Cluster sampling

In statistics, cluster sampling is a sampling plan used when mutually homogeneous yet internally heterogeneous groupings are evident in a statistical population. It is often used in marketing research. In this sampling plan, the total population is divided into these groups (known as clusters) and a simple random sample of the groups is selected. The elements in each cluster are then sampled. If all elements in each sampled cluster are sampled, then this is referred to as a "one-stage" cluster sampling plan.

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.

Variance

In probability theory and statistics, variance is the squared deviation from the mean of a random variable. The variance is also often defined as the square of the standard deviation. Variance is a measure of dispersion, meaning it is a measure of how far a set of numbers is spread out from their average value. It is the second central moment of a distribution, and the covariance of the random variable with itself, and it is often represented by , , , , or .

Related lectures (64)

Density of States and Bayesian Inference in Computational Mathematics

Explores computing density of states and Bayesian inference using importance sampling, showcasing lower variance and parallelizability of the proposed method.

Max Entropy and Monte Carlo

Explores max entropy, Shannon's entropy, Lagrange multipliers, and Monte Carlo sampling techniques.

Approximate Query Processing: BlinkDB

Introduces BlinkDB, a framework for approximate query processing using sampling techniques.

Monte Carlo: Optimization and Estimation

Explores optimization and estimation in Monte Carlo methods, emphasizing Bayes-optimal groups and estimators.

Markov Chains: Applications and Sampling Methods