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

128256384512 · Jun 202019922001200920172026
48 results for HAC covariance estimation

Develops inequalities for high-dimensional linear processes with dependent innovations.

problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for ll_\infty norm of vector linear processes with sub-Weibull, mixingale innovations.
result Obtained concentration bounds for the maximum entrywise norm of lag-hh autocovariance matrices.

Study improves financial risk assessment using ARMA-APARCH-EVT models with HACs.

problem Improving risk assessment in financial portfolios.
method ARMA-APARCH-EVT-HAC model for volatility and extreme value forecasting.
result Empirical analysis shows the model's effectiveness in international stock market data.

Fair HAC algorithms ensure clustering fairness across protected groups.

problem Ensuring clustering fairness in HAC algorithms when datasets contain biases.
method Proposes fair algorithms for HAC that enforce fairness constraints regardless of distance linkage criteria.
result Our fair HAC algorithms find fairer clusterings compared to vanilla HAC and other fair clustering approaches.

Proposes a method to make statistical inferences robust in spatially dependent settings with missing at random labels.

problem Statistical inference challenges with missing at random labels and spatial dependence.
method Doubly robust estimator with cross-fit nuisances and jackknife spatial HAC variance correction.
result Asymptotically valid confidence intervals with improved finite-sample calibration.

Hierarchical clustering is a widely used approach for clustering datasets at multiple levels of granularity. Despite its popularity, existing algorithms such as hierarchical agglomerative clustering (HAC) are limited to the offline setting, and thus require the entire dataset to be available. This prohibits their use o…

2019-09-20abs ↗pdf ↗

As the size nn of datasets become massive, many commonly-used clustering algorithms (for example, kk-means or hierarchical agglomerative clustering (HAC) require prohibitive computational cost and memory. In this paper, we propose a solution to these clustering problems by extending threshold clustering (TC) to probl…

2019-07-05abs ↗pdf ↗

Paper proposes a new covariance estimator ensuring positive semi-definite matrices.

problem Estimating spot covariance matrices while maintaining positive semi-definiteness.
method Modification of the Fourier covariance estimator with a symmetric positive semi-definite constraint.
result The estimator is consistent and produces accurate positive semi-definite matrices.

Method estimates sparse inverse covariance and partial correlation matrices efficiently.

problem Sparse high-dimensional inverse covariance and partial correlation matrix estimation.
method Two-stage estimation method using partial regression with positive semi-definiteness.
result Efficient estimation of inverse covariance and partial correlation matrices with derived non-asymptotic rates.

In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an i…

2018-05-08abs ↗pdf ↗

New methods estimate covariance for matrix data without assuming fixed size or specific distributions.

problem Estimating covariance for high-dimensional matrix data without distributional assumptions.
method Unified framework for bandable covariance estimation with rank one approximation, robust to heavy-tailed data.
result Proposed estimators are rate-optimal and perform well in simulations and real applications.

Extends covariance estimation with multiple targets for better performance.

problem Improving covariance estimation for multiple targets.
method Combines multiple constant matrices with sample covariance matrix, derives estimators and proves convergence.
result The multi-target linear shrinkage estimator outperforms other estimators in various situations.

New method improves covariance estimation for weighted samples.

problem Improving covariance estimation for weighted sample data.
method Asymptotic non-linear shrinkage formulas for covariance and precision matrix estimators of weighted sample covariances.
result Asymptotic non-linear shrinkage formulas for covariance and precision matrix estimators of weighted sample covariances.

Paper presents a new framework for covariance matrix estimation with geometric insights.

problem Challenges in covariance matrix estimation, especially in finding suitable models and efficient estimation methods.
method General framework for linear restrictions on different transformations of the covariance matrix, including matrix logarithm and its inverse.
result Yields an MM-estimator with MM-estimation allowing for straightforward asymptotic and finite sample analysis.

Proposes a robust method for predicting missing outcomes in covariate shift adaptation.

problem Predicting missing outcomes in test data with covariate shift.
method Doubly robust estimator for covariate shift adaptation via importance weighting, incorporating an additional estimator for the regression function.
result Shows robustness against density-ratio estimation errors, maintaining consistency if either estimator is consistent.

Study nonparametric covariance function estimation for noisy data.

problem Estimating covariance function from discrete noisy data in high dimensions.
method Adaptive learning-based estimators, including deep learning.
result Established oracle inequality and convergence rates for deep learning estimators.

Paper develops an online covariance estimator for nonsmooth stochastic approximation problems.

problem Estimating covariance in nonsmooth, potentially non-monotone settings.
method Online batch-means covariance matrix estimator.
result Estimator achieves convergence rate of O(dn1/8+ε)O(\sqrt{d}n^{-1/8+\varepsilon}).

The graphical lasso (glasso) is a widely-used fast algorithm for estimating sparse inverse covariance matrices. The glasso solves an L1 penalized maximum likelihood problem and is available as an R library on CRAN. The output from the glasso, a regularized covariance matrix estimate a sparse inverse covariance matrix e…

2011-11-11abs ↗pdf ↗

New estimator handles covariate shift with closed-form solution and super-efficiency.

problem Handling covariate shift in missing data and causal inference problems.
method Minimum Wasserstein distance estimation framework.
result Closed-form expression and super-efficiency relative to semiparametric efficient estimator.

New covariance estimator for financial portfolios.

problem Estimating large financial covariances in non-stationary environments.
method Exponentially weighted averages and cross-validation for nonlinearly shrinking sample eigenvalues.
result Our estimator performs well in large dimensions compared to existing estimators.

New method improves online covariance estimation for SGD.

problem Improving online covariance estimation for SGD.
method Proposes a de-biased covariance estimator that eliminates second-order derivatives.
result Achieves a convergence rate of n(α1)/2lognn^{(α-1)/2} \sqrt{\log n}, outperforming existing methods.

PACE-GGM uses Gaussian mechanism for private covariance estimation.

problem Private estimation of covariance matrices in high dimensions.
method Data-adaptive selection of entries, Gaussian mechanism, maximum-entropy reconstruction.
result Consistent improvements in estimation error compared to Gaussian mechanism and baselines.

Study on estimating distances between covariance operators and Gaussian processes.

problem Estimating distances between covariance operators and Gaussian processes.
method Riemannian distances, concentration results for Hilbert space-valued random variables, RKHS covariance and cross-covariance operators.
result Both distances converge in the Hilbert-Schmidt norm and can be consistently and efficiently estimated.

New method estimates covariance matrices without restrictive assumptions.

problem Estimating high-dimensional covariance matrices under restrictive assumptions.
method Distributionally robust covariance estimation problems with mild conditions.
result Robust estimators are efficient, consistent, and perform well.

SCOPE estimator improves covariance and precision matrix estimation.

problem Estimating covariance and precision matrices accurately.
method Distributionally robust optimization with convex spectral divergence.
result SCOPE estimator reduces spectral bias and improves condition number.

We consider the problem of joint estimation of structured inverse covariance matrices. We perform the estimation using groups of measurements with different covariances of the same unknown structure. Assuming the inverse covariances to span a low dimensional linear subspace in the space of symmetric matrices, our aim i…

2015-11-20abs ↗pdf ↗

New methods improve portfolio risk minimization by estimating covariance matrix more accurately.

problem Uncertainty in estimating covariance matrix leads to unreliable hedge trades.
method Proposes two new estimators of the inverse covariance matrix using l2 and l1 norms.
result Portfolio formed using proposed estimators achieves substantial risk reduction and improved returns.

Paper optimizes private PCA for covariance estimation in statistics.

problem Private estimation of covariance matrices and principal components.
method Developed differentially private estimators for spiked covariance model.
result Established minimax rates of convergence for principal components and covariance matrix estimation.

Improved 2-bit covariance estimator with reduced operator norm error and no tuning needed.

problem Improving 2-bit covariance estimation with reduced operator norm error and no tuning needed.
method Proposed a new 2-bit covariance matrix estimator using triangular dithering scales.
result Improved operator norm error rate that depends on effective rank of covariance matrix, closing theoretical gap.

Robustly estimates linear regression coefficients with adversarial and noisy data.

problem Estimating robust linear regression coefficients with adversarial and noisy data.
method Adversarial robust weighted Huber regression with polynomial computational complexity.
result Derives an estimation error bound that depends on the stable rank and condition number of the covariance matrix.

New method balances covariates for stable causal survival effect estimation.

problem Estimating causal survival effects in data with conditionally-independent censoring.
method Covariate-balancing approach to empirically stable and asymptotically efficient estimation.
result Validated theoretical results in synthetic and semi-synthetic data.

Lower bounds on private estimation of Gaussian covariance matrices.

problem Private estimation of Gaussian covariance matrices under various parameter regimes.
method Stein-Haff identity and fingerprinting lemma extensions.
result Lower bounds match existing upper bounds in the widest known parameters.

Paper tackles unbounded density ratio estimation for covariate shift adaptation.

problem Understudied challenge in statistical learning: unbounded density ratios.
method Three-step estimation method: relative density ratio, truncation, and transformation.
result Established rigorous convergence guarantees for density ratio and regression estimators.