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

55110165220 · Jun 202019922001200920172026
48 results for crossing matrix

In a recent work of Ayaka Shimizu[5]^{[5]}, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…

2011-01-06abs ↗pdf ↗

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.

Paper explores robustness of CCS model for matrix completion.

problem Robustness of cross-concentrated sampling model against sparse outliers.
method Proposes Robust CUR Completion (RCURC) algorithm for efficient non-convex iterative matrix completion.
result Empirical validation of RCURC's efficiency and robustness in synthetic and real datasets.

Defines cross product for m vectors in n-dimensional spaces.

problem No universal definition for cross product in high-dimensional spaces.
method Defines cross product for m vectors in n-dimensional spaces with any metric matrices.
result Cross product length represents m-dimensional volume, components represent volume directions.

The crossing matrix of a braid on NN strands is the N×NN\times N integer matrix with zero diagonal whose i,ji,j entry is the algebraic number (positive minus negative) of crossings by strand ii over strand jj . When restricted to the subgroup of pure braids, this defines a homomorphism onto the additive subgroup of $N…

2018-05-30abs ↗pdf ↗

Study on Gaussian ensemble of matrix products with mixed moments computed.

problem Understanding the statistical properties of matrix products of Gaussian matrices.
method Analysis of a multi-Wishart ensemble and enumeration of non-crossing pairings.
result Mixed moments of the product matrix are computed and found to be weighted by Fuss-Catalan numbers at large NN.

Two crossing homomorphisms on braid groups are shown to be equivalent.

problem Comparing two definitions of crossing homomorphisms on braid groups.
method Diagrammatic and algebraic definitions of crossing homomorphisms compared and computed for simple braids.
result Diagrammatic and algebraic crossing homomorphisms are equivalent.

The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the warping matrix is one greater than the crossing number. We also discuss the linearly i…

2015-08-25abs ↗pdf ↗

Better signal detection in undersampled data using joint and cross covariances.

problem Detecting shared signals in high-dimensional data with limited samples.
method Analysis of three covariance matrices: individual, cross, and joint.
result Joint and cross covariance matrices detect signals earlier than individual covariances.

Many machine learning algorithms require precise estimates of covariance matrices. The sample covariance matrix performs poorly in high-dimensional settings, which has stimulated the development of alternative methods, the majority based on factor models and shrinkage. Recent work of Ledoit and Wolf has extended the sh…

2016-11-02abs ↗pdf ↗

A new method is proposed to compute connectivity measures on multivariate time series with gaps. Rather than removing or filling the gaps, the rows of the joint data matrix containing empty entries are removed and the calculations are done on the remainder matrix. The method, called measure adapted gap removal (MAGR), …

2015-04-29abs ↗pdf ↗

We confirm universal behaviors such as eigenvalue distribution and spacings predicted by Random Matrix Theory (RMT) for the cross correlation matrix of the daily stock prices of Tokyo Stock Exchange from 1993 to 2001, which have been reported for New York Stock Exchange in previous studies. It is shown that the random …

2003-12-25abs ↗pdf ↗

Paper analyzes holdout cross-validation for large non-Gaussian covariance estimation.

problem Estimating large covariance matrices for non-Gaussian data.
method Use of Weingarten calculus and Ledoit-Péché formula for theoretical error derivation.
result Optimal train-test split ratio is proportional to square root of matrix dimension.

Matrix factorization methods are extensively employed to understand complex data. In this paper, we introduce the cross-product penalized component analysis (XCAN), a sparse matrix factorization based on the optimization of a loss function that allows a trade-off between variance maximization and structural preservatio…

2019-06-28abs ↗pdf ↗

Optimal portfolio choice with cross-impact propagators, solving complex equations.

problem Maximizing revenue-risk in a continuous-time portfolio choice problem with cross-impact.
method Formulated as a maximization problem, solved explicitly using operator resolvents and stochastic Fredholm equations.
result Sufficient conditions for the absence of price manipulation, providing financial insights.

Paper optimizes trend-following portfolios using autocorrelation models.

problem Developing an optimal trend-following portfolio strategy.
method Introduces a unifying theoretical setting with autocorrelation models for covariance matrices of trends and risk premia. Specifies practical models for covariance matrices. Decomposes optimal portfolio into four basic components.
result Empirical backtests confirm overperformance of the proposed optimal portfolio.

Proposes a new method for selecting regularization parameters in sparse precision matrix estimation.

problem Selecting an appropriate regularization parameter for sparse precision matrix estimation.
method Developed a closed-form matrix-valued regularization parameter based on the sampling distribution of optimality conditions.
result The proposed method achieves comparable estimation accuracy and superior support recovery to cross-validation, with significant runtime improvements.

New method cleans cross-covariance matrices for better financial forecasting.

problem Asymptotically optimal cross-covariance cleaners fail in real-world, time-varying markets.
method Physics-informed neural network that learns from empirical singular values.
result Trained model outperforms analytical cleaners in out-of-sample cross-covariance prediction.

DAG models with hidden variables present many difficulties that are not present when all nodes are observed. In particular, fully observed DAG models are identified and correspond to well-defined sets ofdistributions, whereas this is not true if nodes are unobserved. Inthis paper we characterize exactly the set of dist…

2013-01-10abs ↗pdf ↗

Study examines local extrema and crossing statistics in financial markets.

problem Understanding local extrema and crossing statistics in financial markets.
method Excursion set theory, numerical computation, theoretical prediction, clustering of geometrical measures, cross-correlation, Singular Value Decomposition.
result Excursion sets reveal statistical coherency and sensitivity to crises in financial markets.

We reconsider the multivariate Kyle model in a risk-neutral setting with a single, perfectly informed rational insider and a rational competitive market maker, setting the price of n correlated securities. We prove the unicity of a symmetric, positive definite solution for the impact matrix and provide insights on its …

2018-06-20abs ↗pdf ↗

The paper analyzes cryptocurrency returns and uses community detection to create an investment portfolio.

problem Understanding correlations and diversification in cryptocurrency markets.
method Cross-correlation analysis, Louvain community detection, PCA, Random Matrix Theory (RMT).
result Community detection method identifies 15 groups of cryptocurrencies, leading to an optimized investment portfolio.

Cross-Domain Collaborative Filtering (CDCF) provides a way to alleviate data sparsity and cold-start problems present in recommendation systems by exploiting the knowledge from related domains. Existing CDCF models are either based on matrix factorization or deep neural networks. Either of the techniques in isolation m…

2019-07-19abs ↗pdf ↗

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

EAST aligns neural network classifiers with user-defined evaluation metrics.

problem Mismatch between neural network training and evaluation metrics leads to suboptimal performance.
method EAST uses dynamic thresholding, soft-set confusion matrix, and annealing to align neural network predictions with target evaluation metrics.
result EAST improves alignment between training objectives and evaluation metrics, outperforming existing methods.

LDA-GO improves LDA for high-dimensional data via gradient optimization.

problem LDA struggles in high-dimensional settings due to unreliable covariance matrix estimation.
method LDA-GO learns a low-rank precision matrix via gradient optimization, automatically selecting between Gaussian likelihood and cross-entropy loss.
result LDA-GO outperforms other LDA variants in sparse-signal high-dimensional regimes.

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of `feature spanning points' can be used for learning. The main potential of cross-kernels lies in the fact that (a) only one side of the matrix scales with the number of data points, and (b) cross-kernels, as oppos…

2014-06-10abs ↗pdf ↗

We consider moduli spaces of cyclic configurations of NN lines in a 2n2n-dimensional symplectic vector space, such that every set of nn consecutive lines generates a Lagrangian subspace. We study geometric and combinatorial problems related to these moduli spaces, and prove that they are isomorphic to quotients of sp…

2018-12-11abs ↗pdf ↗

The paper develops a cross-validation method for improving signal denoising techniques.

problem Improving signal denoising methods for nonparametric regression.
method Develops a general cross-validation framework for signal denoising and applies it to Trend Filtering and Dyadic CART.
result Cross validated versions of Trend Filtering and Dyadic CART achieve nearly optimal convergence rates.

When response variables are nominal and populations are cross-classified with respect to multiple polytomies, questions often arise about the degree of association of the responses with explanatory variables. When populations are known, we introduce a nominal association vector and matrix to evaluate the dependence of …

2011-09-12abs ↗pdf ↗

Diversification of an investment into independently fluctuating assets reduces its risk. In reality, movement of assets are are mutually correlated and therefore knowledge of cross--correlations among asset price movements are of great importance. Our results support the possibility that the problem of finding an inves…

2001-11-28abs ↗pdf ↗