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

Trend · papers per month

85169254338 · Jun 202019922001200920172026
48 results for matrix pair reduction

CDP reduces point cloud dimensions by preserving detour-induced local non-convexity.

problem Preserving local non-convexity in point cloud dimensionality reduction.
method CDP builds a k-NN graph, identifies admissible pairs, aggregates normalized directions, and uses top-k eigenvectors for projection.
result CDP provides verifiable guarantees on post-projection distortion and direction energy.

The paper defines and classifies Cappell-Shaneson polynomials.

problem Characterizing Cappell-Shaneson polynomials.
method Algebraic conditions on polynomials, reduction modulo primes, and construction of infinite series.
result Complete lists of Cappell-Shaneson polynomials of degrees 4 and 5, and several infinite series of degree 6.

We study the problem of learning similarity functions over very large corpora using neural network embedding models. These models are typically trained using SGD with sampling of random observed and unobserved pairs, with a number of samples that grows quadratically with the corpus size, making it expensive to scale to…

2018-07-18abs ↗pdf ↗

PSMM method optimizes matrix sufficient dimension reduction.

problem Feature matrices with row- and column-wise interpretations require efficient dimension reduction.
method PSMM method converts matrix problem into classification problems using rank-1 normal matrix.
result PSMM outperforms existing methods and provides strong interpretability.

Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative coefficient matrix, and the coefficient matrix is used as the new representation. …

2013-12-05abs ↗pdf ↗

MoDeGPT compresses large language models without accuracy loss, saving 98% compute costs.

problem Compression of large language models for resource-constrained devices.
method Structured compression framework using modular decomposition and matrix pair reduction.
result MoDeGPT achieves 90-95% zero-shot performance with 25-30% compression rates.

Paper introduces a taxonomy of reduction matrices for more efficient graph coarsening.

problem Efficiently reducing graph size while preserving important information.
method Introduces a more general notion of reduction matrix, not necessarily the pseudo-inverse of the lifting matrix.
result Reducing the Restricted Spectral Approximation (RSA) by modifying the reduction matrix.

We prove that K-polystable log Fano pairs have reductive automorphism groups. In fact, we deduce this statement by establishing more general results concerning the S-completeness and ΘΘ-reductivity of the moduli of K-semistable log Fano pairs. Assuming the conjecture that K-semistability is an open condition, we prove…

2019-06-07abs ↗pdf ↗

The paper explores reductions of self-dual conformal structure equations.

problem Integrating the general local form of self-dual conformal structure.
method Using Lax pair, hierarchy structure, and dressing scheme to discuss reductions.
result Constructs solutions for the SDCS equations and presents type B SDCS system.

Efficiently reduces rank of non-negative matrices with quadratic time complexity.

problem Efficiently reducing the rank of non-negative matrices.
method Formulated rank reduction as a mean-field approximation using a log-linear model.
result Optimal solution for minimizing KL divergence can be computed in closed form.

Explicit matrix presentations of Blanchfield pairings and twisted pairings for torus knots.

problem Computing explicit matrix presentations of Blanchfield and twisted Blanchfield pairings for torus knots.
method Using a taut identity to construct a chain complex with few generators, and describing the twisted Alexander module.
result Explicit matrix presentations of the Blanchfield pairing and twisted pairings for (m,n)(m,n)-torus knots.

Study of twisted Alexander matrices for certain quandles and their invariants.

problem Investigate ff-twisted Alexander matrices for quandles associated with Alexander pairs.
method Define and analyze ff-twisted Alexander matrices of certain quandles, relate to Carter-Saito-Satoh's invariant, and discuss connections to quandle homology groups.
result 0-th elementary ideal of ff-twisted Alexander matrix can be described using Carter-Saito-Satoh's invariant.

The paper shows how to recover true node positions from a graph or similarity matrix.

problem Recovering true distances and positions from a graph or similarity matrix.
method Two steps: matrix factorisation followed by nonlinear dimension reduction.
result Nonlinear dimension reduction can recover latent positions close to a manifold where geodesic distance is encoded.

We introduce and study the notion of contact dual pair adopting a line bundle approach to contact and Jacobi geometry. A contact dual pair is a pair of Jacobi morphisms defined on the same contact manifold and satisfying a certain orthogonality condition. Contact groupoids and contact reduction are the main sources of …

2019-03-12abs ↗pdf ↗

The kernel matrix used in kernel methods encodes all the information required for solving complex nonlinear problems defined on data representations in the input space using simple, but implicitly defined, solutions. Spectral analysis on the kernel matrix defines an explicit nonlinear mapping of the input data represen…

2018-12-14abs ↗pdf ↗

We prove a very general Kobayashi-Hitchin correspondence on arbitrary compact Hermitian manifolds. This correspondence refers to moduli spaces of "universal holomorphic oriented pairs". Most of the classical moduli problems in complex geometry (e. g. holomorphic bundles with reductive structure groups, holomorphic pair…

2004-02-21abs ↗pdf ↗

Efficiently solves large portfolio optimization problems by reducing and sparsifying covariance matrices.

problem Large and dense covariance matrices limit efficient portfolio optimization.
method Dimension reduction and increased sparsity based on machine learning predictions.
result Improved portfolio performance and reduced runtime compared to full dense covariance matrices.

We solve the problem of description for nonsingular pairs of compatible flat metrics in the general N-component case. The integrable nonlinear partial differential equations describing all nonsingular pairs of compatible flat metrics (or, in other words, nonsingular flat pencils of metrics) are found and integrated. Th…

2002-01-23abs ↗pdf ↗

Large textual corpora are often represented by the document-term frequency matrix whose elements are the frequency of terms; however, this matrix has two problems: sparsity and high dimensionality. Four dimension reduction strategies are used to address these problems. Of the four strategies, unsupervised feature trans…

2019-09-21abs ↗pdf ↗

New methods for sketching non-PSD matrices improve regression and optimization tasks.

problem Efficiently handling non-PSD matrices in computations.
method Developed novel matrix sketching techniques for non-PSD and complex matrices.
result Improved performance in convex and non-convex optimization, regression, and vector-matrix-vector queries.

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.

Sparse random projection (RP) is a popular tool for dimensionality reduction that shows promising performance with low computational complexity. However, in the existing sparse RP matrices, the positions of non-zero entries are usually randomly selected. Although they adopt uniform sampling with replacement, due to lar…

2020-02-07abs ↗pdf ↗

For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the Jacobian matrix of the cluster transformation. Furthermore, we show that this rela…

2018-04-30abs ↗pdf ↗

The study proposes a method for risk reduction without relying on risk measurement.

problem Theoretical utopia of risk minimization vs. practical risk reduction.
method Generalization of matrix rank and condition number for identifying riskiest scenarios.
result Risk reduction achieved without risk measurement, validated by real data.

Paper shows spectra can't distinguish naturally reductive manifolds.

problem Cannot distinguish naturally reductive manifolds using Laplace-Beltrami spectrum.
method Characterized naturally reductive 2-step nilpotent Lie groups via Ambrose-Singer's structures; constructed isospectral pairs of 9-dimensional nilmanifolds.
result Spectra of Laplace-Beltrami operator can't distinguish naturally reductive manifolds from non-naturally reductive ones.

Extending our reduction construction in \cite{Hu} to the Hamiltonian action of a Poisson Lie group, we show that generalized Kähler reduction exists even when only one generalized complex structure in the pair is preserved by the group action. We show that the constructions in string theory of the (geometrical) TT-dua…

2005-12-29abs ↗pdf ↗

It is shown that the cotangent bundle of a matched pair Lie group is itself a matched pair Lie group. The trivialization of the cotangent bundle of a matched pair Lie group are presented. On the trivialized space, the canonical symplectic two-form and canonical Poisson bracket are explicitly written. Various symplectic…

2016-04-18abs ↗pdf ↗

Hidden Markov Models (HMMs) can be accurately approximated using co-occurrence frequencies of pairs and triples of observations by using a fast spectral method in contrast to the usual slow methods like EM or Gibbs sampling. We provide a new spectral method which significantly reduces the number of model parameters tha…

2012-03-28abs ↗pdf ↗

We prove a reduction theorem for the tangent bundle of a Poisson manifold (M,π)(M, π) endowed with a pre-Hamiltonian action of a Poisson Lie group (G,πG)(G, π_G). In the special case of a Hamiltonian action of a Lie group, we are able to compare our reduction to the classical Marsden-Ratiu reduction of MM. If the manifold $M…

2015-07-31abs ↗pdf ↗

We give a simple explicit formula for turnover reduction when a large number of alphas are traded on the same execution platform and trades are crossed internally. We model turnover reduction via alpha correlations. Then, for a large number of alphas, turnover reduction is related to the largest eigenvalue and the corr…

2014-04-20abs ↗pdf ↗

We study integrable geodesic flows on Stiefel varieties Vn,r=SO(n)/SO(nr)V_{n,r}=SO(n)/SO(n-r) given by the Euclidean, normal (standard), Manakov-type, and Einstein metrics. We also consider natural generalizations of the Neumann systems on Vn,rV_{n,r} with the above metrics and proves their integrability in the non-commutative sense b…

2010-11-08abs ↗pdf ↗

Unified framework for graph coarsening using node features and graph matrices.

problem Dimensionality reduction of large graphs while preserving node features.
method Optimization-based framework that unifies graph learning and dimensionality reduction.
result The learned coarsened graph is ε-similar to the original graph, where ε is a small positive number.

Over the years data has become increasingly higher dimensional, which has prompted an increased need for dimension reduction techniques. This is perhaps especially true for clustering (unsupervised classification) as well as semi-supervised and supervised classification. Although dimension reduction in the area of clus…

2017-12-22abs ↗pdf ↗

We introduce the notion of Hamiltonian spaces for Manin pairs over manifolds, using the so-called generalized Dirac structures. As an example, we describe Hamiltonian spaces of a quasi-Lie bialgebroid using this general framework. We also discuss reduction of Hamiltonian spaces of this general type.

2008-09-24abs ↗pdf ↗

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

Study uses NMF to reduce cancer microarray data dimensions.

problem High dimensionality of cancer microarray data hinders understanding.
method Used Non-negative Matrix Factorization (NMF) for dimensionality reduction.
result NMF achieves 98% classification accuracy.

We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an ever-increasing demand for methods of dimension reduction in order to undertake the st…

2010-11-02abs ↗pdf ↗

Recently Kearton showed that any Seifert matrix of a knot is S--equivalent to the Seifert matrix of a prime knot. We show in this note that such a matrix is in fact S--equivalent to the Seifert matrix of a hyperbolic knot. This result follows from reinterpreting this problem in terms of Blanchfield pairings and by appl…

2007-04-25abs ↗pdf ↗

Study Alexander matrices for link quandles and their relation to knot invariants.

problem Understanding Alexander matrices for link quandles and their applications to knot invariants.
method Investigate ff-twisted Alexander matrices and their connection to quandle cocycle invariants.
result Show that ff-twisted Alexander invariants of knot quandles are stronger than those of knot groups.