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

176352527703 · Jun 202019922001200920172026
48 results for Singular Value Analysis

New technique stabilizes singular values in concatenated matrices.

problem How singular values of concatenated matrices relate to individual components.
method Developed perturbation technique extending classical results to concatenated matrices.
result Dominant singular values remain stable under small perturbations in submatrices.

This work analyzes self-attention matrices using random matrix theory.

problem Understanding the theoretical behavior of self-attention layers in neural networks.
method Asymptotic spectral analysis of the attention matrix, Gaussian equivalence, and linearization.
result The singular value distribution of the attention matrix is asymptotically characterized by a linear model.

Study analyzes perturbations in singular subspaces under random noise.

problem Understanding singular vector and subspace changes in signal-plus-noise models.
method Generalized Davis-Kahan-Wedin theorem for any unitarily invariant norm, considering \ell_\infty and 2,\ell_{2,\infty} bounds.
result Fine-grained insights into singular vector and subspace perturbations, including \ell_\infty and 2,\ell_{2,\infty} bounds.

Study shows XRP price correlates with transaction network metrics.

problem Understanding the relationship between cryptoasset price and network metrics.
method Analysis of correlation tensor spectra, random matrix theory comparison, singular values investigation.
result Distinct correlation between XRP price and singular values during bubble and non-bubble periods.

Paper analyzes singular subspace estimation in noisy matrix models.

problem Estimating low-rank signals in noisy matrix data.
method Asymptotic distributional theory, extreme value theory, saddle point approximation, random matrix theory.
result Plug-in test statistic based on two-to-infinity norm has higher power for detecting structured alternatives.

New framework for higher-order singular-value derivatives of rectangular matrices.

problem Challenging to derive higher-order Fréchet derivatives of singular values in real rectangular matrices.
method Using Kato's analytic perturbation theory for self-adjoint operators and embedding rectangular matrices into block self-adjoint operators.
result Closed-form expressions for the nn-th order spectral variations of singular values.

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

Singular values of a data in a matrix form provide insights on the structure of the data, the effective dimensionality, and the choice of hyper-parameters on higher-level data analysis tools. However, in many practical applications such as collaborative filtering and network analysis, we only get a partial observation.…

2017-03-18abs ↗pdf ↗

Stochastic gradient descent regularizes least squares problems by smoothing large singular values.

problem Regularization of least squares problems using stochastic gradient descent.
method Analysis of stochastic gradient descent applied to least squares problems, showing a regularization effect.
result Stochastic gradient descent leads to a quick regularization effect, smoothing large singular values.

Random matrix analysis reveals that neural network weights are mostly random, with some indicating learned information.

problem Understanding how neural networks store information needed for tasks.
method Random matrix theory (RMT) applied to weight matrices of trained deep neural networks.
result Most singular values and eigenvectors of trained neural networks follow universal RMT predictions, suggesting they are random and do not contain system-specific information.

Paper studies tensor models using random matrix theory.

problem Analyzing asymmetric order-d spiked tensor models with Gaussian noise.
method Uses variational definition of singular vectors and values, constructs equivalent spiked symmetric block-wise random matrix from tensor contractions.
result Characterizes asymptotic singular values and alignments of singular vectors with true spike components.

A problem of paramount importance in both pure (Restricted Invertibility problem) and applied mathematics (Feature extraction) is the one of selecting a submatrix of a given matrix, such that this submatrix has its smallest singular value above a specified level. Such problems can be addressed using perturbation analys…

2018-04-03abs ↗pdf ↗

S2D selectively decays large singular values to improve quantization of neural activations.

problem Large activation outliers in transformer models cause accuracy drops during quantization.
method Selective Spectral Decay (S2DS^2D) that surgically regularizes only the largest singular values.
result Significantly reduces activation outliers and produces well-conditioned representations.

The paper sharpens the analysis of sketch-and-project methods using randomized singular value decomposition.

problem Improving convergence rates of sketch-and-project methods for solving linear systems and non-linear optimization problems.
method Developing a theoretical framework and new spectral bounds for the expected sketched projection matrix.
result The convergence rate improves linearly with sketch size and even faster with certain spectral decays.

Study analyzes accuracy of tensor deflation in noisy conditions.

problem Analyzing accuracy of tensor deflation in noisy conditions.
method Asymptotic study of Hotelling-type tensor deflation in large tensor dimensions.
result Characterization of estimated singular values and singular vector alignments.

New algorithms improve RPCA for large matrices with upper rank bounds.

problem Efficiently decompose large matrices into low-rank and sparse parts.
method Combine regularization and matrix multiplication approaches with upper rank bounds.
result Proposed algorithms are faster and more robust than existing methods.

A new PCR method using SVD with sparse regularization.

problem Lack of response variable information in traditional PCR.
method One-stage SVD approach with two loss functions and sparse regularization.
result Obtains principal component loadings with response variable information.

Many modern big data applications feature large scale in both numbers of responses and predictors. Better statistical efficiency and scientific insights can be enabled by understanding the large-scale response-predictor association network structures via layers of sparse latent factors ranked by importance. Yet sparsit…

2017-04-26abs ↗pdf ↗

The paper establishes criteria for spacetime inextendibility using asymptotic volume-distance-ratio analysis.

problem Determining inextendibility of spacetimes near singularities.
method Asymptotic analysis of volume-distance-ratio (VDR) to prove inextendibility criteria.
result Failure of VDR convergence to the Minkowski value implies inextendibility of spacetime.

The paper analyzes PLS-SVD in high-dimensional data integration, revealing its strengths and limitations.

problem Understanding the behavior of PLS-SVD in high-dimensional data integration.
method Analysis using random matrix theory and singular value decomposition.
result PLS-SVD exhibits counter-intuitive or limiting behavior in certain regimes and outperforms PCA when detecting common latent subspace.

Study differentiable maps on hypersurface links, finding fold maps with circle singular value sets.

problem Understanding differentiable maps on hypersurface links.
method Restricting holomorphic functions to hypersurface links and analyzing the resulting maps.
result Found fold maps with concentric circle singular value sets.

A general framework for principal component analysis (PCA) in the presence of heteroskedastic noise is introduced. We propose an algorithm called HeteroPCA, which involves iteratively imputing the diagonal entries of the sample covariance matrix to remove estimation bias due to heteroskedasticity. This procedure is com…

2018-10-19abs ↗pdf ↗

Study on games with degenerate diffusion matrices, proving value existence and convergence.

problem Zero-sum games between singular controller and stopper with degenerate diffusion.
method Probabilistic approach using parameterized approximations, convergence analysis.
result Existence of value and optimal stopping times for the game with degenerate dynamics.

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.

A low rank matrix X has been contaminated by uniformly distributed noise, missing values, outliers and corrupt entries. Reconstruction of X from the singular values and singular vectors of the contaminated matrix Y is a key problem in machine learning, computer vision and data science. In this paper we show that common…

2017-10-26abs ↗pdf ↗

Deterministic bounds for tensor singular values and vectors, differing from matrix cases.

problem Spectral learning of higher-order orthogonally decomposable tensors.
method Deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors.
result Perturbation affects each essential singular value/vector in isolation, independent of multiplicity and distance from other singular values.

The paper analyzes how random perturbations affect RSVD and its applications.

problem Analyzing the impact of random perturbations on RSVD.
method Derives bounds for distances between exact and approximated singular vectors using RSVD.
result Established nearly-optimal convergence rates and asymptotic normality for RSVD in various inference problems.

In this paper, we introduce the algorithms of Orthogonal Deep Neural Networks (OrthDNNs) to connect with recent interest of spectrally regularized deep learning methods. OrthDNNs are theoretically motivated by generalization analysis of modern DNNs, with the aim to find solution properties of network weights that guara…

2019-05-15abs ↗pdf ↗

We introduce the concept of singular values for the Riemann curvature tensor, a central mathematical tool in Einstein's theory of general relativity. We study the properties related to the singular values, and investigate five typical cases to show its relationship to the Ricci scalar and other invariants.

2018-07-23abs ↗pdf ↗