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.

169,236 papers · 148 categories

Trend · papers per month

110220330440 · May 202619922001200920182026
48 results for asymptotic dependence

The paper extends first-order asymptotics for path-dependent derivatives in multiscale stochastic volatility.

problem Analyzing path-dependent derivatives in a multiscale stochastic volatility environment.
method First-order asymptotics analysis using Dupire's functional Ito calculus.
result Market parameters calibrated to vanilla options can price path-dependent derivatives to the same order.

We study the bilipschitz equivalence type of tree-graded spaces, showing that asymptotic cones of relatively hyperbolic groups (resp. asymptotic cones of groups containing a cut-point) only depend on the bilipschitz equivalence types of the pieces in the standard (resp. minimal) tree-graded structure. In particular, th…

2012-04-03abs ↗pdf ↗

Paper examines risk measure expansions under FGM dependence, improving accuracy at extreme levels.

problem Capturing higher-order tail behavior and dependence effects in risk measures.
method Second-order asymptotic expansions using extreme value theory and regular variation theory.
result Second-order approximations reduce approximation errors, especially at extreme confidence levels.

New methods improve temporal difference learning for policy evaluation in Markov decision processes.

problem Improving temporal difference learning for policy evaluation in Markov decision processes.
method Introduced variance-reduced forms of stochastic approximation to achieve non-asymptotic, instance-dependent optimality.
result Temporal difference learning is strictly suboptimal, but variance-reduced forms achieve optimality up to logarithmic factors.

Stochastic algo learns from evolving data, achieving optimal performance.

problem Performative prediction and multiplayer extensions.
method Stochastic approximation with decision-dependent distributions.
result Asymptotic normality and optimality of the algorithm's performance.

Correlation mixtures of elliptical copulas arise when the correlation parameter is driven itself by a latent random process. For such copulas, both penultimate and asymptotic tail dependence are much larger than for ordinary elliptical copulas with the same unconditional correlation. Furthermore, for Gaussian and Stude…

2009-12-17abs ↗pdf ↗

New asymptotic e-values improve inference by eliminating data-dependent scaling inefficiency.

problem Data-dependent scaling inefficiency in existing asymptotic e-values.
method Drawing on Bentkus's near-optimal concentration inequalities, introduce Bentkus-type asymptotic e-values.
result Bentkus-type asymptotic e-values consistently deliver sharper inference than existing alternatives.

New theory for eigenvectors of generalized Laplacian matrices, addressing dependency issues.

problem Dependency in random matrix theory hinders eigenvector analysis for latent embeddings.
method Introduces generalized Laplacian matrices and a new asymptotic theory framework.
result Established asymptotic normalities for spiked eigenvectors and eigenvalues.

Optimistic algorithms achieve logarithmic regret bounds for MDPs without diameter dependence.

problem Achieving logarithmic regret bounds for episodic MDPs without relying on diameter-like quantities.
method Novel 'clipped' regret decomposition applied to optimistic algorithms.
result Smooth interpolation between gap-dependent and minimax rates of convergence.

Modeling time-varying extreme value dependence in European stock markets.

problem Non-stationary extremal dependence between European stock markets.
method Regression model for angular density of bivariate extreme value distribution.
result Evidence of increasing extremal dependence in recent years.

Efficiently selects top-m designs for various contexts using sequential sampling.

problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.

New spectral invariants from two elliptic operators reveal manifold geometry.

problem Understanding geometric information from two elliptic operators on manifolds.
method Introducing and studying new relative spectral invariants, proving asymptotic expansions.
result Existence and computation of coefficients in the asymptotic expansion of new invariants.

The paper examines logistic regression in sparse network settings, improving inference under varying degrees of dyadic dependence.

problem Improving inference in logistic regression with sparse network data.
method Sparse network asymptotics, martingale central limit theorem, variance decomposition.
result Sparse network asymptotics lead to better variance estimators for logistic regression.

The paper analyzes methods for estimating linear functionals from observational data, proving upper bounds and showing optimal procedures.

problem Estimating linear functionals from observational data in causal inference and bandit literature.
method Two-stage procedures that first estimate treatment effect function, then use it to estimate the linear functional.
result Proves non-asymptotic upper bounds on mean-squared error for two-stage procedures and shows instance-dependent optimality.

Paper shows how scattering maps of Schrödinger equations relate to metrics.

problem Relating scattering maps of time-dependent Schrödinger equations to metrics.
method Analyzes scattering maps for specific classes of metrics and diffeomorphisms.
result Scattering maps differ by a compact operator if and only if metrics are related by diffeomorphism.

Develops a novel fast bootstrap for dependent data with higher-order accuracy.

problem Estimation of parametric and semi-parametric models for dependent data.
method i.i.d. resampling of smoothed moment indicators, asymptotic refinements under mild assumptions.
result Higher-order correct asymptotic confidence distributions and confidence intervals.

Study optimal and instance-dependent guarantees for solving linear equations with Markovian data.

problem Approximately solving linear fixed point equations with Markovian data.
method Non-asymptotic bounds and instance-dependent characterizations for stochastic approximation.
result Instance-optimality of the averaged SA estimator and matching upper and lower bounds.

This paper analyzes the bias of inexact MCMC methods in high dimensions.

problem Understanding the bias of inexact MCMC methods in high-dimensional spaces.
method Establishing bounds on Wasserstein distances between inexact MCMC methods and target distributions.
result The asymptotic bias of ULA and uHMC depends on key quantities related to the target distribution or the stationary probability measure of the scheme.

New measures quantify mutual dependence between multiple random vectors.

problem Measuring mutual dependence between multiple random vectors.
method Proposes three measures based on generalized distance covariance.
result Empirical and simplified empirical measures effectively test mutual independence.

Study on linear regression with dependent covariates, proving universality and error characterization.

problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.

The paper proposes and proves asymptotic expansions for quantum invariants.

problem Quantum invariants and their expansions under varying metrics.
method Asymptotic expansion conjectures for relative Reshetikhin-Turaev, Turaev-Viro invariants and quantum 6j-symbols.
result Proved asymptotic expansions for special cases, showing geometric dependence on metrics.

Study new spectral invariants for Laplace and Dirac operators on manifolds.

problem Understanding spectral invariants of elliptic operators on manifolds.
method Introduced new spectral invariants depending on eigenvalues and eigensections, computed asymptotic expansion.
result Computed first two coefficients of the asymptotic expansion of the new spectral invariant.

Paper proposes a new DR estimator for adaptive experiments with improved performance.

problem Improving policy evaluation in adaptive experiments with dependent samples.
method Adaptive-fitting variant of sample-splitting for non-Donsker nuisance estimators.
result Proposed DR estimator shows better performance than other estimators with dependent samples.

Improved analysis for fair federated learning reduces dependence on noise floor.

problem Asymptotic stationarity in group fair federated learning with reduced noise floor dependence.
method DS FedProxGrad framework with inexact local proximal solutions and fairness regularization.
result Algorithm converges asymptotically to stationarity without dependence on a noise floor.

Paper generalizes Gaussian universality and CGMT to dependent data, impacting data augmentation in high-dimensional logistic regression.

problem Limitation of Gaussian universality and CGMT in handling dependent data.
method Generalizes Gaussian universality and CGMT to dependent data (block dependence, m-dependence, mixing). Establishes a novel CGMT framework.
result Gaussian universality holds for high-dimensional logistic regression under various types of dependence.

Study asymptotic properties of generalized shortfall risk measures for heavy-tailed risks.

problem Understanding risk measures for heavy-tailed risks.
method Derive asymptotic expansions for generalized shortfall risk measures.
result Unified theory for risk measures including distortion and utility-based measures.

New theorem shows curvature concentration depends linearly on volume ratio.

problem Gap theorem for nonnegative Ricci curvature manifolds with small curvature concentration.
method Exhibited Ricci flow solution with faster than 1/t curvature decay.
result Curvature concentration depends linearly on asymptotic volume ratio.

Asymptotically optimal algorithm for contextual linear bandits.

problem Contextual linear bandits with suboptimal algorithms.
method Decoupling context distribution and exploration policy, incremental primal-dual approach, confidence intervals.
result Asymptotic optimality and scalability of the algorithm.

Study of Brown--York mass for four-dimensional asymptotically flat manifolds.

problem Calculating mass for hypersurfaces in four-dimensional asymptotically flat manifolds.
method Intrinsic definition of mean curvature, expansion analysis for large uniformly convex hypersurfaces.
result Shape-dependent correction to ADM mass for nearly round surfaces vanishes under certain conditions.

Study finds existence and non-existence of large stable CMC spheres in asymptotically flat 3-manifolds.

problem Existence and non-existence of large stable CMC spheres in asymptotically flat 3-manifolds.
method Extends Lyapunov-Schmidt analysis to 'far-off-center' regime and general Schwarzschild asymptotics.
result Sharp existence and non-existence results for large stable CMC spheres.

Paper develops efficient DML estimators for multiway clustered data without cross-fitting.

problem Efficient inference in models with multiway clustered dependence.
method Neyman-orthogonal moment conditions combined with localisation-based empirical process approach.
result Valid inference achieved without cross-fitting, showing debiased GMM estimators are asymptotically linear and normal.

Study on high-codimensional minimal surfaces in hyperbolic space.

problem Understanding high-codimensional minimal surfaces in hyperbolic space.
method Investigating asymptotic behavior and boundary regularity of area-minimizing currents.
result Established boundary regularity results for high-codimensional minimal surfaces near their asymptotic boundaries.

Analyzes a non-asymptotic SA scheme for non-convex, smooth objectives.

problem Analyzes SA schemes under relaxed assumptions for non-convex, smooth objectives.
method General SA scheme with state-dependent drift and mean field not necessarily gradient type.
result Analyzes the online EM algorithm and policy-gradient method for reinforcement learning.

Overview of high-dimensional time series regression methods.

problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.

We study the short-time asymptotics of conditional expectations of smooth and non-smooth functions of a (discontinuous) Ito semimartingale; we compute the leading term in the asymptotics in terms of the local characteristics of the semimartingale. We derive in particular the asymptotic behavior of call options with sho…

2012-02-06abs ↗pdf ↗

Study heat kernel on quaternionic contact manifolds, finding linear dependence of coefficients on curvature.

problem Analyzing heat kernel on quaternionic contact manifolds.
method Explicit computation of heat kernel coefficients and dependence on curvature.
result Second coefficient of heat kernel's small time asymptotics depends linearly on the qc scalar curvature.

We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the Hamiltonian H, the distance either is bounded or behaves asymptotically linear. Moreove…

1999-05-10abs ↗pdf ↗

The paper analyzes portfolio credit risk using Archimedean copulas and introduces efficient simulation methods.

problem Analyzing large losses from credit portfolio defaults with Archimedean copulas.
method Derives asymptotic results and develops variance reduction algorithms for Monte Carlo simulations.
result Proposed algorithms significantly enhance classical Monte Carlo methods for estimating portfolio credit risk.