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

1122 · Sep 201219922001200920172026
42 results for fixed-rank

We prove that semialgebraic sets of rectangular matrices of a fixed rank, of skew-symmetric matrices of a fixed rank and of real symmetric matrices whose eigenvalues have prescribed multiplicities are minimal submanifolds of the space of real matrices of a given size.

2020-03-02abs ↗pdf ↗

This research solves Hermite interpolation on manifolds using retractions.

problem Interpolating data on non-Euclidean spaces with matching derivatives.
method Proposes a novel procedure using retractions for Hermite interpolation on various manifolds.
result Establishes the well-posedness of the method and extends Hermite interpolation results to manifolds.

New method reduces computational cost for nonnegative low rank matrix approximation.

problem Efficiently compute nonnegative low rank matrix approximation for nonnegative matrices.
method Alternating projections onto tangent spaces of fixed rank matrices manifold and nonnegative matrix manifold.
result Sequence converges linearly to optimal solutions, showing better performance in terms of computational time and accuracy.

Estimates covariance matrices for matrix-variate data via core covariance geometry.

problem Estimating covariance matrices for matrix-variate data with partial isotropy.
method Fixed-rank core covariance geometry, partial-isotropy rank-r core shrinkage estimator.
result The geometry of the space of rank-r cores is a smooth manifold.

A new Riemannian framework optimizes LoRA for faster convergence and better performance.

problem Optimizing low-rank adapters in neural networks to improve convergence and performance.
method Integrates Riemannion optimizer, LoRA initialization, and efficient implementation for geometrically treating low-rank adapters.
result Consistent and noticeable improvements in convergence speed and final task performance over standard LoRA and its modifications.

New geometric framework for positive semidefinite matrices of fixed rank.

problem Statistical analysis of positive semidefinite matrices of fixed rank.
method Introducing a manifold S(n,p)S(n,p)^{*} with Riemannian geometry and Lie group structure.
result Analytical closed forms for geodesics and Fréchet means.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation for high-dimensional functional MRI and dynamic graph recovery.
method Reformulates imputation as RKHS regression with TT-constrained coefficients and Hadamard overparameterization. Optimizes TT coefficients and kernel matrices on Riemannian manifolds.
result Consistently outperforms state-of-the-art methods in modeling accuracy.

KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.

problem Multi-way data imputation in high-dimensional spaces.
method Reformulates imputation as RKHS regression with TT-constrained coefficients, optimized on manifold frameworks.
result Consistently outperforms state-of-the-art methods in accuracy.

Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles, and defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles, as well as a transformation from matroid b…

1999-11-21abs ↗pdf ↗

Factorization machines (FM) are a popular model class to learn pairwise interactions by a low-rank approximation. Different from existing FM-based approaches which use a fixed rank for all features, this paper proposes a Rank-Aware FM (RaFM) model which adopts pairwise interactions from embeddings with different ranks.…

2019-05-18abs ↗pdf ↗

A compact topological surface S, possibly non-orientable and with non-empty boundary, always admits a Klein surface structure (an atlas whose transition maps are dianalytic). Its complex cover is, by definition, a compact Riemann surface M endowed with an anti-holomorphic involution which determines topologically the o…

2009-12-03abs ↗pdf ↗

The main goal of this paper is to extend the so-called Dirac-Frenkel Variational Principle in the framework of tensor Banach spaces. To this end we observe that a tensor product of normed spaces can be described as a union of disjoint connected components. Then we show that each of these connected components, composed …

2016-10-31abs ↗pdf ↗

Structured sparsity is an important modeling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design. In this paper we investigate the generalized conditional gradient (GCG) algorithm for solving structured sparse optimi…

2014-10-17abs ↗pdf ↗

Clarifies the structure of quantum states using algebraic methods.

problem Unclear stratification of quantum states in physics literature.
method Analyzes the state space S(A) of a finite-dimensional C*-algebra A, focusing on unitary orbits and their properties.
result Identifies a natural Whitney stratification of the state space into matrices of fixed rank, providing a pseudo-manifold structure.

We consider two Riemannian geometries for the manifold M(p,m×n)\mathcal{M}(p,m\times n) of all m×nm\times n matrices of rank pp. The geometries are induced on M(p,m×n)\mathcal{M}(p,m\times n) by viewing it as the base manifold of the submersion π:(M,N)MNTπ:(M,N)\mapsto MN^T, selecting an adequate Riemannian metric on the total space, and …

2012-09-01abs ↗pdf ↗

Riemannian gradient descent escapes some spurious critical points on low-rank matrix manifold.

problem Spurious critical points on the boundary of low-rank matrix manifold.
method Riemannian gradient descent with dynamical low-rank approximation and rescaled gradient flow.
result Riemannian gradient descent escapes some spurious critical points on the boundary of the manifold.

We consider numerical integrators of ODEs on homogeneous spaces (spheres, affine spaces, hyperbolic spaces). Homogeneous spaces are equipped with a built-in symmetry. A numerical integrator respects this symmetry if it is equivariant. One obtains homogeneous space integrators by combining a Lie group integrator with an…

2014-02-27abs ↗pdf ↗

Moduli spaces of semi-stable real and quaternionic vector bundles of a fixed topological type admit a presentation as Lagrangian quotients, and can be embedded into the symplectic quotient corresponding to the moduli variety of semi-stable holomorphic vector bundles of fixed rank and degree on a smooth complex projecti…

2011-09-23abs ↗pdf ↗

The paper presents two schemes for sampling matrices from specific distributions on a manifold.

problem Sampling matrices from Gibbs distributions on the manifold of positive semi-definite matrices with fixed rank.
method Two explicit schemes based on Euler-Maruyama discretization of the Riemannian Langevin equation with Brownian motion on the manifold.
result Numerical validation of the schemes using specific energy functions and metrics.

Paper proposes a new algorithm for graph learning with covariance constraints.

problem Graphical models and factor analysis not jointly leveraged in graph learning processes.
method Penalized maximum likelihood estimation of an elliptical distribution with Riemannian optimization.
result Effectiveness of the proposed approach demonstrated on real-world data sets.

Recent advances in neuroscience and in the technology of functional magnetic resonance imaging (fMRI) and electro-encephalography (EEG) have propelled a growing interest in brain-network clustering via time-series analysis. Notwithstanding, most of the brain-network clustering methods revolve around state clustering an…

2019-06-05abs ↗pdf ↗

Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matri…

2018-04-17abs ↗pdf ↗

New algorithm reduces rank constrained optimization problems.

problem Rank constrained optimization problems in machine learning and statistics.
method Recursive Importance Sketching (RISRO) algorithm.
result RISRO offers clear advantages over existing algorithms and converges efficiently.

In higher dimensions, Schottky spaces have unique topological properties.

problem Characterize the topology of Schottky spaces in higher dimensions.
method Analyzing the fundamental group and homotopy properties of Schottky spaces in the borderline dimension.
result In the borderline dimension, the space is simply connected but has a dense open part with fundamental group a product of cyclic groups of order two.

Study of correlated Wigner matrices with BBP transitions.

problem Understanding spectral transitions in correlated Wigner matrices.
method Analyzes a Wigner-type matrix with row/column correlations, decomposes into bulk and outliers, and uses integral operators to model transitions.
result Correlated Wigner matrices exhibit multiple BBP transitions at critical points.

This paper studies geodesics between covariance matrices of different ranks using the Bures-Wasserstein metric.

problem Geodesics between covariance matrices of varying ranks.
method Analyzes the Bures-Wasserstein distance on covariance matrices, completing previous work on geodesics and providing explicit formulas.
result The set of all minimizing geodesics between two covariance matrices is parametrized by a closed unit ball in R(kr)imes(lr)\mathbb{R}^{(k-r) imes(l-r)}.

The stringent requirements for low-latency and privacy of the emerging high-stake applications with intelligent devices such as drones and smart vehicles make the cloud computing inapplicable in these scenarios. Instead, edge machine learning becomes increasingly attractive for performing training and inference directl…

2018-12-31abs ↗pdf ↗

This thesis enhances ML reliability by selectively abstaining from predictions when uncertain.

problem Improving reliability in machine learning systems, especially in high-stakes domains.
method Exploiting uncertainty signals from training trajectories to develop lightweight, post-hoc abstention methods compatible with differential privacy.
result A robust trajectory-based approach to selective prediction that maintains high accuracy under privacy noise.

Develops new approach to recover CR structures from their Levi foliations.

problem Recovering CR structures from their Levi foliations for nonregular symbols.
method Reduction to dynamical Legendrian contact structure on leaf space.
result New geometric interpretation of CR prolongation conditions.

In this paper, we introduce a new geometric description of the manifolds of matrices of fixed rank. The starting point is a geometric description of the Grassmann manifold Gr(Rk)\mathbb{G}_r(\mathbb{R}^k) of linear subspaces of dimension r<kr<k in Rk\mathbb{R}^k which avoids the use of equivalence classes. The set $\mathbb{…

2017-05-11abs ↗pdf ↗