Concept

Méthode de Monte-Carlo par chaînes de Markov

Publications associées (449)

Gibbs sampling the posterior of neural networks

Lenka Zdeborová, Giovanni Piccioli, Emanuele Troiani

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Bristol2024

On distributional autoregression and iterated transportation

Victor Panaretos, Laya Ghodrati

We consider the problem of defining and fitting models of autoregressive time series of probability distributions on a compact interval of Double-struck capital R. An order-1 autoregressive model in this context is to be understood as a Markov chain, where ...

Hoboken2024

Hausdorff dimension of fermions on a random lattice

Mattia Guerino Varrone

Geometric properties of lattice quantum gravity in two dimensions are studied numerically via Monte Carlo on Euclidean Dynamical Triangulations. A new computational method is proposed to simulate gravity coupled with fermions, which allows the study of int ...

Elsevier2024

Glenohumeral joint force prediction with deep learning

Dominique Pioletti, Alexandre Terrier, Patrick Goetti, Philippe Büchler

Deep learning models (DLM) are efficient replacements for computationally intensive optimization techniques. Musculoskeletal models (MSM) typically involve resource-intensive optimization processes for determining joint and muscle forces. Consequently, DLM ...

London2024

Accretion Disk Size and Updated Time-delay Measurements in the Gravitationally Lensed Quasar SDSS J165043.44+425149.3

Frédéric Courbin, Martin Raoul Robert Millon

We analyze variability in 15-season optical lightcurves from the doubly imaged lensed quasar SDSS J165043.44+425149.3 (SDSS1650), comprising five seasons of monitoring data from the Maidanak Observatory (277 nights in total, including the two seasons of da ...

Iop Publishing Ltd2024

Hybrid Simulator for Capturing Dynamics of Synthetic Populations

Michel Bierlaire, Marija Kukic

This paper presents a novel hybrid framework for generating and updating a synthetic population. We call it hybrid because it combines model-based and data-driven approaches. Existing generators produce a snapshot of synthetic data that becomes outdated ov ...

IEEE2024

Boosting likelihood learning with event reweighting

Andrea Wulzer, Alfredo Glioti, Siyu Chen

Extracting maximal information from experimental data requires access to the likelihood function, which however is never directly available for complex experiments like those performed at high energy colliders. Theoretical predictions are obtained in this ...

Springer2024

Stochastic adaptive resampling for the estimation of discrete choice models

Michel Bierlaire, Nicola Marco Ortelli, Matthieu Marie Cochon de Lapparent

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

2023

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings

Fabio Nobile, Juan Pablo Madrigal Cianci

In this work, we present, analyze, and implement a class of multilevel Markov chain Monte Carlo(ML-MCMC) algorithms based on independent Metropolis--Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solving ...

2023

Synthetic Generation of Activity-related data

Quentin Philippe Bochud

The field of synthetic data is more and more present in our everyday life. The transportation domain is particularly interested in improving the methods for the generation of synthetic data in order to address the privacy and availability issue of real dat ...

2023

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search