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

19395877 · Jun 202019922001200920172026
48 results for asymmetric matrices

Complex systems are typically represented by large ensembles of observations. Correlation matrices provide an efficient formal framework to extract information from such multivariate ensembles and identify in a quantifiable way patterns of activity that are reproducible with statistically significant frequency compared…

2011-06-02abs ↗pdf ↗

We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random…

2012-01-31abs ↗pdf ↗

Gradient descent recovers principal components of overparametrized asymmetric matrices without explicit regularization.

problem Asymmetric matrix factorization under overparametrization with minimal rank assumptions.
method Vanilla gradient descent with small random initialization and proper early stopping.
result Gradient descent produces the best low-rank approximation without explicit regularization.

A family of parsimonious shifted asymmetric Laplace mixture models is introduced. We extend the mixture of factor analyzers model to the shifted asymmetric Laplace distribution. Imposing constraints on the constitute parts of the resulting decomposed component scale matrices leads to a family of parsimonious models. An…

2013-11-01abs ↗pdf ↗

Study uncovers new phase transitions in asymmetric causal inference scenarios.

problem Understanding typical phase transitions in asymmetric causal inference.
method Combining Causal inference (C-inf) and Low-rank recovery (LRR) with Random duality - Free probability theory (RDT-FPT).
result Discovering a doubling low-rankness phenomenon in asymmetric scenarios.

Extends multidimensional scaling to analyze three-way asymmetric proximities.

problem Analyzing asymmetric and three-way proximities in a Euclidean space.
method Unified h-plot methodology for three-way asymmetric proximities, including symmetric and conditional frameworks.
result Identification of archetypal profiles and clustering structures.

Financial markets are highly correlated systems that reveal both the inter-market dependencies and the correlations among their different components. Standard analyzing techniques include correlation coefficients for pairs of signals and correlation matrices for rich multivariate data. In the latter case one constructs…

2006-05-15abs ↗pdf ↗

Multiresolution Matrix Factorization (MMF) was recently introduced as an alternative to the dominant low-rank paradigm in order to capture structure in matrices at multiple different scales. Using ideas from multiresolution analysis (MRA), MMF teased out hierarchical structure in symmetric matrices by constructing a se…

2019-10-10abs ↗pdf ↗

Gradient descent solves asymmetric low-rank matrix sensing without balancing.

problem Recovering asymmetric low-rank matrices from linear measurements.
method Gradient descent with spectral initialization, avoiding balancing term.
result Gradient descent converges linearly without balancing, factors stay balanced.

The paper studies phase transitions in random matrices and tensor unfolding for detecting signals.

problem Phase transitions in singular values and vectors of large random matrices.
method Analysis of singular values and vectors of long rectangular random matrices, and tensor unfolding algorithm for asymmetric rank-one spiked tensor models.
result An exact threshold for tensor unfolding to detect signals, independent of unfolding procedure.

Random feature matrices' singular values concentrate near their full expectation in high dimensions.

problem Characterizing the spectra of random feature matrices for regression problems.
method Analyzing two settings of input variables (random or well-separated) with conditions on dimension, complexity ratio, and sampling variance.
result The singular values of random feature matrices concentrate near their full expectation and near one with high probability.

Edge subdivision affects the Perron eigenvalue of tree Ricci matrices.

problem Understanding how edge subdivision impacts the Perron eigenvalue of tree Ricci matrices.
method Compressing branches into scalar feedback functions via Schur complement, reducing the spectral problem to a one-dimensional Chebyshev equation.
result Edge subdivision can decrease, preserve, or increase the Perron eigenvalue of tree Ricci matrices.

SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.

problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.

Paper studies asymmetric matrix sensing, proving gradient descent converges to low-rank solutions.

problem Reconstructing asymmetric low-rank matrices from linear measurements.
method Factorized gradient descent with coupling and regularization properties.
result Gradient descent from small random initialization converges to globally optimal and generalizing solutions.

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.

Study of geometric analysis on asymmetric metric spaces, including heat flow and Sobolev spaces.

problem Analysis of geometric properties on asymmetric metric measure spaces.
method Introduction of upper gradients, qq-Laplacian, and qq-heat flow in asymmetric settings.
result Extension of concepts from symmetric to asymmetric metric measure spaces.

This study examines asymmetric cross-correlations in cryptocurrency markets using fractal analysis.

problem Exploring asymmetric multifractal cross-correlations in cryptocurrency markets.
method Fractal analysis and MF-ADCCA method to investigate asymmetric volatility dynamics.
result Cross-correlations are stronger in downtrend markets than in uptrend markets for maturing BTC and ETH.

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

In this paper we study the matrix completion problem: Suppose XRnr×ncX \in {\mathbb R}^{n_r \times n_c} is unknown except for a known upper bound rr on its rank. By measuring a small number mnrncm \ll n_r n_c of elements of XX, is it possible to recover XX exactly with noise-free measurements, or to construct a good approxi…

2019-08-02abs ↗pdf ↗

We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context. Shrivastava and Li argue that there is no symmetric LSH for the problem and propose an asymmetric LSH based on different mappings for query and database points. Howev…

2014-10-21abs ↗pdf ↗

Paper proposes new methods for improving interatomic potentials.

problem Limitations of conventional SO(2) Linear architectures in MLIPs.
method Direct Cartesian construction, recursive Clebsch-Gordan construction, Edge Complex Product Basis, Radial Rotary Complex Attention.
result TECE-OAM-RRA-1.0 achieves SOTA performance on Matbench Discovery.

The paper improves asymmetric causality tests by addressing inefficiencies and statistical significance issues.

problem Inefficiencies and statistical significance issues in asymmetric causality tests.
method Improved asymmetric causality tests via partial cumulative sums for positive and negative components, explicitly testing differences between causal parameters.
result Efficiently tested hypotheses on asymmetric causal interaction between financial markets.

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

In this paper we show how the study of asymmetric R&D alliances, that are those between young and small firms and large and MNEs firms for knowledge exploration and/or exploitation, requires the adoption of a coopetitive framework which consider both collaboration and competition. We draw upon the literature on asymmet…

2012-05-13abs ↗pdf ↗

Bayesian VI copula models capture asymmetric intraday equity dependence.

problem Modeling asymmetric and extreme tail dependence in financial data.
method Bayesian variational inference for skew-t copula models in high dimensions.
result The copula captures substantial heterogeneity in asymmetric dependence over equity pairs and time.

The paper introduces new portfolio rules beyond mean-variance, addressing asymmetry and uncertainty.

problem Optimizing portfolios with asymmetric returns and uncertainty in expected returns.
method Derives allocation rules for asymmetric Laplace distributed returns and random normal expected returns. Addresses singular covariance matrices and uncertainty in returns.
result Optimal worst-case scenario solution provides a convex alternative to risk parity, improving portfolio stability.

In recent years, correntropy has been seccessfully applied to robust adaptive filtering to eliminate adverse effects of impulsive noises or outliers. Correntropy is generally defined as the expectation of a Gaussian kernel between two random variables. This definition is reasonable when the error between the two random…

2019-11-21abs ↗pdf ↗

This paper introduces constrained mixtures for continuous distributions, characterized by a mixture of distributions where each distribution has a shape similar to the base distribution and disjoint domains. This new concept is used to create generalized asymmetric versions of the Laplace and normal distributions, whic…

2015-03-22abs ↗pdf ↗

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

Paper defines saddle points in asymmetric Dynkin games using martingale theory.

problem Tackles saddle point conditions in asymmetric Dynkin games with partial information.
method Uses martingale theory to identify super and submartingales related to equilibrium payoffs.
result Characterizes saddle point strategies in terms of equilibrium payoffs' dynamics and Doob-Meyer decompositions.

Modified asymmetric hidden Markov models for time series with autoregressive components.

problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.