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

Trend · papers per month

158316473631 · Jun 202019922001200920172026
48 results for simultaneous component analysis

Proposes joint LCA for multiview data to identify shared and view-specific components.

problem Extracting shared components sequentially from multiview data.
method Formulates a matrix decomposition model with joint and individual structures, proposes a penalty term objective function, and employs a refitting procedure.
result Achieves simultaneous estimation and rank selection for cross covariance.

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 ↗

Improved estimation of multiple principal components using manifold optimization and iterative deflation techniques.

problem Estimating multiple principal components efficiently and orthogonally.
method Extended SFPCA using manifold optimization and iterative deflation techniques.
result Alternative deflation schemes improve signal extraction and component estimation.

We present a new method for the separation of superimposed, independent, auto-correlated components from noisy multi-channel measurement. The presented method simultaneously reconstructs and separates the components, taking all channels into account and thereby increases the effective signal-to-noise ratio considerably…

2017-05-05abs ↗pdf ↗

This paper is concerned with an important issue in finite mixture modelling, the selection of the number of mixing components. We propose a new penalized likelihood method for model selection of finite multivariate Gaussian mixture models. The proposed method is shown to be statistically consistent in determining of th…

2013-01-16abs ↗pdf ↗

A new neural network reduces high-dimensional time-series data for faster classification.

problem Classifying high-dimensional time-series patterns efficiently.
method Developed a time-series discriminant component network (TSDCN) using TSDCA for dimensionality reduction and classification.
result The TSDCN achieves high-accuracy classification and reduces training time.

Study flip graphs for surfaces of infinite type, finding uncountably many connected components.

problem Understanding relationships between triangulations of infinite type surfaces via flips.
method Associate triangulations to flip graphs and study sequences of simultaneous flips.
result Flip graphs for infinite type surfaces have uncountably many connected components.

A new method for sparse PCA using orthogonal rotations and soft-thresholding.

problem Sparse PCA with a new basis using orthogonal rotations.
method Initialize with leading principal components, apply kimeskk imes k orthogonal rotation, and soft-threshold the rotated components.
result The proposed method is more stable and explains more variance compared to alternatives.

Study uses geometric algebra to analyze credit cycles, revealing dangerous feedback loops.

problem Understanding and predicting dangerous feedback loops in credit cycles.
method Represent economic states as multi-vectors in Clifford algebra, focusing on bivector elements for rotational coupling.
result Geometric relationship between unemployment and credit contraction shifts from simple correlation to dangerous rotational dynamics during crises.

This paper solves tensor robust principal component analysis via scaled gradient descent.

problem Extracting useful information from tensor data robust to corruptions and ill-conditioning.
method Directly recovers low-rank tensor factors via scaled gradient descent with adaptive thresholding.
result The proposed algorithm converges linearly to the true low-rank tensor at a constant rate independent of the condition number.

Direct contextual policy search methods learn to improve policy parameters and simultaneously generalize these parameters to different context or task variables. However, learning from high-dimensional context variables, such as camera images, is still a prominent problem in many real-world tasks. A naive application o…

2016-11-10abs ↗pdf ↗

Two new models forecast multiple subpopulations' mortality, outperforming existing methods.

problem Modeling mortality patterns and trajectories in related populations.
method Adapted multivariate functional principal component analysis techniques.
result The second proposed model outperforms existing methods in forecast accuracy.

Paper combines geometry and time-series analysis for spatiotemporal data.

problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.

The paper develops methods to accurately locate change points in high-dimensional mean shift models.

problem Locating change points in high-dimensional mean shift models.
method Locally refitted least squares estimator, component-wise and simultaneous rates of estimation.
result Asymptotic validity of component-wise and simultaneous confidence intervals for change point parameters.

A method for representing and comparing categorical trajectories using multivariate functional principal components.

problem Statistical description and comparison of categorical trajectories.
method Transforming categorical trajectories into binary indicator functions and applying multivariate functional principal components analysis.
result Consistent estimators of mean trajectories and covariance functions are obtained under weak regularity assumptions.

Proposes ESCA model to analyze mixed data types in multiple sets of measurements.

problem Separating common and distinct information in mixed data types from multiple sources.
method Exponential Family Simultaneous Component Analysis (ESCA) model with structured sparse loading matrix.
result The proposed method effectively disentangles global, local common and distinct information.

Principal component regression (PCR) is a widely used two-stage procedure: principal component analysis (PCA), followed by regression in which the selected principal components are regarded as new explanatory variables in the model. Note that PCA is based only on the explanatory variables, so the principal components a…

2016-09-28abs ↗pdf ↗

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.

SDR outperforms IDR in multimodal data analysis, especially with fewer samples.

problem Understanding and optimizing data efficiency in multimodal representation learning.
method Generative linear model to synthesize multimodal data, comparing IDR and SDR methods.
result Linear SDR methods yield higher-quality, more succinct reduced-dimensional representations with smaller datasets.

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in da…

2014-10-01abs ↗pdf ↗

Proposes a new model for high-dimensional data analysis with unknown link function.

problem Estimating link function, component functions, and variable interactions in high-dimensional data.
method Generalized Sparse Additive Model with Unknown Link Function (GSAMUL) using B-spline basis and MLP network for link estimation, with 2,1\ell_{2,1}-norm regularizer for variable selection.
result Can realize both variable selection and hidden interaction.

We prove the existence of a degree 7 Vassiliev invariant of long (or string) two-component links which is not preserved under the simultaneous change of orientation of both components. The non-invertibility of this invariant can be detected by the standard weight system with values in the tensor square of the universal…

2005-07-01abs ↗pdf ↗

Principal component regression (PCR) is a two-stage procedure that selects some principal components and then constructs a regression model regarding them as new explanatory variables. Note that the principal components are obtained from only explanatory variables and not considered with the response variable. To addre…

2014-02-26abs ↗pdf ↗

Given a 3-manifold M containing an incompressible surface Q, we obtain an inequality relating the Heegaard genus of M and the Heegaard genera of the components of M - Q. Here the sum of the genera of the components of M - Q is bounded above by a linear expression in terms of the genus of M, the Euler characteristic of …

2001-08-03abs ↗pdf ↗

In several application domains, high-dimensional observations are collected and then analysed in search for naturally occurring data clusters which might provide further insights about the nature of the problem. In this paper we describe a new approach for partitioning such high-dimensional data. Our assumption is that…

2012-03-05abs ↗pdf ↗

We consider the problem of learning a mixture of Random Utility Models (RUMs). Despite the success of RUMs in various domains and the versatility of mixture RUMs to capture the heterogeneity in preferences, there has been only limited progress in learning a mixture of RUMs from partial data such as pairwise comparisons…

2018-12-31abs ↗pdf ↗

We develop a coherent framework for integrative simultaneous analysis of the exploration-exploitation and model order selection trade-offs. We improve over our preceding results on the same subject (Seldin et al., 2011) by combining PAC-Bayesian analysis with Bernstein-type inequality for martingales. Such a combinatio…

2011-05-23abs ↗pdf ↗

New method for semiparametric bandits reduces regret to optimal levels.

problem Complex reward structures in semiparametric bandits.
method Experimental-design approach with sharp regret bound and PAC bound.
result Minimax regret of ildeO(dT) ilde{O}(\sqrt{dT}) and logarithmic regret under positive suboptimality gap.

The paper solves the problem of fitting an ellipsoid to random points efficiently.

problem Finding an ellipsoid that passes through random Gaussian points.
method Constructing a fitting ellipsoid using a decomposition of a random matrix and graph matrix theory.
result The ellipsoid fitting problem transitions from feasible to infeasible at a sharp threshold of nd2/4n \sim d^2/4.

PCA improves detection of phase transitions in muon spectroscopy data from various materials.

problem Subtle changes in asymmetry function indicate phase transitions, but existing methods require material-specific knowledge.
method Applied unsupervised PCA to muon spectroscopy asymmetry data from multiple materials.
result PCA can recover phase transition indicators and improve detection of material-specific variations.

NMF identifies hidden component processes from thermal manufacturing data.

problem Thermal manufacturing processes with many interacting parameters are hard to diagnose.
method Non-negative matrix factorization guided by a knowledge-based initialization strategy.
result Identifies physical meaningful sources from temperature time series.

New algorithms improve tensor CP decomposition under mild conditions.

problem Improving tensor CP decomposition with theoretical guarantees under mild incoherence conditions.
method Composite PCA and Concurrent Orthogonalization algorithms.
result Theoretical guarantees and practical superiority over existing methods.

DPA autoencoders learn data distribution and intrinsic dimensionality with guarantees.

problem Learning data distribution and intrinsic dimensionality in unsupervised learning.
method Combines distributionally correct reconstruction with principal-component-like interpretability.
result Exact theoretical guarantees on disentangling factors of variation and intrinsic dimensionality.