Related papers: Coarse-graining and reconstruction for Markov matr…
The inference of thermodynamic quantities from the description of an only partially accessible physical system is a central challenge in stochastic thermodynamics. A common approach is coarse-graining, which maps the dynamics of such a…
A stochastic incremental subgradient algorithm for the minimization of a sum of convex functions is introduced. The method sequentially uses partial subgradient information and the sequence of partial subgradients is determined by a general…
We develop an operator-based framework to coarse-grain interacting particle systems that exhibit clustering dynamics. Starting from the particle-based transfer operator, we first construct a sequence of reduced representations: the operator…
In this paper we develop a multiscale method to solve problems in complicated porous microstructures with Neumann boundary conditions. By using a coarse-grid quasi-interpolation operator to define a fine detail space and local orthogonal…
We consider the inverse problem of reconstructing an effective model for a prototypical diffusion process in strongly heterogeneous media based on coarse measurements. The approach is motivated by quasi-local numerical effective forward…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…
Lossy data transformations by definition lose information. Yet, in modern machine learning, methods like data pruning and lossy data augmentation can help improve generalization performance. We study this paradox using a solvable model of…
Markov chain Monte Carlo methods have become popular in statistics as versatile techniques to sample from complicated probability distributions. In this work, we propose a method to parameterize and train transition kernels of Markov chains…
Coarse graining techniques offer a promising alternative to large-scale simulations of complex dynamical systems, as long as the coarse-grained system is truly representative of the initial one. Here, we investigate how the dynamical…
We assess Coarse Graining by studying different partitions of the phase space of the Baker transformation and the periodic torus automorphisms. It turns out that the shape of autocorrelation functions for the Baker transformation is more or…
Self-organizing systems demonstrate how simple local rules can generate complex stochastic patterns. Many natural systems rely on such dynamics, making self-organization central to understanding natural complexity. A fundamental challenge…
We introduce a mesoscopic partition function for classical many-body systems based on a combined spatial and phase-space coarse-graining, replacing the canonical phase-space integral with a discrete sum over occupation numbers. The…
The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a…
Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the…
A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…
The large time and length scales and, not least, the vast number of particles involved in industrial-scale simulations inflate the computational costs of the Discrete Element Method (DEM) excessively. Coarse grain models can help to lower…
Probabilistic generative models based on measure transport, such as diffusion and flow-based models, are often formulated in the language of Markovian stochastic dynamics, where the choice of the underlying process impacts both algorithmic…
We present a convex-concave reformulation of the reversible Markov chain estimation problem and outline an efficient numerical scheme for the solution of the resulting problem based on a primal-dual interior point method for monotone…
A persistent challenge in predictive molecular modeling of thermoset polymers is to capture the effects of chemical composition and degree of crosslinking (DC) on dynamical and mechanical properties with high computational efficiency. We…
In the framework of the holographic principle, focusing on a central concept, conditional mutual information, we construct a class of coarse-grained states, which are intuitively connected to a family of thread configurations. These…