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

98195293390 · Jun 202019922001200920172026
48 results for matrix H theory

Matrix H-theory models stock market fluctuations using hierarchical multivariate distributions.

problem Understanding collective behavior in stock market fluctuations.
method Matrix H-theory framework for multivariate stochastic processes with hierarchical structure.
result Matrix H-theory effectively describes stock market fluctuations using Meijer G-functions.

Study connects covariance cleaning theory to information theory for heavy-tailed distributions.

problem Optimizing covariance matrices for heavy-tailed distributions using information theory.
method Minimizing Frobenius norm and information loss between true and estimated covariance matrices.
result Asymptotic regime of large matrices minimizes information loss for Student's t distributions.

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.

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.

Scattering theory on Riemann surfaces with explicit matrix and generalized period mappings.

problem Scattering theory for harmonic one-forms on Riemann surfaces.
method Construction of scattering theory from boundary value problems involving systems of curves and jump problems. Explicit expression for scattering matrix using Schiffer operators.
result Unitary scattering matrix and general association of polarizing Lagrangian spaces.

Random matrix theory predicts neural representations generalize well.

problem Understanding why neural representations generalize well in practice.
method Applied random matrix theory to kernel regression and neural networks.
result GCV estimator accurately predicts generalization risk in overparameterized settings.

Gradient descent proves global convergence for 4-layer matrix factorization.

problem Global convergence of gradient descent on four-layer matrix factorization under random initialization.
method New techniques to show saddle-avoidance properties and extend eigenvalue theories.
result Polynomial-time global convergence guarantee for randomly initialized gradient descent on four-layer matrix factorization.

Equivalence proven between equivariant K-theory and K-homology for certain matrix group actions.

problem Establishing Poincaré duality for proper cocompact matrix group actions.
method Using equivariant K-theory and K-homology, with geometric models of Baum and Douglas.
result Poincaré duality holds between equivariant K-theory and K-homology for GG-spinc^c manifolds with compact quotient.

We present a unified framework for low-rank matrix estimation with nonconvex penalties. We first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuclear norm penalty. Moreover, we rigorously show that under a certain condition on the magnitude of t…

2015-05-18abs ↗pdf ↗

Paper analyzes AIRL in high-dimensional spaces using random matrix theory.

problem AIRL's performance challenges in high-dimensional environments.
method Examined the rank of the matrix derived from transition matrix, applied random matrix theory.
result High-dimensional scenarios reveal transfer limitations not inherent to AIRL framework.

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.

Extends spectral number variance convergence to random matrix ensembles for twisted Laplacians.

problem Spectral number variance convergence for twisted Laplacians and Dirac operators.
method Extends Rudnick's approach to Gaussian ensembles for twisted Laplacians and Dirac operators.
result Convergence to Gaussian ensembles for twisted Laplacians and Dirac operators.

Proposes a new gauge theory for fuzzy geometries using finite-dimensional algebras.

problem Modeling fuzzy geometries in noncommutative geometry.
method Introduces a Yang-Mills-Higgs matrix model based on gauge matrix spectral triples.
result States Yang-Mills-Higgs theory as an explicit random multimatrix model.

New theory for eigenvectors of generalized Laplacian matrices, addressing dependency issues.

problem Dependency in random matrix theory hinders eigenvector analysis for latent embeddings.
method Introduces generalized Laplacian matrices and a new asymptotic theory framework.
result Established asymptotic normalities for spiked eigenvectors and eigenvalues.

In the probabilistic topic models, the quantity of interest---a low-rank matrix consisting of topic vectors---is hidden in the text corpus matrix, masked by noise, and the Singular Value Decomposition (SVD) is a potentially useful tool for learning such a low-rank matrix. However, the connection between this low-rank m…

2016-08-16abs ↗pdf ↗

New approach to analyze matrix denoising using gradient flow and fixed point equations.

problem Positive semi-definite matrix denoising in extensive-rank and high-dimensional settings.
method Gradient flow and fixed point equations derived from linear pencil techniques of random matrix theory.
result Continuous phase transitions in the extensive-rank and high-dimensional regime.

This contribution to the proceedings of the Cracow meeting on `Applications of Random Matrix Theory' summarizes a series of studies, some old and others more recent on financial applications of Random Matrix Theory (RMT). We first review some early results in that field, with particular emphasis on the applications of …

2005-07-14abs ↗pdf ↗

We generalize the recently discovered relationship between JT gravity and double-scaled random matrix theory to the case that the boundary theory may have time-reversal symmetry and may have fermions with or without supersymmetry. The matching between variants of JT gravity and matrix ensembles depends on the assumed s…

2019-07-07abs ↗pdf ↗

The trivial flat connection's Chern-Simons theory is resurgent, revealing its structure.

problem Understanding the resurgent structure of Chern-Simons theory at the trivial flat connection.
method Analyzing an extended square matrix of (x,q)(x,q)-series to describe the resurgent structure and Stokes constants.
result The resurgent structure and Stokes constants of the Chern-Simons series are completely described.

Many important problems are characterized by the eigenvalues of a large matrix. For example, the difficulty of many optimization problems, such as those arising from the fitting of large models in statistics and machine learning, can be investigated via the spectrum of the Hessian of the empirical loss function. Networ…

2018-02-09abs ↗pdf ↗

Gradient descent solves rank-one matrix estimation problem with detailed time evolution analysis.

problem Estimating a rank-one symmetric matrix corrupted by noise.
method Gradient descent on a sphere, using local versions of the semi-circle law.
result Explicit formulas for the time evolution of the estimator and cost function, revealing phase transitions.

We provide a proof of backpropagation algorithm in matrix notation.

problem The lack of a full induction proof of backpropagation algorithm in matrix notation.
method We provide a full induction proof of the BP algorithm in matrix notation, situating it in the framework of matrix differential calculus.
result We prove the validity of the backpropagation algorithm in inductive form.

We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More s…

2012-11-17abs ↗pdf ↗

The paper proposes a new portfolio allocation method combining RMT and machine learning.

problem Optimal allocation instability in high-dimensional portfolios.
method Combines Random Matrix Theory covariance estimators with Nested Clustered Optimization.
result The modified NCO algorithm achieves stable allocations without risky short positions.

Diffusion models' consistency across splits explained by random matrix theory.

problem Consistency of diffusion models trained on non-overlapping subsets.
method Random matrix theory framework to quantify dataset effects on denoiser and sampling map.
result The theory explains and predicts cross-split disagreement in diffusion models.

We analyze generalization in deep learning models using random matrix theory.

problem Understanding the generalization error in deep learning models with random feature representations.
method Applying Random Matrix Theory to derive asymptotic generalization error formulas for various architectures.
result Linear ESNs are equivalent to ridge regression with exponentially time-weighted input covariance, revealing an inductive bias towards recent inputs.

Paper develops a decoder for sparse codes without encoder matrix, achieving optimal recovery.

problem Designing a decoder for sparse codes from linear measurements alone.
method Matrix factorization to recover encoder and sparse coding matrices from measurements.
result Decoder-Expander Based Factorisation recovers encoder and sparse coding matrix at optimal measurement rate with high probability.

The topological string interpretation of homological knot invariants has led to several insights into the structure of the theory in the case of sl(N). We study possible extensions of the matrix factorization approach to knot homology for other Lie groups and representations. In particular, we introduce a new triply gr…

2005-12-22abs ↗pdf ↗

The paper uses random matrix theory for multi-task regression, improving time series forecasting.

problem Improving time series forecasting using multi-task regression.
method Applying random matrix theory to multi-task regression problems, deriving closed-form solutions for optimization.
result Provides a robust foundation for hyperparameter optimization in multi-task regression scenarios.

New guarantees for matrix completion from any deterministic sampling patterns.

problem Proving guarantees for low-rank matrix completion from non-random sampling schemes.
method Introduced a graph with observed entries as edges to analyze the performance of constrained nuclear norm minimization algorithm.
result The algorithm can successfully complete the matrix if the observation graph is well-connected and has similar node degrees.

We consider D-branes in string theory and address the issue of how to describe them mathematically as a fundamental object (as opposed to a solitonic object) of string theory in the realm in differential and symplectic geometry. The notion of continuous maps, kk-times differentiable maps, and smooth maps from an Azuma…

2014-06-04abs ↗pdf ↗