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

97195292389 · May 202619922001200920172026
48 results for Asymptotic Consistency

This paper establishes the asymptotic consistency of the {\it loss-calibrated variational Bayes} (LCVB) method. LCVB was proposed in~\cite{LaSiGh2011} as a method for approximately computing Bayesian posteriors in a `loss aware' manner. This methodology is also highly relevant in general data-driven decision-making con…

2019-11-04abs ↗pdf ↗

Although consistency is a minimum requirement of any estimator, little is known about consistency of the mean partition approach in consensus clustering. This contribution studies the asymptotic behavior of mean partitions. We show that under normal assumptions, the mean partition approach is consistent and asymptotic …

2015-12-18abs ↗pdf ↗

WSINDy algorithm proves robust to noise in identifying differential equations.

problem Identifying differential equations from noisy data.
method Weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm.
result WSINDy is asymptotically consistent for a wide class of models, including Navier-Stokes and Kuramoto-Sivashinsky equations.

The study investigates the consistency of kk-means clustering under finite expectation assumptions.

problem Consistency of kk-means clustering under finite expectation assumptions.
method Investigates the conditions under which kk-means clustering is consistent, considering finite expectation instead of finite variance.
result Inconsistency can arise due to extreme cluster imbalance, leading to some clusters having few points.

Consistent estimator derived for confounding strength in observational data.

problem Estimating confounding strength in observational data is challenging due to unobserved confounders.
method Derived and adapted a consistent estimator using tools from random matrix theory.
result The original estimator is not consistent, but an adapted one is.

Study shows robust method for estimating density ratios even with heavy contamination.

problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.

Paper proposes robust LAD estimators for 2D sinusoidal model, proving consistency and normality.

problem Estimation of parameters in 2D sinusoidal models with outliers or heavy-tailed noise.
method Least absolute deviation (LAD) estimators for robust parameter estimation.
result Strong consistency and asymptotic normality of LAD estimators for 2D sinusoidal model parameters.

Novel framework for uncertainty quantification in metric spaces.

problem Uncertainty quantification in regression models with metric responses.
method Developed algorithms for large datasets, agnostic to predictive models, with asymptotic and non-asymptotic guarantees.
result Asymptotic and non-asymptotic guarantees for special cases, demonstrated in clinical applications.

The paper proves the consistency and efficiency of a volatility estimator in noisy data.

problem Proving the consistency and efficiency of a volatility estimator in the presence of microstructure noise.
method Proves asymptotic normality using Central Limit Theorem for Fourier spot volatility estimator.
result Proves consistency and asymptotic efficiency of the Fourier spot volatility estimator in noisy data.

A key challenge for modern Bayesian statistics is how to perform scalable inference of posterior distributions. To address this challenge, variational Bayes (VB) methods have emerged as a popular alternative to the classical Markov chain Monte Carlo (MCMC) methods. VB methods tend to be faster while achieving comparabl…

2017-05-09abs ↗pdf ↗

A new family of penalty functions, adaptive to likelihood, is introduced for model selection in general regression models. It arises naturally through assuming certain types of prior distribution on the regression parameters. To study stability properties of the penalized maximum likelihood estimator, two types of asym…

2013-08-23abs ↗pdf ↗

The paper develops methods to estimate the high-dimensional efficient frontier without distributional assumptions.

problem Estimating the mean-variance efficient frontier in high-dimensional settings.
method Random matrix theory and asymptotic analysis for high-dimensional data.
result Developed consistent estimators for the mean, variance, and covariance of the efficient frontier.

For an affine two factor model, we study the asymptotic properties of the maximum likelihood and least squares estimators of some appearing parameters in the so-called subcritical (ergodic) case based on continuous time observations. We prove strong consistency and asymptotic normality of the estimators in question.

2013-02-14abs ↗pdf ↗

Corrects mismatch in consistency of nuisance estimators for doubly robust methods.

problem Mismatch in consistency of nuisance estimators in doubly robust methods.
method Calibrated debiased machine learning (calibrated DML) with isotonic regression adjustment.
result Calibrated DML yields doubly robust asymptotic normality with slower convergence of nuisance estimators.

The paper proposes methods to estimate MCMC quality with couplings, bounding Wasserstein distance.

problem Improving MCMC efficiency without sacrificing asymptotic consistency.
method Estimators based on couplings of Markov chains to assess quality of asymptotically biased sampling methods.
result Empirical upper bounds of Wasserstein distance for assessing MCMC quality.

We consider the least-square linear regression problem with regularization by the 1\ell^1-norm, a problem usually referred to as the Lasso. In this paper, we first present a detailed asymptotic analysis of model consistency of the Lasso in low-dimensional settings. For various decays of the regularization parameter, w…

2009-01-21abs ↗pdf ↗

We review some developments on clustering stochastic processes and come with the conclusion that asymptotically consistent clustering algorithms can be obtained when the processes are ergodic and the dissimilarity measure satisfies the triangle inequality. Examples are provided when the processes are distribution ergod…

2019-08-05abs ↗pdf ↗

The paper analyzes network models with binary values and sub-Gamma noise, deriving asymptotic properties.

problem Analyzing network models with binary values and sub-Gamma noise.
method Derives asymptotic properties of network models with binary values and sub-Gamma noise.
result Established asymptotic consistency and normality of parameter estimators in network models.

Improves risk and variability measures continuity and consistency.

problem Improving the continuity and consistency of risk and variability measures.
method Analyzes convex and order bounded above functionals on Frechet lattices and Orlicz spaces.
result Order-continuous, law-invariant functionals on Orlicz spaces are strongly consistent everywhere.

A new method estimates treatment effects in mixed groups, improving accuracy.

problem Estimating treatment effects in mixed groups with heterogeneous responses.
method PCM (pre-cluster and merge) approach for nonparametric estimation.
result Asymptotic consistency and significant improvement in accuracy over existing methods.

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.

Subbagging estimation for big data reduces memory usage while maintaining statistical consistency.

problem Memory constraints in analyzing massive datasets.
method Randomly subsample the data, aggregate estimators from subsamples, and use incomplete U-statistics theory.
result Subbagging estimator achieves N\sqrt{N}-consistency and asymptotic normality under certain conditions.

Optimal tuning for estimating ECC in proportional asymptotics.

problem Estimating Expected Conditional Covariance (ECC) under proportional asymptotics.
method Debiased ridge regression estimators for nuisance functions, sample splitting strategies, and asymptotic variance analysis.
result Prediction-optimal tuning parameters may not minimize asymptotic variance of ECC estimator.

The paper compares theoretical and empirical performance of imputation methods for missing data.

problem Missing data in real-world datasets.
method Contrast of theoretical and empirical imputation methods for prediction.
result Mean-imputation is asymptotically optimal for prediction, while mode-imputation is sub-optimal.

Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of ran…

2014-05-02abs ↗pdf ↗