Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

57115172229 · May 202619922001200920172026
48 results for uniformly geometrically ergodic

The paper provides concentration inequalities for Markov chain variance estimators.

problem Estimating the variance of Markov chains with concentration properties.
method Martingale decomposition method for uniformly geometrically ergodic Markov chains.
result Explicit control of the p-th moment of the OBM estimator difference and dependence on p and mixing time.

The paper studies harmonic map heat flow to flat tori, proving ergodic behavior and convergence to hyperbolic measure.

problem Analyzing the behavior of harmonic map heat flow to moduli space of flat tori.
method Investigates stability and ergodic behavior of harmonic map heat flow using hyperbolic structure and relative entropy.
result The flow converges weak--^{*} to the normalized hyperbolic measure on the moduli space.

New MCMC methods map high-dimensional problems to spheres for better mixing.

problem Mixing issues in high-dimensional distributions, especially heavy-tailed ones.
method Stereographic Markov Chain Monte Carlo (MCMC) methods that map high-dimensional problems to spheres.
result Uniformly ergodic samplers for various distributions, including heavy-tailed ones, with faster convergence in higher dimensions.

New concentration inequality for U-statistics of Markov chains.

problem Proving a concentration inequality for U-statistics of order two in uniformly ergodic Markov chains.
method Inductive analysis using martingale techniques, uniform ergodicity, Nummelin splitting, and Bernstein's inequality.
result Recovery of convergence rate for U-statistics of independent random variables and canonical kernels, with improved results for dependent kernels.

AAPI improves regret bound for undiscounted continuing learning in uniformly ergodic MDPs.

problem Improving regret bounds for undiscounted continuing learning in uniformly ergodic MDPs.
method Adaptive approximate policy iteration (AAPI) with online learning techniques and data-dependent adaptive learning rate.
result AAPI achieves a ildeO(T2/3) ilde{O}(T^{2/3}) regret bound, improving over the best existing bound of ildeO(T3/4) ilde{O}(T^{3/4}).

This work investigates a mixture of LMC and RMHMC with MMALA for geometric ergodicity.

problem Lack of geometric ergodicity study in Riemannian manifold and Lagrangian Monte Carlo methods.
method Investigates a mixture of LMC and RMHMC with MMALA to achieve geometric ergodicity.
result Demonstrates geometric ergodicity in the mixture of LMC and RMHMC with MMALA.

In the paper portfolio optimization over long run risk sensitive criterion is considered. It is assumed that economic factors which stimulate asset prices are ergodic but non necessarily uniformly ergodic. Solution to suitable Bellman equation using local span contraction with weighted norms is shown. The form of optim…

2015-08-22abs ↗pdf ↗

In this paper long-run risk sensitive optimisation problem is studied with dyadic impulse control applied to continuous-time Feller-Markov process. In contrast to the existing literature, focus is put on unbounded and non-uniformly ergodic case by adapting the weight norm approach. In particular, it is shown how to com…

2019-06-14abs ↗pdf ↗

SGLD proves geometric ergodicity via reflection coupling for nonconvex log-concave distributions.

problem Proving geometric ergodicity of SGLD in nonconvex, log-concave settings.
method Reflection coupling technique to handle SGLD's time discretization and minibatch issues.
result SGLD has an invariant distribution and geometric ergodicity in W1W_1 distance.

We study how resetting affects geometric Brownian motion, showing it becomes stationary but remains non-ergodic.

problem Effects of stochastic resetting on geometric Brownian motion.
method Analysis of geometric Brownian motion under stochastic resetting.
result Resetting makes geometric Brownian motion stationary but non-ergodic.

We establish general conditions under which Markov chains produced by the Hamiltonian Monte Carlo method will and will not be geometrically ergodic. We consider implementations with both position-independent and position-dependent integration times. In the former case we find that the conditions for geometric ergodicit…

2016-01-29abs ↗pdf ↗

Recent results on ergodic theory for Riemann surface laminations and foliations.

problem Ergodic theorems for laminations and foliations on Riemann surfaces.
method Leafwise Poincaré metric, directed positive harmonic currents, multiplicative cocycles, Lyapunov exponents.
result Definition and study of canonical Lyapunov exponents for singular holomorphic foliations.

Geometric Brownian motion (GBM) is a model for systems as varied as financial instruments and populations. The statistical properties of GBM are complicated by non-ergodicity, which can lead to ensemble averages exhibiting exponential growth while any individual trajectory collapses according to its time-average. A com…

2012-09-20abs ↗pdf ↗

Markov Chain Monte Carlo is repeatedly used to analyze the properties of intractable distributions in a convenient way. In this paper we derive conditions for geometric ergodicity of a general class of nonparametric stochastic volatility models with skewness driven by hidden Markov Chain with switching.

2012-09-07abs ↗pdf ↗

We define generalized currents associated with immersions of abstract oriented solenoids with a transversal measure. We realize geometrically the full real homology of a compact manifold with these generalized currents, and more precisely with immersions of minimal uniquely ergodic solenoids. This makes precise and geo…

2009-10-15abs ↗pdf ↗

In [Mas82] and [Vee78] it was proved independently that almost every interval exchange transformation is uniquely ergodic. The Birkhoff ergodic theorem implies that these maps mainly have uniformly distributed orbits. This raises the question under which conditions the orbits yield low-discrepancy sequences. The case o…

2017-11-20abs ↗pdf ↗

We define generalized currents associated with immersions of abstract solenoids with a transversal measure. We realize geometrically the full real homology of a compact manifold with these generalized currents, and more precisely with immersions of minimal uniquely ergodic solenoids. This makes precise and geometric De…

2007-02-16abs ↗pdf ↗

The paper improves importance sampling and MCMC methods for complex distributions.

problem Improving sampling efficiency for distributions with atoms or heavy tails.
method Develops minimax optimal trial distributions and importance-tempered MCMC.
result Importance-tempered MCMC can be uniformly ergodic for certain distributions.

This paper compares two NUTS variants and analyzes their convergence and mixing times.

problem Theoretical comparison and convergence guarantees of NUTS variants.
method Deriving necessary and sufficient conditions for geometric ergodicity, and analyzing mixing times.
result NUTS-mul and NUTS-BPS have nearly identical qualitative behavior but differ quantitatively in convergence rates.

The paper describes decompositions of geometric measures on Anosov homogeneous spaces.

problem Decomposing geometric measures on Anosov homogeneous spaces.
method Ergodic decompositions of Burger-Roblin and Bowen-Margulis-Sullivan measures.
result The space of non-trivial invariant ergodic measures is homeomorphic to a product space.

Elliptical slice sampling converges geometrically, providing reliable sampling for Bayesian learning.

problem Sampling from posterior distributions in Bayesian learning.
method Elliptical slice sampling, geometric ergodicity.
result Elliptical slice sampling yields geometric convergence guarantees under weak regularity assumptions.

The paper proves conditions for non-uniform expansion in partially hyperbolic systems.

problem Conditions for non-uniform expansion in partially hyperbolic systems.
method Analysis of Lyapunov exponents and dominated splittings.
result Existence of physical SRB measure under specific conditions.

New method detects changes in high-dimensional Markov processes without explicit likelihood evaluation.

problem Quickest change detection in Markov processes with unknown transition kernels.
method Learn conditional score from sample pairs, develop score-based CUSUM procedure.
result Exponential lower bounds on mean time to false alarm and asymptotic upper bounds on detection delay.

Estimates mixing coefficients of geometrically ergodic Markov processes from a single sample path.

problem Estimating mixing coefficients of geometrically ergodic Markov processes.
method Proposes methods to estimate β\beta-mixing coefficients from a single sample path under standard smoothness conditions.
result Obtains a rate of convergence of order \(\mathcal{O}(\log(n) n^{-[s]/(2[s]+2)})\) for the expected error of the estimator.

We show that the sets in a family with finite VC dimension can be uniformly approximated within a given error by a finite partition. Immediate corollaries include the fact that VC classes have finite bracketing numbers, satisfy uniform laws of averages under strong dependence, and exhibit uniform mixing. Our results ar…

2010-07-23abs ↗pdf ↗

Uniformly perfect Morse boundaries characterize geometric properties of groups.

problem Characterizing geometric properties of groups using Morse boundaries.
method Introducing and geometrically characterizing uniformly perfect Morse boundaries for proper geodesic metric spaces.
result The Morse boundary of any finitely generated, non-elementary group is uniformly perfect if it is nonempty.

The paper introduces a new method to create stable ergodic actions on higher-dimensional manifolds.

problem Stable ergodicity of group actions on smooth manifolds restricted to one-dimensional cases.
method Geometric method using quasi-conformal blender for constructing stable local dynamics.
result Every closed manifold admits stably ergodic finitely generated group actions by diffeomorphisms of class C1+αC^{1+α}.

We construct a counterexample for an analogue of Masur's criterion in the setting of Teichmüller space equipped with the Thurston metric. For that, we find a minimal, filling, non-uniquely ergodic lamination λλ on the seven-times punctured sphere with uniformly bounded annular projection distances. Then we show that a…

2019-03-03abs ↗pdf ↗

This paper analyzes the convergence of dynamic HMC and NUTS methods.

problem Theoretical understanding of dynamic HMC and NUTS convergence.
method General class of MCMC algorithms, NUTS as a particular case, geometric ergodicity, irreducibility.
result NUTS is geometrically ergodic under certain conditions and ergodic without bounded stepsize.

We give a simple optimistic algorithm for which it is easy to derive regret bounds of O~(tmixSAT)\tilde{O}(\sqrt{t_{\rm mix} SAT}) after TT steps in uniformly ergodic Markov decision processes with SS states, AA actions, and mixing time parameter tmixt_{\rm mix}. These bounds are the first regret bounds in the general, non-epi…

2018-08-06abs ↗pdf ↗

We show that for a strongly convergent sequence of geometrically finite Kleinian groups with geometrically finite limit, the Cannon-Thurston maps of limit sets converge uniformly. If however the algebraic and geometric limits differ, as in the well known examples due to Kerckhoff and Thurston, then provided the geometr…

2011-07-05abs ↗pdf ↗

This paper addresses metaconsistency in Bayesian inference for metastable systems.

problem Inference for metastable systems may not be consistent, but can be metaconsistent over large but finite time intervals.
method Introduces metaconsistency in a Bayesian framework, discusses its relation to spectral properties of model dynamics.
result Metaconsistency can be exploited to infer sub-systems efficiently from larger systems.

The paper analyzes Q-learning convergence rates with asynchronous updates.

problem Analyzing convergence rates of asynchronous Q-learning algorithms.
method Derives rates of convergence using high-dimensional central limit theorems.
result Establishes a rate of order up to n1/6log4(nSA)n^{-1/6} \log^{4} (nS A) for hyper-rectangles.

Given a n-dimensional lamination endowed with a Riemannian metric, we introduce the notion of a multiplicative cocycle of rank d, where n and d are arbitrary positive integers. The holonomy cocycle of a foliation and its exterior powers as well as its tensor powers provide examples of multiplicative cocycles. Next, we …

2014-03-28abs ↗pdf ↗

On a compact Kähler manifold there is a canonical action of a Lie-superalgebra on the space of differential forms. It is generated by the differentials, the Lefschetz operator and the adjoints of these operators. We determine the asymptotic distribution of irreducible representations of this Lie-superalgebra on the eig…

2008-05-15abs ↗pdf ↗

Study invariant measures on measured laminations for subgroups of mapping class group.

problem Classify invariant Radon measures on space of measured laminations for subgroups of mapping class group.
method Geometric approach, focusing on recurrent measured laminations, explicitly constructing ergodic measures.
result Show uniquely ergodic for divergence-type subgroups, generalize results for full mapping class group.