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

54109163217 · May 202619922001200920172026
48 results for covariance projection

CASP improves portfolio optimization by considering asset covariance.

problem Infeasibility in cardinality-constrained portfolio optimization.
method CASP uses volatility-normalized selection and covariance-aware projection.
result CASP-Basic delivers lower portfolio variance than standard Euclidean repair.

Statistical modeling of spatiotemporal phenomena often requires selecting a covariance matrix from a covariance class. Yet standard parametric covariance families can be insufficiently flexible for practical applications, while non-parametric approaches may not easily allow certain kinds of prior knowledge to be incorp…

2020-01-06abs ↗pdf ↗

New method clusters high-dimensional data with anisotropic noise.

problem Clustering high-dimensional anisotropic mixtures with varying noise structures.
method Covariance Projected Spectral Clustering (COPO) method that projects data onto a low-dimensional space and reassigns clusters based on estimated covariances.
result COPO achieves minimax-optimal misclustering rates in Gaussian settings.

Study variance-optimal hedging of forward curve derivatives under stochastic volatility.

problem Variance-optimal hedging of forward curve derivatives with stochastic volatility.
method Assumes HJM-Musiela dynamics modulated by stochastic covariance, uses Galtchouk-Kunita-Watanabe projection.
result Density of finite-maturity strategies, convergence of finite-rank projections, decomposition of hedging error.

New method selects variables for GP regression using sparse projection.

problem Identifying environmental factors affecting metal corrosion.
method Sparse projection of input variables, gradient descent optimization, non-convex marginal likelihood.
result Proposed method outperforms benchmarks in variable selection accuracy.

This paper improves computational efficiency in kernel ridge regression under covariate shift.

problem Covariate shift in nonparametric regression.
method Random projections in RKHS to reduce computational demands.
result Significant computational savings can be achieved without compromising learning performance under covariate shift.

Mixture models are a standard approach to dealing with heterogeneous data with non-i.i.d. structure. However, when the dimension pp is large relative to sample size nn and where either or both of means and covariances/graphical models may differ between the latent groups, mixture models face statistical and computati…

2019-02-22abs ↗pdf ↗

Study projective representations of infinite-dimensional Hilbert-Lie groups.

problem Characterize and classify representations of Hilbert-Lie groups.
method Use covariance with respect to one-parameter groups of automorphisms and implement perturbation theory.
result Explicit determination of central extensions for projective representations.

Sharp-SSL uses random projections to identify important variables for semi-supervised learning.

problem High-dimensional semi-supervised learning problems.
method Careful aggregation of low-dimensional results from many axis-aligned random projections.
result Sharp-SSL algorithm can recover signal coordinates with high probability.

New method generates synthetic time series paths with more flexibility.

problem Restrictions in generating synthetic paths using Brownian reference.
method Introduces Triangular-Reference Schrödinger Bridges (TR-SBTS) for time series generation.
result Generates synthetic paths with more flexibility in stochastic volatility and correlated noise.

Dynamic treatment effects estimated over time using covariate balancing.

problem Estimating treatment effects in panel data with dynamic treatments.
method Dynamic covariate balancing with potential local projections.
result Established inferential guarantees for the proposed method.

We search for Riemannian metrics whose Levi-Civita connection belongs to a given projective class. Following Sinjukov and Mikes, we show that such metrics correspond precisely to suitably positive solutions of a certain projectively invariant finite-type linear system of partial differential equations. Prolonging this …

2008-06-24abs ↗pdf ↗

Paper proposes a novel approach to density ratio estimation using projection pursuit.

problem Density ratio estimation challenges in high dimensions and model misspecification.
method The approach uses projection pursuit to approximate density ratios, addressing high dimensionality and model flexibility issues.
result The proposed estimator is consistent and converges at a certain rate, outperforming existing methods in experiments.

Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is…

2013-10-22abs ↗pdf ↗

PCA outperforms random projections in retaining second order signals from latent groups.

problem Preserving second order structure in latent groups under unsupervised linear projections.
method Theoretical framework and quasi-exhaustive enumeration of projections.
result PCA outperforms random projections in retaining second order signals across a broad range of data-generating parameters.

Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In classification problems there are two general techniques using random projections. T…

2019-11-25abs ↗pdf ↗

The notion of a Kähler structure for a differential calculus was recently introduced by the second author as a framework in which to study the noncommutative geometry of the quantum flag manifolds. It was subsequently shown that any covariant positive definite Kähler structure has a canonically associated triple satisf…

2019-03-18abs ↗pdf ↗

A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.

problem Stability and transferability issues in covariance matrix analysis.
method Developed coVariance neural network (VNN) that operates on sample covariance matrices.
result VNN is more stable and transferable than PCA-based approaches.

Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our approach uses the l1-norm as a regularization on the inverse covariance matrix. We utilize a novel projected gradient method, which is faster …

2012-06-13abs ↗pdf ↗

In the classical Gaussian SVM classification we use the feature space projection transforming points to normal distributions with fixed covariance matrices (identity in the standard RBF and the covariance of the whole dataset in Mahalanobis RBF). In this paper we add additional information to Gaussian SVM by considerin…

2014-08-12abs ↗pdf ↗

Inflating the minimum norm interpolator improves linear regression generalization error.

problem Highly anisotropic covariances and diverging d/nd/n in linear regression.
method Inflating the minimum 2\ell_2 norm interpolator by a constant greater than one.
result Inflating the minimum norm interpolator improves generalization error.

Study mini-batch SGD noise and its limits, proving complexity guarantees.

problem Analyzing the noise in mini-batch SGD and its impact on optimization.
method Examined the conditional covariance and diffusion limits of SGD under different sampling designs.
result Proved mean-square upper bounds and Fisher van Trees lower bounds for SGD, linking them to effective dimension and condition number.

Geodesic sprays on Finsler manifolds studied with covariant coefficients.

problem Understanding geometric properties of Finsler metrics through covariant coefficients.
method Introduced FF-covariant coefficients HiH_i and studied their geometric consequences.
result Existence and uniqueness of spray scalar HH for projectively flat metrics.

FSPA bypasses eigenvalue estimation for quantum PCA, achieving optimal complexity and robustness.

problem Quantum PCA eigenvalue estimation is computationally expensive and prone to errors.
method Filtered Spectral Projection Algorithm (FSPA) that projects onto the dominant spectral subspace directly.
result FSPA achieves optimal complexity and robustness, outperforming classical methods.

We formalize causal separation in portfolio theory, deriving a closed-form projected Markowitz solution.

problem Portfolio optimization under causal separation conditions.
method Derive a closed-form solution for portfolio optimization using causal separation conditions.
result A closed-form projected Markowitz solution is derived under causal separation conditions.

We derive an efficient method to perform clustering of nodes in Gaussian graphical models directly from sample data. Nodes are clustered based on the similarity of their network neighborhoods, with edge weights defined by partial correlations. In the limited-data scenario, where the covariance matrix would be rank-defi…

2019-10-05abs ↗pdf ↗

New method learns decisions from collective preferences without individual covariates.

problem Making decisions online without individual covariates.
method Collaborative filtering, matrix completion bandit, ε-greedy policy, online gradient descent, inverse propensity weighting.
result Method outperforms benchmarks and reveals new discoveries.

We sketch our recent application of a non-commutative version of the Cartan `moving-frame' formalism to the quantum Euclidean space RqNR^N_q, the space which is covariant under the action of the quantum group SOq(N)SO_q(N). For each of the two covariant differential calculi over RqNR^N_q based on the RR-matrix formalism, we…

2000-07-07abs ↗pdf ↗

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

The paper examines extreme value statistics of high-dimensional sample covariances, with applications in finance and image analysis.

problem Statistical validation of normal conditions in high-dimensional time series data.
method Generalizes the maximal deviation of sample autocovariances to high dimensions and applies Gumbel-type extreme value asymptotics.
result Gumbel-type extreme value asymptotics holds true for high-dimensional sample covariances.

The problem of image restoration in cryo-EM entails correcting for the effects of the Contrast Transfer Function (CTF) and noise. Popular methods for image restoration include `phase flipping', which corrects only for the Fourier phases but not amplitudes, and Wiener filtering, which requires the spectral signal to noi…

2016-02-22abs ↗pdf ↗

A new model for dynamic covariance recovery in neuroimaging data.

problem Estimating time-varying covariances in high-dimensional neuroimaging data.
method Nonconvex factorization into sparse spatial and smooth temporal components, combined with spectral initialization and gradient descent.
result The proposed method achieves linear convergence and superior performance compared to existing approaches.

The paper shows how sketching data can simplify regression inference even when errors are heteroskedastic.

problem Performing robust inference with heteroskedastic errors using sketched data.
method Using random projections to sketch data, the paper shows that sketched estimates behave as if errors are homoskedastic.
result Estimation by random sampling does not have the same property, and sketched estimates are asymptotically normal with homoskedastic variance.

A new method tests variable significance without assuming model correctness.

problem Testing variable significance in the presence of complex interactions.
method Flexible nonparametric or machine learning methods to estimate conditional mean independence.
result Achieves minimax optimal rate in nonparametric testing problem.

A new method routes EEG covariance matrices across domains using adaptive subspace selection.

problem Challenges in cross-domain EEG decoding due to distinct SPD manifold regions.
method Dynamic Stiefel routing with expert filters and cross-attention for adaptive subspace projection.
result Consistent gains across three datasets: balanced accuracy improves from 0.773 to 0.823, 0.757 to 0.809, and 0.801 to 0.839.