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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for component estimation

Independent component analysis (ICA) decomposes multivariate data into mutually independent components (ICs). The ICA model is subject to a constraint that at most one of these components is Gaussian, which is required for model identifiability. Linear non-Gaussian component analysis (LNGCA) generalizes the ICA model t…

2017-12-23abs ↗pdf ↗

A fast method estimates Gaussian mixture components without iterative fitting.

problem Estimating the number of components in high-dimensional Gaussian mixtures.
method Center data, compute singular values, and count above a threshold.
result The estimator consistently recovers the true number of components under mild separation condition.

Autoencoder estimates parameters of noisy, multi-component damped signals.

problem Parameter estimation of damped sinusoidal signals under rapid decay and noise.
method Autoencoder-based approach using latent space for frequency, phase, decay, and amplitude estimation.
result High accuracy in parameter estimation, robustness to subdominant components and phase differences.

Identifying components and estimating mixing weights in unlabeled finite mixtures under marginal independence.

problem Identifying components and estimating mixing weights in unlabeled finite mixtures.
method Proving structural results and extending them to observable mixtures.
result Identifying components and estimating mixing weights under marginal independence.

The paper introduces a method for interpretable principal component analysis of high-dimensional time series.

problem Inconsistent and difficult-to-interpret principal component estimates in high-dimensional regimes.
method Localized sparse principal component analysis of spectral density matrices in frequency domain.
result Efficient algorithm for sparse-localized estimates of principal subspaces.

We present a generalization of independent component analysis (ICA), where instead of looking for a linear transform that makes the data components independent, we look for a transform that makes the data components well fit by a tree-structured graphical model. Treating the problem as a semiparametric statistical prob…

2012-12-12abs ↗pdf ↗

New simulations advise caution in choosing principal components for multivariate functional data.

problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.

Algorithm estimates nonparametric mixtures from grouped data.

problem Estimating identifiable nonparametric mixture models from grouped observations.
method Oracle inequality for weighted kernel density estimators and general consistency result.
result Consistent estimation of mixture components from grouped observations.

New method for estimating financial covariance matrices efficiently.

problem Noisy covariance matrix estimation in high-dimensional financial data.
method Cluster financial time series into groups, apply shrinkage to ensure positive definiteness.
result Proposed methods provide reliable estimates and outperform other estimators.

High dimensional superposition models characterize observations using parameters which can be written as a sum of multiple component parameters, each with its own structure, e.g., sum of low rank and sparse matrices, sum of sparse and rotated sparse vectors, etc. In this paper, we consider general superposition models …

2017-05-30abs ↗pdf ↗

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…

2014-09-30abs ↗pdf ↗

Score-based methods fail with isolated components and incorrect mixing proportions.

problem Score-based methods struggle with distributions having isolated components and incorrect mixing proportions.
method Score-based methods, including score matching, are used but fail in the presence of isolated components and incorrect mixing proportions.
result Score-based methods cannot discover isolated components or identify correct mixing proportions.

This study improves estimation of the first principal component in multivariate functional data.

problem Estimating the first principal component of multivariate random processes.
method Defined covariance functions and operators, introduced LASSO optimization, and established minimax lower bounds.
result The method provides an optimal variance in the minimax sense for estimating eigenelements.

Proves energy estimates for tensorial wave equations, decoupling components for stability proof.

problem Proving stability of (1+3)(1+3)-Minkowski space-time with various non-linearities.
method Decouples energy estimates for tensorial wave equations, exploiting tensorial structure and Lie derivatives.
result Decoupled energy estimates for tensorial solutions, allowing new stability proofs.

New method estimates mixture model components efficiently.

problem Estimating the number of components in finite mixture models.
method Group-Sort-Fuse (GSF) procedure for simultaneous estimation of order and mixing measure.
result GSF achieves consistent estimation of true mixture order and n1/2n^{-1/2} convergence rate.

Study uniform rates for estimating Gaussian mixtures without separation assumption.

problem Estimating parameters in two-component Gaussian mixtures without separation.
method Uniform convergence rates derived using minimax lower bounds and careful analysis of polynomial equalities.
result Phase transition in optimal estimation rate based on mixture balance.

ICA accurately estimates treatment effects even with confounders.

problem Estimating treatment effects in the presence of confounding variables.
method Uses Independent Component Analysis (ICA) to identify latent sources and estimate mixing coefficients.
result Linear ICA can consistently estimate multiple treatment effects, even with Gaussian confounders, and is more sample-efficient than Orthogonal Machine Learning (OML).

The paper improves RPCA for separating sparse and manifold components on noisy data.

problem Separating sparse and manifold components from noisy data.
method Nonlinear Robust Principal Component Analysis (RPCA) framework.
result The method successfully separates sparse and manifold components under noisy data.

A new estimator, OddSHAP, simplifies Shapley value computation by focusing on odd components.

problem Efficient computation of Shapley values in machine learning.
method Proved Shapley value depends on odd components, proposed OddSHAP for polynomial regression on odd subspace.
result OddSHAP achieves state-of-the-art estimation accuracy with reduced sampling.

The paper optimizes model selection and parameter estimation for multi-dimensional Gaussian Mixture Models.

problem Learning and distinguishing multi-dimensional Gaussian Mixture Models with reliable model order selection and efficient estimation.
method The paper establishes an information-theoretic lower bound and proposes a thresholding-based estimation algorithm with a time complexity of O(k^2 n). It also introduces a gradient-based minimization method with PCA for high-dimensional cases.
result The proposed method matches the established lower bound in sample complexity and achieves optimal parametric convergence rate.

Gradient Boosted Mixed Models estimate mean and variance components for clustered data.

problem Limited flexibility in linear mixed models for complex settings.
method Gradient Boosting extended to mixed models with likelihood-based gradients and flexible base learners.
result Accurate recovery of variance components and improved predictive accuracy.

Principal component analysis (PCA) is very popular to perform dimension reduction. The selection of the number of significant components is essential but often based on some practical heuristics depending on the application. Only few works have proposed a probabilistic approach able to infer the number of significant c…

2017-09-17abs ↗pdf ↗

Sparse non-Gaussian component analysis (SNGCA) is an unsupervised method of extracting a linear structure from a high dimensional data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach to direct estimation of the projector on the target space based on semidefinit…

2011-06-01abs ↗pdf ↗

A new method uses Gram matrix for efficient multivariate functional principal components.

problem Efficiently estimating eigencomponents of multidimensional functional datasets.
method Proposes using inner-product matrix to estimate eigenelements of multivariate and multidimensional functional datasets.
result Established relationship between eigenelements of covariance operator and inner-product matrix.

This paper tackles distributed estimation of the top-L eigenspace in PCA for large data sets.

problem Challenges in estimating the top-L eigenspace in principal component analysis for large data sets.
method Proposes a novel multi-round algorithm using shift-and-invert preconditioning and convex optimization.
result Achieves a fast convergence rate and covers the targeted top-L eigenspace without explicit eigengap assumption.

The paper tackles reward-relevance in offline RL with sparse decision dynamics.

problem Offline reinforcement learning with sparse decision dynamics and estimation sparsity.
method Reward-filtered least-squares policy evaluation using thresholded lasso.
result The method provides theoretical guarantees with sample complexity dependent on sparse component size.

Paper estimates GMMs with unknown covariances using sparse regularization.

problem Estimating GMMs with unknown diagonal covariances from samples.
method Employed Beurling-LASSO (BLASSO) for sparse estimation of component means, covariances, and weights.
result Established non-asymptotic recovery guarantees with nearly parametric convergence rates.

A new robust PCA estimator combining M-estimators and minimum divergence estimators.

problem Adverse effect of outlying observations in PCA for high-dimensional data.
method Minimum density power divergence estimator combined with a computationally efficient algorithm.
result High breakdown guarantee regardless of data dimension with theoretical support and practical applications.

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

Novel prior for orthogonal functions improves functional component estimation.

problem Improving orthogonality in functional principal component analysis.
method Sequential adaptive priors for orthogonal functions using hierarchical conditionally normal distributions.
result Proposed prior leads to nearly orthogonal posterior estimates.

Neural network based generative models with discriminative components are a powerful approach for semi-supervised learning. However, these techniques a) cannot account for model uncertainty in the estimation of the model's discriminative component and b) lack flexibility to capture complex stochastic patterns in the la…

2017-06-29abs ↗pdf ↗