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

Trend · papers per month

63126189252 · Jun 202019922001200920172026
48 results for matrix square roots

Study differential properties of matrix square roots in specific cases.

problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.

Efficiently computes matrix square roots and their inverses for large matrices.

problem Computing matrix square roots and inverses for large matrices efficiently.
method Combines Krylov subspace methods with rational approximation for quadratic-time computation.
result Achieves 4 decimal places of accuracy with fewer than 100 matrix-vector multiplications.

Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to compute the inverse or inverse square root of a matrix whose size is quadratic of …

2018-04-16abs ↗pdf ↗

Paper develops efficient AltMin algorithm for SRPCP robust matrix recovery.

problem SRPCP model robust matrix recovery with universal penalty parameter.
method Tuning-free alternating minimization (AltMin) algorithm with closed-form subproblems.
result Efficient AltMin algorithm confirms robustness and efficiency.

Covariance pooling is a feature pooling method with good classification accuracy. Because covariance features consist of second-order statistics, the scale of the feature elements are varied. Therefore, normalizing covariance features using a matrix square root affects the performance improvement. When pooling methods …

2019-06-05abs ↗pdf ↗

New method differentiates square-root Kalman filters robustly.

problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.

Optimal data splitting improves covariance matrix estimation in large datasets.

problem Improving large covariance matrix estimation in high-dimensional settings.
method Focus on holdout method, derive closed-form error expression, connect to eigenvalue variance.
result Optimal train-test split scales as square root of matrix dimension.

A new method simulates square-root processes efficiently.

problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.

We study kk-GenEV, the problem of finding the top kk generalized eigenvectors, and kk-CCA, the problem of finding the top kk vectors in canonical-correlation analysis. We propose algorithms LazyEV\mathtt{LazyEV} and LazyCCA\mathtt{LazyCCA} to solve the two problems with running times linearly dependent on the input size and…

2016-07-20abs ↗pdf ↗

Layer normalization (LayerNorm) has been successfully applied to various deep neural networks to help stabilize training and boost model convergence because of its capability in handling re-centering and re-scaling of both inputs and weight matrix. However, the computational overhead introduced by LayerNorm makes these…

2019-10-16abs ↗pdf ↗

EPMF factorizes matrices by adjusting their entries to match a specified power.

problem Factorizing matrices with adjusted entries to match a specified power.
method Analyzes the computational complexity of exact and approximate EPMF problems.
result Exact EPMF is strongly NP-hard, but can be solved in polynomial time when rank is fixed.

We study the stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion. In particular, our results include: (I) we bound the gap between the solution matrix of the factorization method and the ground truth in terms of root mean square error; (II) we treat the matrix factorization as …

2012-06-18abs ↗pdf ↗

Study finds price impact follows a 'double' square-root law, suggesting mechanical origin.

problem Understanding the origin of price impact in markets.
method Detailed dataset of Tokyo Stock Exchange orders, analyzing single and metaorders.
result Price impact follows a 'double' square-root law, indicating mechanical origin rather than information.

Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix preconditioning methods are prohibitively expensive. We show how to modify full-matrix adaptive regularization in order to make it practical and e…

2018-06-08abs ↗pdf ↗

A new method solves large-scale sparse group square-root Lasso problems efficiently.

problem Large-scale linearly constrained sparse group square-root Lasso problems.
method Dual semismooth Newton based augmented Lagrangian method (ALM).
result The proposed method efficiently solves the problem with numerical experiments demonstrating its effectiveness.

Alpha-based performance evaluation may fail to capture correlated residuals due to model errors. This paper proposes using the Generalized Information Ratio (GIR) to measure performance under misspecified benchmarks. Motivated by the theoretical link between abnormal returns and residual covariance matrix, GIR is deriv…

2018-03-04abs ↗pdf ↗

New bounds for private matrix approximation using Gaussian noise and Dyson Brownian Motion.

problem Private approximation of symmetric matrices with Gaussian noise.
method Viewing Gaussian noise as Dyson Brownian Motion to track eigenvalue and eigenvector evolution.
result Improved bounds on Frobenius-distance utility for private matrix approximation.

Square-root natural-gradient improves variational inference convergence.

problem Challenges in establishing theoretical convergence guarantees for natural-gradient descent.
method Square-root parameterization for Gaussian covariance.
result Establishes novel convergence guarantees for natural-gradient Gaussian inference.

New insights into learning rates and batch sizes for neural networks using random matrix theory.

problem Understanding how batch size affects learning rates in neural networks.
method Random matrix theory applied to spiked, field-dependent random matrices.
result Analytical expressions for maximal learning rates as a function of batch size.

Many independent studies on stocks and futures contracts have established that market impact is proportional to the square-root of the executed volume. Is market impact quantitatively similar for option markets as well? In order to answer this question, we have analyzed the impact of a large proprietary data set of opt…

2016-02-09abs ↗pdf ↗

The notion of market impact is subtle and sometimes misinterpreted. Here we argue that impact should not be misconstrued as volatility. In particular, the so-called ``square-root impact law'', which states that impact grows as the square-root of traded volume, has nothing to do with price diffusion, i.e. that typical p…

2019-05-11abs ↗pdf ↗

The Volterra square-root process shows non-uniqueness of limiting distributions and regularity of its law.

problem Non-uniqueness of limiting distributions in the Volterra square-root process.
method Establishing existence of limiting distributions using integrability of the Volterra convolution kernel and exponential-affine transformation.
result The limiting distributions of the Volterra square-root process depend on the initial state and belong to weighted Besov spaces.

New analysis of Muon and SignSGD on matrix-valued least squares problems.

problem Understanding the behavior of Muon and SignSGD on matrix-valued least squares problems.
method Derive explicit deterministic dynamics to study learning behavior of Muon and SignSGD.
result Muon and SignSGD exhibit different optimal learning rates and convergence characteristics based on batch size and data covariance.

The study confirms that market volatility can be explained by correlated metaorders impacting prices in a square-root fashion.

problem Explaining market volatility using metaorders and their impact.
method Generated synthetic market data and analyzed the correlation between order flow and returns.
result The square-root law of market impact is confirmed and can be measured from anonymized trade data.

We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…

2005-08-12abs ↗pdf ↗

Solves non-Abelian Rainich problem for SU(2) gauge fields.

problem Existence of local SU(2) Yang-Mills fields with prescribed stress-energy tensor.
method Canonically identifying tensors with Hermitian forms and defining internal square roots of stress-energy tensors.
result Existence of local SU(2) Yang-Mills field is equivalent to a single differential condition on internal square roots of stress-energy tensor.

New method efficiently learns positive-definite curvature for neural nets.

problem Efficiently learn positive-definite curvature for neural net training.
method Spectral-factorized positive-definite curvature learning approach.
result Efficiently applies arbitrary matrix roots and generic curvature learning.

We confirm the square-root law of market impact on Apple Inc. using a large dataset.

problem Testing the square-root law of market impact on a single U.S. large-cap equity.
method Using a full market-by-order feed, we reconstruct metaorders and calibrate impact using the square-root formula.
result The square-root law is confirmed with a prefactor of 0.34, consistent with worldwide data.

Agent-based market shows herding cycles with square-root price impact.

problem Understanding herding cycles in agent-based markets.
method Agent-based model with 20,000 retail traders interacting with a single institutional agent.
result Agent discovers multi-cycle predatory strategy with 8-11 complete cycles over 2000 trading days.

New algorithms reduce contextual bandits' regret without knowing reward noise variances.

problem Reducing regret in contextual bandits with unknown reward noise variances.
method Developed new algorithms based on the optimism principle.
result Regret scales as the square root of the sum of measurement variances, not the time horizon.

The square root velocity framework is a method in shape analysis to define a distance between curves and functional data. Identifying two curves if they differ by a reparametrisation leads to the quotient space of unparametrised curves. In this paper we study analytical and topological aspects of this construction for …

2015-07-09abs ↗pdf ↗

Paper connects surface shape analysis and unbalanced optimal transport.

problem Computing the SRNF shape distance on piecewise linear surfaces.
method Characterizes SRNF shape distance as WFR distance pullback, proposes new algorithm for WFR distance computation.
result Direct computation of SRNF shape distance on piecewise linear surfaces.

Novel approach integrates Multivariate Square-root Lasso into Synthetic Control for high-dimensional data.

problem Challenges in practical implementation and computational efficiency of Synthetic Control method for high-dimensional disaggregated data.
method Integrates Multivariate Square-root Lasso into Synthetic Control framework.
result Demonstrates superior computational efficiency without compromising estimation accuracy.

This thesis examines the accuracy of scaling VaR estimates for longer holding periods.

problem The accuracy of VaR estimates for longer holding periods using the square root of time rule.
method Examined VaR scaling for longer holding periods using empirical analysis.
result Scaling can provide good estimates of VaR but may lead to significant losses over time.