Consensus-based adaptive sampling and approximation for high-dimensional energy landscapes

• URL: http://arxiv.org/abs/2311.05009v4
• Date: Sat, 31 May 2025 21:57:57 GMT
• Title: Consensus-based adaptive sampling and approximation for high-dimensional energy landscapes
• Abstract summary: We present a consensus-based framework that unifies phase space exploration with posterior-residual-based adaptive sampling for surrogate construction in high-dimensional energy landscapes.<n>We formulate the problem as a minimax that jointly adapts both the surrogate approximation and residual-enhanced sampling.<n>The developed framework is general for efficient surrogate construction for complex systems with high-dimensional energy landscapes.
• Score: 6.177038245239759
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a consensus-based framework that unifies phase space exploration with posterior-residual-based adaptive sampling for surrogate construction in high-dimensional energy landscapes. Unlike standard approximation tasks where sampling points can be freely queried, physical systems with complex energy landscapes such as molecular dynamics (MD) do not have direct access to arbitrary sampling regions due to the physical constraints and energy barriers; the surrogate construction further relies on the dynamical exploration of phase space, posing a significant numerical challenge. We formulate the problem as a minimax optimization that jointly adapts both the surrogate approximation and residual-enhanced sampling. The construction of free energy surfaces (FESs) for high-dimensional collective variables (CVs) of MD systems is used as a motivating example to illustrate the essential idea. Specifically, the maximization step establishes a stochastic interacting particle system to impose adaptive sampling through both exploitation of a Laplace approximation of the max-residual region and exploration of uncharted phase space via temperature control. The minimization step updates the FES surrogate with the new sample set. Numerical results demonstrate the effectiveness of the present approach for biomolecular systems with up to 30 CVs. While we focus on the FES construction, the developed framework is general for efficient surrogate construction for complex systems with high-dimensional energy landscapes.

Related papers

• Free Energy Surface Sampling via Reduced Flow Matching [17.93274903825365]
  We propose a reduced flow matching (FM) method for free energy sampling (FES)<n>We train a dynamical transport map in the CV space, thereby enabling direct sampling of the free energy surface.<n>We evaluate the proposed method across a variety of potential functions and collective variables.
  arXiv  Detail & Related papers  (2026-05-01T01:35:48Z)
• Differentiable free energy surface: a variational approach to directly observing rare events using generative deep-learning models [4.343338326440084]
  We introduce the variational free energy surface (VaFES), a dataset-free framework that directly models FESs.<n>Rare events can be immediately identified from the FES with their configurations generated directly via one-shot sampling of generative models.
  arXiv  Detail & Related papers  (2026-04-10T18:00:08Z)
• Optimal-Transport-Guided Functional Flow Matching for Turbulent Field Generation in Hilbert Space [0.3173969736316818]
  High-fidelity modeling of turbulent flows requires complex dynamics and multi-scale intermittency.<n>We propose Functional Optimal Transport Conditional Flow Matching (FOT-CFM), a generative framework defined directly in infinite-dimensional function space.<n>FOT-CFM achieves superior fidelity in reproducing high-order turbulent statistics and spectra energy compared to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-04-07T10:53:37Z)
• EFF-Grasp: Energy-Field Flow Matching for Physics-Aware Dexterous Grasp Generation [54.09734511705173]
  EFF-Grasp is a Flow-Matching synthesis-based framework for physics-aware dexterous grasp generation.<n>We reformulate grasp as a deterministic ordinary differential equation (ODE) process, which enables efficient and stable generation through smooth probability flows.<n> EFF-Grasp achieves superior performance in grasp quality and physical feasibility, while requiring substantially fewer sampling steps than diffusion-based baselines.
  arXiv  Detail & Related papers  (2026-03-17T06:11:56Z)
• Hyperparameter Trajectory Inference with Conditional Lagrangian Optimal Transport [51.56484100374058]
  Post-deployment, user preferences can evolve, making initial settings undesirable.<n>We learn, from observed data, how a NN's conditional output distribution changes with its hyper parameters.<n>We construct a surrogate model that approximates the NN at unobserved hyper parameters.
  arXiv  Detail & Related papers  (2026-03-02T11:55:02Z)
• Agentic Exploration of PDE Spaces using Latent Foundation Models for Parameterized Simulations [5.931951549967812]
  Flow and more broadly physical phenomena governed by partial differential equations (PDEs) are inherently continuous, high-dimensional and often chaotic in nature.<n>Traditionally, researchers have explored these rich PDE solution spaces using laboratory experiments and/or computationally expensive numerical simulations.<n>We address this by coupling multi-agent LLMs with latent foundation models (LFMs), a generative model over parametrised simulations, that learns explicit, compact and disentangled latent representations of flow fields.
  arXiv  Detail & Related papers  (2026-02-26T20:39:45Z)
• Semiclassical Simulation of Homogeneous Emitter Ensembles with Local Dissipation [0.0]
  Emitter ensembles constitute a fundamental component in quantum optical technologies.<n>We formulate a truncated Wigner approximation (TWA) for permutation-invariant emitter ensembles subject to local dissipation.<n>We demonstrate large-scale simulations of hundreds of interacting ensembles within the TWA to reveal emergent spatial coherence and selective directionality of cooperative emission.
  arXiv  Detail & Related papers  (2026-02-15T07:12:03Z)
• Robust Inference-Time Steering of Protein Diffusion Models via Embedding Optimization [6.097829741846035]
  EmbedOpt is an inference-time approach for steering diffusion models to optimize experimental likelihoods in the conditional embedding space.<n>We show that EmbedOpt outperforms the coordinate-based posterior sampling method in map fitting tasks and matches performance on distance constraint tasks.
  arXiv  Detail & Related papers  (2026-02-05T04:13:33Z)
• Open-set Anomaly Segmentation in Complex Scenarios [88.11076112792992]
  This paper introduces ComsAmy, a benchmark for open-set anomaly segmentation in complex scenarios.<n>ComsAmy encompasses a wide spectrum of adverse weather conditions, dynamic driving environments, and diverse anomaly types.<n>We propose a novel energy-entropy learning (EEL) strategy that integrates the complementary information from energy and entropy.
  arXiv  Detail & Related papers  (2025-04-28T12:00:10Z)
• Taming Flow Matching with Unbalanced Optimal Transport into Fast Pansharpening [10.23957420290553]
  We propose the Optimal Transport Flow Matching framework to achieve one-step, high-quality pansharpening. The OTFM framework enables simulation-free training and single-step inference while maintaining strict adherence to pansharpening constraints.
  arXiv  Detail & Related papers  (2025-03-19T08:10:49Z)
• nuHOPS: A quantum trajectory method for highly excited environments in non-Markovian open quantum dynamics [0.0]
  We introduce a significant improvement of the Hierarchy of Pure States (HOPS) approach to non-Markovian quantum dynamics.<n>As our method relies on quantum trajectories, we can obtain dynamics efficiently, also for large system sizes.<n>We show its true power using the Dicke model as the paradigmatic example of many emitters decaying superradiantly inside a cavity.
  arXiv  Detail & Related papers  (2025-03-05T10:44:15Z)
• Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models [57.45019514036948]
  Simultaneous MRMP Diffusion (SMD) is a novel approach integrating constrained optimization into the diffusion sampling process to produce collision-free, kinematically feasible trajectories.<n>The paper introduces a comprehensive MRMP benchmark to evaluate trajectory planning algorithms across scenarios with varying robot densities, obstacle complexities, and motion constraints.
  arXiv  Detail & Related papers  (2025-02-05T20:51:28Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics. This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• Machine Learning-Accelerated Multi-Objective Design of Fractured Geothermal Systems [17.040963667188525]
  We report an Active Learning enhanced Evolutionary Multi-objective Optimization algorithm, integrated with hydrothermal simulations in fractured media. Results demonstrate that the ALEMO approach achieves a remarkable reduction in required simulations, with a speed-up of 1-2 orders of magnitude (10-100 times faster) than traditional evolutionary methods.
  arXiv  Detail & Related papers  (2024-11-01T10:39:23Z)
• Efficient High-Resolution Visual Representation Learning with State Space Model for Human Pose Estimation [60.80423207808076]
  Capturing long-range dependencies while preserving high-resolution visual representations is crucial for dense prediction tasks such as human pose estimation.<n>We propose the Dynamic Visual State Space (DVSS) block, which augments visual state space models with multi-scale convolutional operations.<n>We build HRVMamba, a novel model for efficient high-resolution representation learning.
  arXiv  Detail & Related papers  (2024-10-04T06:19:29Z)
• Learning diffusion at lightspeed [4.154846138501937]
  Existing models to learn the diffusion terms from observational data rely on complex bilevel optimization problems. We propose a new simple model, JKOnet*, which bypasses the complexity of existing architectures. JKOnet* minimizes a simple quadratic loss and outperforms other baselines in terms of sample efficiency, computational complexity, and accuracy.
  arXiv  Detail & Related papers  (2024-06-18T13:44:07Z)
• Enhanced sampling of robust molecular datasets with uncertainty-based collective variables [0.0]
  We propose a method that leverages uncertainty as the collective variable (CV) to guide the acquisition of chemically-relevant data points. This approach employs a Gaussian Mixture Model-based uncertainty metric from a single model as the CV for biased molecular dynamics simulations.
  arXiv  Detail & Related papers  (2024-02-06T06:42:51Z)
• Energy-Guided Continuous Entropic Barycenter Estimation for General Costs [95.33926437521046]
  We propose a novel algorithm for approximating the continuous Entropic OT (EOT) barycenter for arbitrary OT cost functions. Our approach is built upon the dual reformulation of the EOT problem based on weak OT.
  arXiv  Detail & Related papers  (2023-10-02T11:24:36Z)
• Federated Compositional Deep AUC Maximization [58.25078060952361]
  We develop a novel federated learning method for imbalanced data by directly optimizing the area under curve (AUC) score. To the best of our knowledge, this is the first work to achieve such favorable theoretical results.
  arXiv  Detail & Related papers  (2023-04-20T05:49:41Z)
• GANs and Closures: Micro-Macro Consistency in Multiscale Modeling [0.0]
  We present an approach that couples physics-based simulations and biasing methods for sampling conditional distributions with Machine Learning-based conditional generative adversarial networks. We show that this framework can improve multiscale SDE dynamical systems sampling, and even shows promise for systems of increasing complexity.
  arXiv  Detail & Related papers  (2022-08-23T03:45:39Z)
• Efficient Model-Based Multi-Agent Mean-Field Reinforcement Learning [89.31889875864599]
  We propose an efficient model-based reinforcement learning algorithm for learning in multi-agent systems. Our main theoretical contributions are the first general regret bounds for model-based reinforcement learning for MFC. We provide a practical parametrization of the core optimization problem.
  arXiv  Detail & Related papers  (2021-07-08T18:01:02Z)
• Distance-based Hyperspherical Classification for Multi-source Open-Set Domain Adaptation [34.97934677830779]
  Vision systems trained in closed-world scenarios will inevitably fail when presented with new environmental conditions. How to move towards open-world learning is a long standing research question. In this work we tackle multi-source Open-Set domain adaptation by introducing HyMOS.
  arXiv  Detail & Related papers  (2021-07-05T14:56:57Z)
• Decentralized Personalized Federated Learning for Min-Max Problems [79.61785798152529]
  This paper is the first to study PFL for saddle point problems encompassing a broader range of optimization problems. We propose new algorithms to address this problem and provide a theoretical analysis of the smooth (strongly) convex-(strongly) concave saddle point problems. Numerical experiments for bilinear problems and neural networks with adversarial noise demonstrate the effectiveness of the proposed methods.
  arXiv  Detail & Related papers  (2021-06-14T10:36:25Z)
• Enhancement of quantum correlations and geometric phase for a driven bipartite quantum system in a structured environment [77.34726150561087]
  We study the role of driving in an initial maximally entangled state evolving under a structured environment. This knowledge can aid the search for physical setups that best retain quantum properties under dissipative dynamics.
  arXiv  Detail & Related papers  (2021-03-18T21:11:37Z)
• QuTiP-BoFiN: A bosonic and fermionic numerical hierarchical-equations-of-motion library with applications in light-harvesting, quantum control, and single-molecule electronics [51.15339237964982]
  "hierarchical equations of motion" (HEOM) is a powerful exact numerical approach to solve the dynamics. It has been extended and applied to problems in solid-state physics, optics, single-molecule electronics, and biological physics. We present a numerical library in Python, integrated with the powerful QuTiP platform, which implements the HEOM for both bosonic and fermionic environments.
  arXiv  Detail & Related papers  (2020-10-21T07:54:56Z)
• Achieving fast high-fidelity optimal control of many-body quantum dynamics [0.0]
  We demonstrate the efficiency of a recent exact-gradient optimal control methodology by applying it to a challenging many-body problem. We observe fidelities in the range 0.99-0.9999 with associated minimal process duration estimates. Overall, the comparison suggests significant methodological improvements also for many-body systems in the ideal open-loop setting.
  arXiv  Detail & Related papers  (2020-08-13T18:30:24Z)
• Targeted free energy estimation via learned mappings [66.20146549150475]
  Free energy perturbation (FEP) was proposed by Zwanzig more than six decades ago as a method to estimate free energy differences. FEP suffers from a severe limitation: the requirement of sufficient overlap between distributions. One strategy to mitigate this problem, called Targeted Free Energy Perturbation, uses a high-dimensional mapping in configuration space to increase overlap.
  arXiv  Detail & Related papers  (2020-02-12T11:10:00Z)
• A Near-Optimal Gradient Flow for Learning Neural Energy-Based Models [93.24030378630175]
  We propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs) We derive a second-order Wasserstein gradient flow of the global relative entropy from Fokker-Planck equation. Compared with existing schemes, Wasserstein gradient flow is a smoother and near-optimal numerical scheme to approximate real data densities.
  arXiv  Detail & Related papers  (2019-10-31T02:26:20Z)

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.