Markov Chain Monte Carlo using couplings toward scalable statistical inference
Location: France
Source: EU Funding & Tenders Portal
This project develops a statistical toolbox for the approximation of probability distributions that commonly arise in data analysis. The problem of approximating probabilities arise in many tasks of data science: in Bayesian statistics and its many variants, in classical hypothesis testing with p-values, in likelihood-based methods when the model involves latent variables, in models with intractab
- Status
- Under Construction
- Location
- France
- Updated
- 22 Jul 2026
- Source
- EU Funding & Tenders Portal
ConstructChat
Ask ConstructChat about Markov Chain Monte Carlo using couplings toward scalable statistical inference
Pick a question to edit it, or write your own.
First answer free · no account
Project Information FAQ
Project Information
Participants
| Not available for this record. |
Status
Original status | ongoing |
Taiyo status | Under Construction |
Taiyo last update | 2026-07-22 |
Contact
| Not available for this record. |
Description
Description | This project develops a statistical toolbox for the approximation of probability distributions that commonly arise in data analysis. The problem of approximating probabilities arise in many tasks of data science: in Bayesian statistics and its many variants, in classical hypothesis testing with p-values, in likelihood-based methods when the model involves latent variables, in models with intractable likelihoods, in the construction of knockoffs for principled variable selection, for example. State-of-the-art methods for such approximations include Markov chain Monte Carlo (MCMC), where a Markov chain is generated in such a way that it converges to the probability of interest as the length of the sequence goes to infinity. This stands at odds with modern developments in computing hardware, which provide an increasing number of parallel processors, but where each process has a stagnating clock speed. Methods that are amenable to parallel computing must emerge to help scientists in all fields to make the most of their data. The project builds upon a framework called Unbiased Markov chain Monte Carlo (UMCMC), in which accuracy improves arbitrarily with the number of parallel runs. Each run involves the generation of coupled Markov chains for a random time horizon. Part 1 develops UMCMC to realize its potential as a comprehensive basis for probabilistic computation on modern hardware. The project includes theoretical analyses of cost and measures of efficiency, and methodological innovations towards adaptive, efficient, robust and convenient computation. Part 2 contributes to the applicability of UMCMC, by conceptualizing the design of coupled Markov transitions, and considering a number of challenging settings: distributions supported on submanifolds and their application in economics, distributions on graphs and their applications in the fight against malaria, and Bayesian nonparametric models for cell type deconvolution from transcriptomics data. |
Location
Country | France |
Source
Source | EU Funding & Tenders Portal |
URL |
More Details
Record type | Project |
Article published date | 2025-10-01 |
Research
Free account
View all details
You are reading the public part. A free account opens the rest:
- Every detail on this project
- News and media coverage
- Technical research
Free account · no card · lands you back on this project
More infrastructure projects in France
- Projet 18e - Porte de Clignancourt
- Projet Broussais
- 250 premiers projets pour entretenir et rénover Paris
- Protocole d'accord RATP/Ville de Paris: création de 2000 logements d'ici 2024
- Chapelle Dubois Condorcet
- Les dix lauréats de l'appel à projets de l'Arc de l'innovation
- Projet 16e - 17e - Porte Maillot
- Landivisiau Power Plant Brittany
