paper-with-me

Papers

Deep Learning-enabled MCMC for Probabilistic State Estimation in District Heating Grids

2023-05-24 · Andreas Bott, Tim Janke, Florian Steinke

Flexible district heating grids form an important part of future, low-carbon energy systems. We examine probabilistic state estimation in such grids, i.e., we aim to estimate the posterior probability distribution over all grid state variables such as pressures, temperatures, and mass flows conditional on measurements of a subset of these states. Since the posterior state distribution does not belong to a standard class of probability distributions, we use Markov Chain Monte Carlo (MCMC) sampling in the space of network heat exchanges and evaluate the samples in the grid state space to estimate the posterior. Converting the heat exchange samples into grid states by solving the non-linear grid equations makes this approach computationally burdensome. However, we propose to speed it up by employing a deep neural network that is trained to approximate the solution of the exact but slow non-linear solver. This novel approach is shown to deliver highly accurate posterior distributions both for classic tree-shaped as well as meshed heating grids, at significantly reduced computational costs that are acceptable for online control. Our state estimation approach thus enables tightening the safety margins for temperature and pressure control and thereby a more efficient grid operation.

📄 PDF Abstract BibTeX arXiv:2305.15445

Code (1)

eins-tuda/dnn_mcmc4dh 공식 구현 tf

Tasks

State Estimation

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions

2025-10-20 · Atticus McWhorter, Daryl DeFord arxiv

Novel Markov Chain Monte Carlo (MCMC) methods have enabled the generation of large ensembles of redistricting plans through graph partitioning. However, existing algorithms such as Reversible Recombination (RevReCom) and…

graph partitioning

Sublinear-Time Approximate MCMC Transitions for Probabilistic Programs

2014-11-06 · Yutian Chen, Vikash Mansinghka, Zoubin Ghahramani

Probabilistic programming languages can simplify the development of machine learning techniques, but only if inference is sufficiently scalable. Unfortunately, Bayesian parameter estimation for highly coupled models such…

parameter estimationProbabilistic ProgrammingState EstimationState Space Models

Parameter elimination in particle Gibbs sampling

2019-10-30 · NeurIPS 2019 12 · Anna Wigren, Riccardo Sven Risuleo, Lawrence Murray, Fredrik Lindsten

Bayesian inference in state-space models is challenging due to high-dimensional state trajectories. A viable approach is particle Markov chain Monte Carlo, combining MCMC and sequential Monte Carlo to form "exact approxi…

Bayesian InferenceEpidemiologyProbabilistic ProgrammingState Space Models

Bayesian multiscale deep generative model for the solution of high-dimensional inverse problems

2021-02-04 · Yingzhi Xia, Nicholas Zabaras

Estimation of spatially-varying parameters for computationally expensive forward models governed by partial differential equations is addressed. A novel multiscale Bayesian inference approach is introduced based on deep …

Bayesian Inferenceparameter estimation

Electoral David vs Goliath: How does the Spatial Concentration of Electors affect District-based Elections?

2020-06-21 · Adway Mitra

Many democratic countries use district-based elections where there is a "seat" for each district in the governing body. In each district, the party whose candidate gets the maximum number of votes wins the corresponding …

parameter estimationregression