High-Dimensional Enhanced Sampling via Regularized Path-Dependent McKean--Vlasov Dynamics using Tensor Density Approximation
Pith reviewed 2026-05-08 17:32 UTC · model grok-4.3
The pith
A regularized path-dependent McKean-Vlasov dynamics with tensor-approximated densities enables scalable enhanced sampling up to 64 collective variable dimensions.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that a suitably regularized and path-dependent McKean-Vlasov dynamics, whose CV marginal density is represented in functional hierarchical tensor format, is well-posed under appropriate assumptions on the underlying potentials and measures and furnishes a numerically stable, scalable adaptive biasing method for high-dimensional enhanced sampling.
What carries the argument
The regularized path-dependent McKean-Vlasov drift that directly regularizes the CV marginal density and replaces the instantaneous law by a weighted path-history measure, together with its functional hierarchical tensor approximation.
If this is right
- Adaptive biasing becomes feasible without an outer convolution over the full CV domain.
- Statistical stability improves in the low-replica regime because the drift uses a path-history measure rather than the instantaneous empirical law.
- Well-posedness of the resulting stochastic dynamics holds under the stated assumptions on potentials and measures.
- Numerical tests on benchmark potentials and molecular systems confirm effectiveness up to CV dimension 64.
Where Pith is reading between the lines
- The same tensor-based density representation might be reused inside other mean-field sampling or optimization algorithms that require high-dimensional marginals.
- Accuracy of the tensor format could be tested by deliberately increasing CV dimension beyond 64 while monitoring bias in the recovered free-energy surface.
- The path-dependent regularization might be combined with machine-learned collective variables whose dimension is also high.
Load-bearing premise
The history-averaged CV marginal density can be represented accurately by the functional hierarchical tensor format without introducing uncontrolled bias, and the potentials and measures obey the conditions needed for well-posedness of the dynamics.
What would settle it
A controlled numerical experiment in which the tensor approximation error grows with dimension and produces visible trapping in metastable states for a 64-dimensional CV problem.
Figures
read the original abstract
Sampling from high-dimensional Gibbs measures poses a challenge when the energy landscape consists of multiple metastable states. Enhanced-sampling methods mitigate this difficulty by introducing adaptive biasing potentials to facilitate the exploration along prescribed collective variables (CVs), but their scalability is often limited by the dimension of the CV space. Motivated by the Wasserstein-gradient-flow interpretation of adaptive biasing, we propose a regularized path-dependent McKean--Vlasov formulation for high-dimensional enhanced sampling. The formulation replaces the variational regularization of the Wasserstein functional by a direct regularization of the CV marginal density in the McKean--Vlasov drift, avoiding the outer convolution over the CV domain. Furthermore, it replaces the instantaneous law by a weighted path-history measure to improve statistical stability in the small-replica regime. We establish well-posedness of the resulting regularized and path-dependent stochastic dynamics under suitable assumptions. For numerical realization, the history-averaged CV marginal density is approximated using an optimization-free functional hierarchical tensor representation, leading to a scalable density-based adaptive biasing scheme. Numerical experiments on benchmark potentials and molecular systems demonstrate the effectiveness of the proposed method for sampling problems with CV dimensions up to 64.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes a regularized path-dependent McKean-Vlasov formulation for enhanced sampling from high-dimensional Gibbs measures. It replaces variational regularization of the Wasserstein functional with direct regularization of the CV marginal density in the drift term and substitutes the instantaneous law with a weighted path-history measure for improved stability in the small-replica regime. Well-posedness of the resulting dynamics is established under suitable assumptions on the potentials and measures. The history-averaged CV marginal density is then approximated via an optimization-free functional hierarchical tensor representation, yielding a scalable density-based adaptive biasing scheme. Numerical experiments on benchmark potentials and molecular systems are reported to demonstrate effectiveness for collective-variable dimensions up to 64.
Significance. If the well-posedness result and the unbiased tensor approximation hold with controllable error, the work provides a technically coherent route to high-dimensional enhanced sampling that avoids outer convolutions and optimization steps. The combination of path-dependent regularization with hierarchical tensor formats addresses a recognized scalability bottleneck in adaptive biasing methods and could enable new applications in molecular dynamics. The optimization-free nature of the tensor representation is a concrete strength for reproducibility and computational efficiency.
major comments (2)
- [Well-posedness section] Well-posedness section: the result is stated to hold 'under suitable assumptions' on the potentials and measures, yet these assumptions are not listed explicitly nor shown to be satisfied by standard benchmark potentials. Because the central claim of a well-defined regularized path-dependent dynamics rests on this step, the assumptions and a sketch of the proof must be supplied.
- [Tensor approximation and numerical sections] Tensor approximation and numerical sections: the claim that the functional hierarchical tensor format represents the history-averaged CV marginal 'without introducing uncontrolled bias' is load-bearing for the scalability assertion up to dimension 64. No a-priori error bounds, convergence rates, or controlled numerical studies isolating the approximation error are referenced in the abstract; these must be added.
minor comments (2)
- [Abstract] Abstract: quantitative performance metrics (e.g., mean first-passage times, acceptance rates, or direct comparison tables against existing high-dimensional methods) are absent; adding one or two concrete numbers would strengthen the effectiveness claim.
- [Notation] Notation: the precise definitions of the regularization strength and the path-history weighting parameter, together with any selection procedure, should be stated once in a dedicated paragraph to avoid ambiguity for readers.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below and agree that the requested clarifications will strengthen the presentation.
read point-by-point responses
-
Referee: [Well-posedness section] Well-posedness section: the result is stated to hold 'under suitable assumptions' on the potentials and measures, yet these assumptions are not listed explicitly nor shown to be satisfied by standard benchmark potentials. Because the central claim of a well-defined regularized path-dependent dynamics rests on this step, the assumptions and a sketch of the proof must be supplied.
Authors: We acknowledge that the assumptions were referenced only generically. In the revised manuscript we will explicitly list the required conditions (Lipschitz continuity and linear growth of the drift coefficients, boundedness and smoothness of the potentials, and appropriate integrability of the initial measure). We will also add a concise proof sketch in an appendix, outlining the fixed-point argument for the path-dependent McKean–Vlasov equation under these hypotheses. For each benchmark potential appearing in the numerical section we will verify that the assumptions hold (e.g., by confirming global Lipschitz constants and polynomial growth). revision: yes
-
Referee: [Tensor approximation and numerical sections] Tensor approximation and numerical sections: the claim that the functional hierarchical tensor format represents the history-averaged CV marginal 'without introducing uncontrolled bias' is load-bearing for the scalability assertion up to dimension 64. No a-priori error bounds, convergence rates, or controlled numerical studies isolating the approximation error are referenced in the abstract; these must be added.
Authors: We agree that explicit error control is necessary to support the dimension-64 claim. The functional hierarchical tensor format is known to converge in the appropriate Sobolev norm as the rank increases; we will insert the relevant a-priori bounds and convergence rates (with references to the hierarchical-tensor literature) into the tensor-approximation section. We will also add a short numerical subsection that isolates the approximation error by comparing tensor reconstructions against high-fidelity Monte-Carlo references on low-dimensional test cases and report the observed rates. The abstract will be updated to mention that the tensor error is controlled by rank selection. revision: yes
Circularity Check
No significant circularity identified in the proposed formulation and numerical scheme
full rationale
The paper introduces a novel regularized path-dependent McKean-Vlasov dynamics for high-dimensional enhanced sampling, motivated by Wasserstein-gradient-flow but with direct regularization of the CV marginal density. Well-posedness is asserted under suitable assumptions on potentials and measures, without reducing to prior fitted results. The history-averaged density is approximated via functional hierarchical tensor format, presented as an optimization-free scalable method. Numerical experiments on benchmarks up to CV dimension 64 provide independent demonstration of effectiveness. No self-definitional steps, fitted inputs called predictions, or load-bearing self-citations are evident in the derivation chain. The central claims rest on the new construction and its numerical realization rather than circular reductions.
Axiom & Free-Parameter Ledger
free parameters (2)
- regularization strength
- path-history weight
axioms (1)
- domain assumption Well-posedness of the regularized path-dependent dynamics under suitable assumptions on the energy landscape and measures
Reference graph
Works this paper leans on
-
[1]
TensorNetworksandHierarchicalTensorsfortheSolutionofHigh-DimensionalPartial Differential Equations
Bachmayr,M.,Schneider,R.,Uschmajew,A., 2016. TensorNetworksandHierarchicalTensorsfortheSolutionofHigh-DimensionalPartial Differential Equations. Foundations of Computational Mathematics 16, 1423–1472
work page 2016
-
[2]
Well-temperedmetadynamics:asmoothlyconvergingandtunablefree-energymethod
Barducci,A.,Bussi,G.,Parrinello,M.,2008. Well-temperedmetadynamics:asmoothlyconvergingandtunablefree-energymethod. Physical Review Letters 100, 020603
work page 2008
-
[3]
Analysisofanadaptivebiasingforcemethodbasedonself-interactingdynamics
Benaïm,M.,Bréhier,C.E.,Monmarché,P.,2020. Analysisofanadaptivebiasingforcemethodbasedonself-interactingdynamics. Electronic Journal of Probability 25, 1–28. doi:10.1214/20-EJP490
-
[4]
Neuralnetworks-basedvariationallyenhancedsampling
Bonati,L.,Zhang,Y.Y.,Parrinello,M.,2019. Neuralnetworks-basedvariationallyenhancedsampling. ProceedingsoftheNationalAcademy of Sciences 116, 17641–17647. doi:10.1073/pnas.1907975116
-
[5]
Lectures on BSDEs, stochastic control, and stochastic differential games with financial applications
Carmona, R., 2016. Lectures on BSDEs, stochastic control, and stochastic differential games with financial applications. SIAM
work page 2016
-
[6]
Carroll,J.D.,Chang,J.J.,1970. Analysisofindividualdifferencesinmultidimensionalscalingviaann-waygeneralizationof“eckart-young” decomposition. Psychometrika 35, 283–319
work page 1970
-
[7]
Committorfunctionsviatensornetworks
Chen,Y.,Hoskins,J.,Khoo,Y.,Lindsey,M.,2023. Committorfunctionsviatensornetworks. JournalofComputationalPhysics472,111646
work page 2023
-
[8]
Enhanced sampling of multidimensional free-energy landscapes using adaptive biasing forces
Chipot, C., Lelièvre, T., 2011. Enhanced sampling of multidimensional free-energy landscapes using adaptive biasing forces. SIAM Journal on Applied Mathematics 71, 1673–1695
work page 2011
-
[9]
Calculating free energies using average force
Darve, E., Pohorille, A., 2001. Calculating free energies using average force. The Journal of Chemical Physics 115, 9169–9183
work page 2001
-
[10]
Adaptive biasing force method for scalar and vector free energy calculations
Darve, E., Rodríguez-Gómez, D., Pohorille, A., 2008. Adaptive biasing force method for scalar and vector free energy calculations. The Journal of Chemical Physics 128
work page 2008
-
[11]
Du, K., Jiang, Y., Li, J., 2023. Empirical approximation to invariant measures for mckean–vlasov processes: Mean-field interaction vs self- interaction. Bernoulli 29, 2492–2518
work page 2023
-
[12]
A mass, momentum, and energy conservative dynamical low-rank scheme for the vlasov equation
Einkemmer, L., Joseph, I., 2021. A mass, momentum, and energy conservative dynamical low-rank scheme for the vlasov equation. Journal of Computational Physics 443, 110495
work page 2021
-
[13]
Neural network and nearest neighbor algorithms for enhancing sampling of molecular dynamics
Galvelis, R., Sugita, Y., 2017. Neural network and nearest neighbor algorithms for enhancing sampling of molecular dynamics. Journal of chemical theory and computation 13, 2489–2500
work page 2017
-
[14]
Hierarchical tensor representation, in: Tensor Spaces and Numerical Tensor Calculus
Hackbusch, W., 2019. Hierarchical tensor representation, in: Tensor Spaces and Numerical Tensor Calculus. Springer, pp. 387–451
work page 2019
-
[15]
Proteins: Structure, Function, and Bioinformatics 65, 712–725
Hornak,V.,Abel,R.,Okur,A.,Strockbine,B.,Roitberg,A.,Simmerling,C.,2006.Comparisonofmultipleamberforcefieldsanddevelopment of improved protein backbone parameters. Proteins: Structure, Function, and Bioinformatics 65, 712–725
work page 2006
-
[16]
Generative modeling via tensor train sketching
Hur, Y., Hoskins, J.G., Lindsey, M., Stoudenmire, E., Khoo, Y., 2023. Generative modeling via tensor train sketching. Applied and Computational Harmonic Analysis 67, 101575
work page 2023
-
[17]
Tensor-structured galerkin approximation of parametric and stochastic elliptic pdes
Khoromskij, B.N., Schwab, C., 2011. Tensor-structured galerkin approximation of parametric and stochastic elliptic pdes. SIAM Journal on Scientific Computing 33, 364–385
work page 2011
-
[18]
Escaping free-energy minima , volume =
Laio, A., Parrinello, M., 2002. Escaping free-energy minima. Proceedings of the National Academy of Sciences 99, 12562–12566. doi:10.1073/pnas.202427399
-
[19]
Lelièvre, T., Lin, X., Monmarché, P., 2025. Convergence rates for an adaptive biasing potential scheme from a wasserstein optimization perspective. arXiv preprint arXiv:2501.17979
-
[20]
Long-time convergence of an adaptive biasing force method
Lelièvre, T., Rousset, M., Stoltz, G., 2008. Long-time convergence of an adaptive biasing force method. Nonlinearity 21, 1155
work page 2008
-
[21]
Maragliano, L., Vanden-Eijnden, E., 2006. A temperature accelerated method for sampling free energy and determining reaction pathways in rare events simulations. Chemical physics letters 426, 168–175
work page 2006
-
[22]
Location of saddle points and minimum energy paths by a constrained simplex optimization procedure
Müller, K., Brown, L.D., 1979. Location of saddle points and minimum energy paths by a constrained simplex optimization procedure. Theoretica chimica acta 53, 75–93
work page 1979
-
[23]
Novikov,G.S.,Panov,M.E.,Oseledets,I.V.,2021. Tensor-traindensityestimation,in:deCampos,C.,Maathuis,M.H.(Eds.),Proceedingsof the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, PMLR. pp. 1321–1331
work page 2021
-
[24]
Oseledets, I.V., 2011. Tensor-train decomposition. SIAM Journal on Scientific Computing 33, 2295–2317
work page 2011
-
[25]
A concise course on stochastic partial differential equations
Prévôt, C., Röckner, M., 2007. A concise course on stochastic partial differential equations. Springer
work page 2007
-
[26]
On the use of the adiabatic molecular dynamics technique in the calculation of free energy profiles
Rosso, L., Mináry, P., Zhu, Z., Tuckerman, M.E., 2002. On the use of the adiabatic molecular dynamics technique in the calculation of free energy profiles. The Journal of Chemical Physics 116, 4389–4402
work page 2002
-
[27]
Folding free-energy landscape of a 10-residue mini-protein, chignolin
Satoh, D., Shimizu, K., Nakamura, S., Terada, T., 2006. Folding free-energy landscape of a 10-residue mini-protein, chignolin. FEBS letters 580, 3422–3426
work page 2006
-
[28]
Stochastic neural network approach for learning high- dimensional free energy surfaces
Schneider, E., Dai, L., Topper, R.Q., Drechsel-Grau, C., Tuckerman, M.E., 2017. Stochastic neural network approach for learning high- dimensional free energy surfaces. Physical Review Letters 119, 150601
work page 2017
-
[29]
Shaw,D.E.,Maragakis,P.,Lindorff-Larsen,K.,Piana,S.,Dror,R.O.,Eastwood,M.P.,Bank,J.A.,Jumper,J.M.,Salmon,J.K.,Shan,Y.,etal.,
-
[30]
Atomic-level characterization of the structural dynamics of proteins. Science 330, 341–346
-
[31]
Statisticallyoptimalanalysisofsamplesfrommultipleequilibriumstates
Shirts,M.R.,Chodera,J.D.,2008. Statisticallyoptimalanalysisofsamplesfrommultipleequilibriumstates. TheJournalofchemicalphysics 129
work page 2008
-
[32]
Adaptivetensortrainmetadynamicsforhigh-dimensionalfreeenergyexploration
Strand,N.E.,Yang,S.,Khoo,Y.,Dinner,A.R.,2026. Adaptivetensortrainmetadynamicsforhigh-dimensionalfreeenergyexploration. arXiv preprint arXiv:2603.13549
work page internal anchor Pith review arXiv 2026
-
[33]
Inverse problems: a bayesian perspective
Stuart, A.M., 2010. Inverse problems: a bayesian perspective. Acta numerica 19, 451–559. L. Lyu, S. Guo and H. Lei:Preprint submitted to ElsevierPage 22 of 24 High-dimensional enhanced sampling via path-dependent McKean–Vlasov dynamics
work page 2010
-
[34]
Solvinghigh-dimensionalkolmogorovbackwardequationswithfunctionalhierarchicaltensoroperators
Tang,X.,Collis,L.,Ying,L.,2025a. Solvinghigh-dimensionalkolmogorovbackwardequationswithfunctionalhierarchicaltensoroperators. SIAM Journal on Scientific Computing 47, A613–A632
-
[35]
Variational inference and density estimation with non-negative tensor train
Tang, X., Dwaraknath, R., Ying, L., 2025b. Variational inference and density estimation with non-negative tensor train. arXiv preprint arXiv:2507.21519
-
[36]
Generative modeling via tree tensor network states
Tang, X., Hur, Y., Khoo, Y., Ying, L., 2023. Generative modeling via tree tensor network states. Research in the Mathematical Sciences 10, 19
work page 2023
-
[37]
Solving high-dimensional fokker-planck equation with functional hierarchical tensor
Tang, X., Ying, L., 2024. Solving high-dimensional fokker-planck equation with functional hierarchical tensor. Journal of Computational Physics 511, 113110
work page 2024
-
[38]
Nonphysical sampling distributions in monte carlo free-energy estimation: Umbrella sampling
Torrie, G.M., Valleau, J.P., 1977. Nonphysical sampling distributions in monte carlo free-energy estimation: Umbrella sampling. Journal of Computational Physics 23, 187–199
work page 1977
-
[39]
Some mathematical notes on three-mode factor analysis
Tucker, L.R., 1966. Some mathematical notes on three-mode factor analysis. Psychometrika 31, 279–311
work page 1966
-
[40]
Variational approach to enhanced sampling and free energy calculations
Valsson, O., Parrinello, M., 2014. Variational approach to enhanced sampling and free energy calculations. Phys. Rev. Lett. 113, 090601
work page 2014
-
[41]
Distribution dependent sdes for landau type equations
Wang, F.Y., 2018. Distribution dependent sdes for landau type equations. Stochastic Processes and their Applications 128, 595–621
work page 2018
-
[42]
Tensorneuralnetworksforhigh-dimensionalfokker–planckequations
Wang,T.,Hu,Z.,Kawaguchi,K.,Zhang,Z.,Karniadakis,G.E.,2025. Tensorneuralnetworksforhigh-dimensionalfokker–planckequations. Neural Networks 185, 107165
work page 2025
-
[43]
Fromdatatonoisetodataformixingphysicsacrosstemperatureswithgenerativeartificialintelligence
Wang,Y.,Herron,L.,Tiwary,P.,2022. Fromdatatonoisetodataformixingphysicsacrosstemperatureswithgenerativeartificialintelligence. Proceedings of the National Academy of Sciences 119, e2203656119
work page 2022
-
[44]
A cgenff-based force field for simulations of peptoids with both cis and trans peptide bonds
Weiser, L.J., Santiso, E.E., 2019. A cgenff-based force field for simulations of peptoids with both cis and trans peptide bonds. Journal of computational chemistry 40, 1946–1956
work page 2019
-
[45]
Welling,M.,Teh,Y.W.,2011.Bayesianlearningviastochasticgradientlangevindynamics,in:Proceedingsofthe28thinternationalconference on machine learning (ICML-11), pp. 681–688
work page 2011
-
[46]
Reinforced dynamics for enhanced sampling in large atomic and molecular systems
Zhang, L., Wang, H., E, W., 2018. Reinforced dynamics for enhanced sampling in large atomic and molecular systems. The Journal of Chemical Physics 148, 124113. A. Proof of Theorem 2.3 Proof.Set𝐗 0 𝑡 =𝐱for all𝑡∈ [0, 𝑇]. We define𝐗 𝑘+1 𝑡 inductively from𝐗𝑘 𝑡 by the following equation: 𝐗𝑘+1 𝑡 =𝐱+ ∫ 𝑡 0 𝐛(𝐗𝑘+1 𝑠 , 𝜇𝑘,𝑞 𝑠 )d𝑠+𝜎 ∫ 𝑡 0 d𝐖𝑠.(19) At step𝑘+ 1, we t...
work page 2018
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.