Time-dependent variational Monte Carlo without bias

• URL: http://arxiv.org/abs/2605.03930v1
• Date: Tue, 05 May 2026 16:20:02 GMT
• Title: Time-dependent variational Monte Carlo without bias
• Abstract summary: Bornal Monte Carlo is a versatile numerical approach to tackle the quantum many-body problem.<n>VMC exhibits a subtle estimation bias leading to inaccuracies.<n>We propose an unbiased variant of time-dependent VMC using self-normalized importance sampling.<n>We also explore an alternative sampling strategy based on active learning via the cross variation (TCI)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When combined with highly expressive ansatz functions such as neural quantum states, variational Monte Carlo (VMC) constitutes a versatile numerical approach to tackle the quantum many-body problem in and out of equilibrium. However, its traditional formulation exhibits a subtle estimation bias leading to inaccuracies, which can be particularly detrimental when addressing real time dynamics. In this work, we investigate two avenues to circumvent said estimation bias. First, we propose an unbiased variant of time-dependent VMC using self-normalized importance sampling with respect to a cutoff-based deformation of the Born distribution. We demonstrate the feasibility and accuracy of the approach in pathological and generic cases of quench dynamics. Furthermore, we explore an alternative sampling strategy based on active learning via the tensor cross interpolation (TCI). While we find that our choice of tensor network architecture lacks the required low rank property, the proposed TCI-based algorithm complements the conventional importance sampling paradigm, providing an alternative perspective that may be further explored in future work.

Related papers

• Tensor-network Monte Carlo approach based on time-evolving block decimation [0.0]
  We propose a tensor-network Monte Carlo (TNMC) approach for unitary evolution following the compression sequence of the time-evolving block decimation algorithm.<n>In the TNMC approach, the obtained results contain evaluable statistical errors rather than truncation errors.<n>We show that the TNMC approach can estimate accurate expectation values of observables even when the TEBD method with the same bond dimension cannot.
  arXiv  Detail & Related papers  (2026-09-11T05:56:37Z)
• Removing nodal and support-mismatch pathologies in Variational Monte Carlo via blurred sampling [5.276073131901768]
  Variational Monte Carlo (VMC) is a powerful and fast-growing method for optimizing and evolving parameterized body wave functions.<n>In practice, however, without the backbone of the method can become unstable or biased due to the presence of nodes.<n>We introduce blurred sampling to address these difficulties.
  arXiv  Detail & Related papers  (2026-03-18T18:00:05Z)
• An Elementary Approach to Scheduling in Generative Diffusion Models [55.171367482496755]
  An elementary approach to characterizing the impact of noise scheduling and time discretization in generative diffusion models is developed.<n> Experiments across different datasets and pretrained models demonstrate that the time discretization strategy selected by our approach consistently outperforms baseline and search-based strategies.
  arXiv  Detail & Related papers  (2026-01-20T05:06:26Z)
• STACI: Spatio-Temporal Aleatoric Conformal Inference [12.74402506745844]
  STACI is highly scalable and takes advantage of training capabilities for neural network models.<n>It outperforms competing deep methods in accurately approxinging-temporal processes.
  arXiv  Detail & Related papers  (2025-05-27T18:32:54Z)
• Lightweight Channel-wise Dynamic Fusion Model: Non-stationary Time Series Forecasting via Entropy Analysis [25.291749176117662]
  We show that variance can be a valid and interpretable proxy for non-stationarity of time series.<n>We propose a novel lightweight textitChannel-wise textitDynamic textitFusion textitModel (textitCDFM)<n> Comprehensive experiments on seven time series datasets demonstrate the superiority and generalization capabilities of CDFM.
  arXiv  Detail & Related papers  (2025-03-04T13:29:42Z)
• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• Efficient Exploration in Continuous-time Model-based Reinforcement Learning [37.14026153342745]
  Reinforcement learning algorithms typically consider discrete-time dynamics, even though the underlying systems are often continuous in time. We introduce a model-based reinforcement learning algorithm that represents continuous-time dynamics.
  arXiv  Detail & Related papers  (2023-10-30T15:04:40Z)
• Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution [44.99833362998488]
  We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate quantum systems classically. We prove that the most used scheme, the time-dependent Variational Monte Carlo (tVMC), is affected by a systematic statistical bias. We show that a different scheme based on the solution of an optimization problem at each time step is free from such problems.
  arXiv  Detail & Related papers  (2023-05-23T17:38:10Z)
• Continuous-Time Modeling of Counterfactual Outcomes Using Neural Controlled Differential Equations [84.42837346400151]
  Estimating counterfactual outcomes over time has the potential to unlock personalized healthcare. Existing causal inference approaches consider regular, discrete-time intervals between observations and treatment decisions. We propose a controllable simulation environment based on a model of tumor growth for a range of scenarios.
  arXiv  Detail & Related papers  (2022-06-16T17:15:15Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• TACTiS: Transformer-Attentional Copulas for Time Series [76.71406465526454]
  estimation of time-varying quantities is a fundamental component of decision making in fields such as healthcare and finance. We propose a versatile method that estimates joint distributions using an attention-based decoder. We show that our model produces state-of-the-art predictions on several real-world datasets.
  arXiv  Detail & Related papers  (2022-02-07T21:37:29Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)

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.