Detecting Metastable Basins in High Dimensions via Marginal Trajectory Distribution Discrimination

• URL: http://arxiv.org/abs/2605.24136v1
• Date: Fri, 22 May 2026 18:53:40 GMT
• Title: Detecting Metastable Basins in High Dimensions via Marginal Trajectory Distribution Discrimination
• Abstract summary: We study the problem of identifying dynamically distinct basins of attraction in high dimensional timehomogeneous Markov processes.<n>We propose a discriminative approach to basin identification based on marginal trajectory distribution comparison.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of identifying dynamically distinct basins of attraction in high dimensional time-homogeneous Markov processes using only trajectory sampling. This problem is fundamental in the analysis of metastable dynamical systems, where the process rapidly mixes within basins while transitions between basins occur rarely on the timescale of interest, or even when the state space is reducible. Existing approaches typically rely on spatial discretization or spectral analysis of estimated transition operators, which can become unreliable in high dimensional settings or when the underlying basin geometry is highly nonlinear. We propose a discriminative approach to basin identification based on marginal trajectory distribution comparison. We prove a simple risk separation result: if two initial states belong to the same basin, the Bayes-optimal classifier distinguishing their marginal trajectory distributions achieves risk close to 1/2, whereas if they lie in distinct basins, the optimal risk is close to zero. This observation reduces basin detection to a two-sample discrimination problem between marginal trajectory distributions. Motivated by this principle, we develop a neural algorithm that receives a set of candidate basin representatives and iteratively merges them by estimating classification risk with a neural network that approximates the Bayes classifier. We evaluate the method on various metastable systems. These include synthetic systems constructed by embedding low-dimensional dynamics into high dimensional noisy ambient spaces. In these settings, standard spectral and clustering-based methods often fail, while our approach accurately recovers the underlying basin structure. These results display a shortcoming of existing methods and highlight trajectory discrimination as an effective tool for identifying dynamical basins in high dimensional stochastic systems.

Related papers

• Overcoming critical slowing down in frustrated spin systems by learned multiscale sampling [4.567122178196833]
  Cluster algorithms are among the most successful MCMC methods for mitigating critical slowing down in statistical systems.<n>Here, we sidestep this fundamental limitation by learning rather than constructing the relevant clusters.<n>We show that learned multiscale sampling can overcome critical slowing down in frustrated systems for which conventional cluster algorithms fail.
  arXiv  Detail & Related papers  (2026-08-31T17:21:54Z)
• Generative Learning of Separatrices [1.3449285115664047]
  We introduce and implement a framework that combines supervised classification with generative modeling to address this challenge.<n>Our approach first trains neural network classifiers on uniformly or randomly sampled initial conditions labeled by their corresponding basins of attraction in the system of interest.<n>We generate densities of samples consistent with the empirical density of samples on or close to the manifold that constitutes the separatrix between basins in the sampled region.
  arXiv  Detail & Related papers  (2026-08-13T21:37:21Z)
• Discovery of interaction and diffusion kernels in particle-to-mean-field multi-agent systems [41.99844472131922]
  We propose a data-driven framework to learn interaction kernels in multi-agent systems.<n>Our approach aims at identifying the functional form of nonlocal interaction and diffusion terms directly from trajectory data.
  arXiv  Detail & Related papers  (2026-03-16T21:19:25Z)
• Adaptive Sampling for Hydrodynamic Stability [0.0]
  The study extends the machine-learning approach of Silvester (Machine Learning for Hydrodynamic Stability, arXiv:2407.09572)<n>The proposed methodology introduces adaptivity through a flow-based deep generative model that automatically refines the sampling of the parameter space.<n>KRnet is trained to approximate a probability density function that concentrates sampling in regions of high entropy.
  arXiv  Detail & Related papers  (2025-12-15T17:00:09Z)
• Discovering Governing Equations in the Presence of Uncertainty [11.752763800308276]
  In this work, we theorize that accounting for system variability together with measurement noise is the key to consistently discover the governing equations underlying dynamical systems.<n>We show that SIP consistently identifies the correct equations by an average of 82% relative to the Sparse Identification Dynamics (SINDy) approach and its variant.
  arXiv  Detail & Related papers  (2025-07-13T18:31:25Z)
• Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
  We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data. Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
  arXiv  Detail & Related papers  (2024-04-24T09:04:36Z)
• Observation-Guided Diffusion Probabilistic Models [41.749374023639156]
  We propose a novel diffusion-based image generation method called the observation-guided diffusion probabilistic model (OGDM) Our approach reestablishes the training objective by integrating the guidance of the observation process with the Markov chain. We demonstrate the effectiveness of our training algorithm using diverse inference techniques on strong diffusion model baselines.
  arXiv  Detail & Related papers  (2023-10-06T06:29:06Z)
• Sampling from Gaussian Process Posteriors using Stochastic Gradient Descent [43.097493761380186]
  gradient algorithms are an efficient method of approximately solving linear systems. We show that gradient descent produces accurate predictions, even in cases where it does not converge quickly to the optimum. Experimentally, gradient descent achieves state-of-the-art performance on sufficiently large-scale or ill-conditioned regression tasks.
  arXiv  Detail & Related papers  (2023-06-20T15:07:37Z)
• An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games [16.95910326345246]
  We consider the problem of computing mixed Nash equilibria of two-player zero-sum games with continuous sets of pure strategies and with first-order access to the payoff function.<n>This problem arises for example in game-inspired machine learning applications, such as distributionally-robust learning.<n>We introduce and analyze a particle-based method that enjoys guaranteed local convergence for this problem.
  arXiv  Detail & Related papers  (2022-11-02T17:03:40Z)
• A Priori Denoising Strategies for Sparse Identification of Nonlinear Dynamical Systems: A Comparative Study [68.8204255655161]
  We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements. We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
  arXiv  Detail & Related papers  (2022-01-29T23:31:25Z)
• Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization [94.18714844247766]
  Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. We present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the input measures.
  arXiv  Detail & Related papers  (2021-02-02T21:01:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.