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

Trend · papers per month

22446688 · Jun 202019922001200920172026
48 results for integer matrices

Low-rank approximations of data matrices are an important dimensionality reduction tool in machine learning and regression analysis. We consider the case of categorical variables, where it can be formulated as the problem of finding low-rank approximations to Boolean matrices. In this paper we give what is to the best …

2018-03-13abs ↗pdf ↗

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 ↗

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

The problem of faithfulness of the (reduced) Burau representation for n=4n =4 is known to be equivalent to the problem of whether certain two matrices AA and BB generate a free group of rank two. It is known that A3A^3 and B3B^3 generate a free group of rank two \cite{9}, \cite{10}, \cite{4}. We prove that they also g…

2019-04-26abs ↗pdf ↗

Using Blanchfield pairings, we show that two Alexander polynomials cannot be realized by a pair of matrices with Gordian distance one if a corresponding quadratic equation does not have an integer solution. We also give an example of how our results help in calculating the Gordian distances, algebraic Gordian distances…

2017-09-17abs ↗pdf ↗

The paper develops algorithms for Boolean matrix factorization using IP and heuristics.

problem Approximating binary input matrices as products of smaller binary factors.
method Alternating optimization with integer programming and greedy/local-search heuristics.
result Proposed methods improve scalability and performance compared to existing techniques.

Affine manifolds are called integral if there is an atlas such that all transition maps are affine transformations with integer matrices of linear parts. In this paper we describe all complete integral affine structures on compact three-dimensional manifolds up to a finite-sheeted covering. Also a complete list of inte…

2018-12-23abs ↗pdf ↗

The paper studies algebraic integer relations and sequences converging to 4.

problem Investigating algebraic integer relations and convergence of sequences.
method Constructing a generalized Farey graph for the subgroup GαG_α and analyzing its properties.
result A sequence of algebraic integers converges to 4, each corresponding to a non-free group of rank 2.

For two positive integers m and n, we let Pn{\mathcal P}_n be the open convex cone in Rn(n+1)/2{\mathbb R}^{n(n+1)/2} consisting of positive definite n x n real symmetric matrices and let R(m,n){\mathbb R}^{(m,n)} be the set of all m x n real matrices. In this article, we investigate differential operators on the non-reductive ma…

2006-11-13abs ↗pdf ↗

We show that for any positive integer nn, the maps xCn{x,zi2}i=14nR4nx \in \mathbb{C}^n \mapsto \{\left|\langle x, z_i \rangle \right|^2\}_{i=1}^{4n} \in \mathbb{R}^{4n}, where ziz_i are the columns of four n×nn\times n unitary matrices, are generically injective modulo multiplication by a global phase factor, yielding a family of emb…

2013-06-05abs ↗pdf ↗

This paper proposes exact and approximation algorithms for Sparse PCA, improving interpretability and scalability.

problem Selecting a prespecified-size principal submatrix from a covariance matrix to maximize its largest eigenvalue.
method Proposes two exact mixed-integer SDPs and a mixed-integer linear program (MILP) for SPCA, analyzes theoretical optimality gaps, and develops approximation algorithms.
result The proposed algorithms achieve strong theoretical optimality and effective scalability, with continuous relaxations close to optimality and MILP solving small to medium-size instances.

Let RR be an infinite commutative ring with identity and n2n\geq 2 be an integer. We prove that for each integer i=0,1,,n2,i=0,1,\cdots ,n-2, the L2L^{2}-Betti number bi(2)(G)=0,b_{i}^{(2)}(G)=0,  \ when G=GLn(R)G=\mathrm{GL}_{n}(R) the general linear group, SLn(R)\mathrm{SL}_{n}(R) the special linear group, % E_{n}(R) the group generated by…

2017-03-01abs ↗pdf ↗

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 symplectic representation of mapping classes is not surjective for certain types of mapping classes.

problem The surjectivity of the symplectic representation of mapping classes, particularly pseudo-Anosov ones, is not always preserved.
method Explicit construction of symplectic matrices with a bi-Perron leading eigenvalue that cannot be represented by orientable pseudo-Anosov mapping classes.
result The symplectic representation of orientable pseudo-Anosov mapping classes is not surjective.

I-BBS identifies latent sub-manifolds from distance matrices, robust to noise.

problem Identifying latent sub-manifolds from distance matrices in high-dimensional spaces.
method Coordinate-free inference using random distance matrix theory and generative noise models.
result Recovering latent geometry from integer-stable signatures of eigenvalues.

We present power low rank ensembles (PLRE), a flexible framework for n-gram language modeling where ensembles of low rank matrices and tensors are used to obtain smoothed probability estimates of words in context. Our method can be understood as a generalization of n-gram modeling to non-integer n, and includes standar…

2013-12-26abs ↗pdf ↗

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms, as well as for nuclear norm minimization, are too slow or even impractical for large-scale problem…

2016-06-02abs ↗pdf ↗

New method improves portfolio selection by filtering noisy covariance matrices.

problem Noisy covariance matrices in financial datasets affect portfolio performance evaluation.
method Combinatorial Optimization approach using Mixed Integer Quadratic Programming.
result Our method outperforms existing filtering strategies for real financial datasets.

A flat complete causal Lorentzian manifold is called {\it strictly causal} if the past and the future of each its point are closed near this point. We consider strictly causal manifolds with unipotent holonomy groups and assign to a manifold of this type four nonnegative integers (a signature) and a parabola in the con…

2005-09-13abs ↗pdf ↗

A general Boltzmann machine with continuous visible and discrete integer valued hidden states is introduced. Under mild assumptions about the connection matrices, the probability density function of the visible units can be solved for analytically, yielding a novel parametric density function involving a ratio of Riema…

2017-12-20abs ↗pdf ↗

Starting from considering deeper relationship between conjugacy classes and irreducible representations of a finite group GG, we find some quite simple RR-matrice defined by using finite groups. This construction produces many sets (or topological spaces) admitting braid group actions. We introduce conceptions "exten…

2018-09-24abs ↗pdf ↗

We analyze kernel matrices in polynomial high-dimensional settings and explain double descent in KRR.

problem Understanding the spectrum of kernel matrices in polynomial high-dimensional settings and its implications for KRR risk.
method Generalized decomposition of kernel matrices into low-rank spike matrix, identity, and Gegenbauer matrix.
result The test error in KRR can exhibit double descent behavior, depending on effective regularization and signal-to-noise ratio.

The paper solves a maximum entropy sampling problem with efficient algorithms and performance guarantees.

problem Selecting the most informative principal submatrix from a covariance matrix.
method Derive a novel convex integer program, develop efficient sampling algorithms with approximation bounds, and analyze local search algorithms.
result Efficient algorithms with near-optimal performance guarantees for solving MESP and A-MESP.

Matrix factorization is a key tool in data analysis; its applications include recommender systems, correlation analysis, signal processing, among others. Binary matrices are a particular case which has received significant attention for over thirty years, especially within the field of data mining. Dictionary learning …

2018-04-16abs ↗pdf ↗

We consider the maximum likelihood estimation of sparse inverse covariance matrices. We demonstrate that current heuristic approaches primarily encourage robustness, instead of the desired sparsity. We give a novel approach that solves the cardinality constrained likelihood problem to certifiable optimality. The approa…

2019-06-25abs ↗pdf ↗

This brief report (6 pages) was written in 1983 but never published. It concerns the hyperbolic 3-orbifolds obtained as quotients of hyperbolic 3-space by the group of invertible 2 by 2 matrices whose entries are integers in the imaginary quadratic extension of Q of discriminant D. For values D > -100 the topological t…

1999-06-10abs ↗pdf ↗

New q-deformed integers help compute Jones polynomials efficiently.

problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.

Generalized Steinberg module presentation for Gaussian and Eisenstein integers.

problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.

Surgery obstructions extended to integer homology spheres using Heegaard Floer homology.

problem Obstructing knots in integer homology spheres using surgery.
method Extending Heegaard Floer homology obstructions to all integer homology spheres for both positive and negative surgeries.
result Deduced a lower bound on b2(W)b_2(W) for smooth cobordism between integer homology spheres.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.