English
Related papers

Related papers: Reweighted techniques: definition and asymptotic c…

200 papers

We study the asymptotic convergence of the partial averaging method, a technique used in conjunction with the random series implementation of the Feynman-Kac formula. We prove asymptotic bounds valid for most series representations in the…

Statistical Mechanics · Physics 2007-05-23 Cristian Predescu , J. D. Doll , David L. Freeman

The reweighted random series techniques provide finite-dimensional approximations to the quantum density matrix of a physical system that have fast asymptotic convergence. We study two special reweighted techniques that are based upon the…

Statistical Mechanics · Physics 2009-11-10 Cristian Predescu , Dubravko Sabo , J. D. Doll

We perform a thorough analysis of the relationship between discrete and series representation path integral methods, which are the main numerical techniques used in connection with the Feynman-Kac formula. First, a new interpretation of the…

Statistical Mechanics · Physics 2009-11-07 Cristian Predescu , J. D. Doll

By means of the Ito-Nisio theorem, we introduce and discuss a general approach to series representations of path integrals. We then argue that the optimal basis for both ``primitive'' and partial averaged approaches is the Wiener…

Chemical Physics · Physics 2009-11-07 Cristian Predescu , J. D. Doll

The partial averaging technique is defined and used in conjunction with the random series implementation of the Feynman-Kac formula. It enjoys certain properties such as good rates of convergence and convergence for potentials with…

Mathematical Physics · Physics 2009-11-07 Cristian Predescu

We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…

Optimization and Control · Mathematics 2026-05-08 Nicholas Pischke , Thomas Powell

The majority of machine learning methods can be regarded as the minimization of an unavailable risk function. To optimize the latter, given samples provided in a streaming fashion, we define a general stochastic Newton algorithm and its…

Statistics Theory · Mathematics 2023-06-30 Claire Boyer , Antoine Godichon-Baggioni

This paper is concerned with the convergence of a series associated with a certain version of the convexification method. That version has been recently developed by the research group of the first author for solving coefficient inverse…

Numerical Analysis · Mathematics 2023-03-13 Michael V. Klibanov , Dinh-Liem Nguyen

Sequential and quantum Monte Carlo methods, as well as genetic type search algorithms can be interpreted as a mean field and interacting particle approximations of Feynman-Kac models in distribution spaces. The performance of these…

Probability · Mathematics 2016-10-03 François Giraud , Pierre Del Moral

This article addresses the weak convergence of numerical methods for Brownian dynamics. Typical analyses of numerical methods for stochastic differential equations focus on properties such as the weak order which estimates the asymptotic…

Numerical Analysis · Mathematics 2015-06-18 B. Leimkuhler , C. Matthews , M. V. Tretyakov

The flux reconstruction (FR) approach offers a flexible framework for describing a range of high-order numerical schemes; including nodal discontinuous Galerkin and spectral difference schemes. This is accomplished through the use of…

Numerical Analysis · Mathematics 2020-06-25 Will Trojak , Freddie Witherden

Rerandomization systematically reduces chance imbalance and can improve the efficiency of the average treatment effect estimator in randomized experiments. While the asymptotic properties of finite-dimensional M-estimators under…

Methodology · Statistics 2026-04-28 Xinyuan Chen , Fan Li

An efficient discrete time and space Markov chain approximation employing a Brownian bridge correction for computing curvilinear boundary crossing probabilities for general diffusion processes was recently proposed in Liang and Borovkov…

Probability · Mathematics 2023-02-24 Vincent Liang , Konstantin Borovkov

In this paper, we study convergence rates of the cubic regularized proximal quasi-Newton method (\csr) for solving non-smooth additive composite problems that satisfy the so-called Kurdyka-\L ojasiewicz (K\L ) property with respect to some…

Optimization and Control · Mathematics 2025-08-20 Shida Wang , Jalal Fadili , Peter Ochs

We present the idea of intertwining of two diffusions by Feynman-Kac operators. We present some variations and implications of the method and give examples of its applications. Among others, it turns out to be a very useful tool for finding…

Probability · Mathematics 2014-10-21 Maciej Wiśniewolski , Jacek Jakubowski

The key tool of this paper is a new Carleman estimate for an arbitrary parabolic operator of the second order for the case of reversed time data. This estimate works on an arbitrary time interval. On the other hand, the previously known…

Analysis of PDEs · Mathematics 2020-01-08 Michael V. Klibanov , Anatoly G. Yagola

In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing and machine learning research. The traditional alternating direction method of multipliers encounters troubles in both…

Numerical Analysis · Computer Science 2018-10-17 Tao Sun , Hao Jiang , Lizhi Cheng , Wei Zhu

Win statistics, including the win ratio, net benefit, and win odds, summarize treatment effects on hierarchical composite endpoints by sequentially comparing patient pairs on component outcomes ordered by clinical importance, proceeding to…

Methodology · Statistics 2026-05-27 Xi Fang , Fan Li

Weighting with the inverse probability of censoring is an approach to deal with censoring in regression analyses where the outcome may be missing due to right-censoring. In this paper, three separate approaches involving this idea in a…

Methodology · Statistics 2025-10-30 Morten Overgaard

We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: $L(x,y)=f(x)+Q(x,y)+g(y)$, where $f:\R^n\rightarrow\R\cup{+\infty}$ and $g:\R^m\rightarrow\R\cup{+\infty}$…

Optimization and Control · Mathematics 2013-01-23 Hedy Attouch , Jerome Bolte , Patrick Redont , Antoine Soubeyran
‹ Prev 1 2 3 10 Next ›