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

4183124165 · Jun 202019922001200920172026
48 results for projection matrices

Random projections help in representing sparse graphs efficiently.

problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.

The paper defines projective structures for Lie bialgebras and Poisson-Lie groups.

problem Defining projective analogues of Lie bialgebras and Poisson-Lie groups.
method Introducing projective tensor products and adapting classical notions to these structures.
result Every quasi-triangular projective r-matrix gives rise to a projective Banach Lie bialgebra.

Paper studies binary random projections with controllable sparsity patterns for computational and accuracy advantages.

problem Improving computational efficiency and accuracy in random projections.
method Proposes two sparse binary projection models with controllable sparsity patterns.
result Significant computational advantages and improved accuracies in empirical evaluations.

New framework solves low-rank optimization problems to certifiable optimality.

problem Low-rank optimization problems with certifiable solutions.
method Mixed-Projection Conic Optimization framework using symmetric projection matrices and outer-approximation algorithms.
result Solves low-rank problems to certifiable optimality, outperforming existing methods.

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.

Method estimates M-matrices in graphical models with improved accuracy.

problem Estimating M-matrices as precision matrices in Gaussian graphical models.
method Adaptive multiple-stage estimation method solving weighted ℓ1-regularized problems.
result Method outperforms state-of-the-art methods in precision matrix estimation and graph edge identification.

The paper explores totally geodesic submanifolds in SPD matrices and their properties.

problem Characterizing and understanding totally geodesic submanifolds in SPD matrices.
method Detailed geometric analysis and projection properties of SPD matrices.
result A non-linear projection on totally geodesic submanifolds has the minimizing property.

Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is…

2013-10-22abs ↗pdf ↗

Free Random Projection enhances reinforcement learning by naturally incorporating hierarchical structure.

problem Improving reinforcement learning algorithms for better generalization and adaptability.
method Introduces Free Random Projection, a method that uses free probability theory to create random orthogonal matrices encoding hierarchical structure.
result Empirically shows consistent improvement in generalization over standard methods on multi-environment benchmarks.

The projective shape of a configuration of k points or "landmarks" in RP(d) consists of the information that is invariant under projective transformations and hence is reconstructable from uncalibrated camera views. Mathematically, the space of projective shapes for these k landmarks can be described as the quotient sp…

2016-02-13abs ↗pdf ↗

Flora uses random projections to achieve high-rank updates with low memory usage.

problem Excessive memory usage in large neural networks during training.
method Flora approximates LoRA using random projections to enable high-rank updates with sublinear space complexity.
result Flora achieves high-rank updates with significantly reduced memory usage compared to LoRA.

Let X be a nonsingular simply connected projective variety of dimension m, E a rank n vector bundle on X, and L a line bundle on X. Suppose that S2(E)LS^2(E^{*}) \otimes L is an ample vector bundle and that there is a constant even rank r2r \ge 2 symmetric bundle map EELE \to E^{*} \otimes L. We prove that mnrm \le n-r. We u…

1996-11-20abs ↗pdf ↗

Deep Jump Gaussian Processes model high-dimensional piecewise functions.

problem Modeling high-dimensional piecewise continuous functions with limited accuracy.
method Integrates region-specific locally linear projections with Jump Gaussian Processes (JGP) to capture local low-dimensional subspace structures.
result DJGP achieves superior predictive accuracy and more reliable uncertainty quantification compared to existing methods.

The fields of compressed sensing (CS) and matrix completion have shown that high-dimensional signals with sparse or low-rank structure can be effectively projected into a low-dimensional space (for efficient acquisition or processing) when the projection operator achieves a stable embedding of the data by satisfying th…

2012-09-14abs ↗pdf ↗

A new method prioritizes project risks using Monte Carlo Simulation.

problem Determining the relative importance of project risks.
method Monte Carlo Simulation (MCS) for quantitative prioritization.
result Differentiates critical risks based on their impact on project duration and cost.

Convex optimization method recovers low-rank matrices from rank-one projections efficiently.

problem Recovering low-rank matrices from limited rank-one projections.
method Unlifted convex optimization with subgradient method.
result The estimator succeeds with high probability if the number of measurements exceeds r2(d1+d2)r^2 (d_1+d_2) up to logarithmic factors.

A new method for group invariant machine learning using geometric projections.

problem Supervised group invariant and equivariant machine learning.
method Geometric topology approach involving projection of input data into a geometric space parametrizing symmetry group orbits.
result Improvement in accuracy compared to existing methods.

This paper is a next step in the project of systematic description of colored knot and link invariants started in previous papers. In this paper, we managed to explicitly find the inclusive Racah matrices, i.e. the whole set of mixing matrices in channels R1R2R3QR_1\otimes R_2\otimes R_3\longrightarrow Q with all possible $…

2018-01-29abs ↗pdf ↗

Paper develops methods for non-quadratic loss low-rank matrix recovery.

problem Recovery of low-rank matrices with non-quadratic losses.
method Projected gradient method with a regularity projection oracle.
result Projected gradient method converges globally and linearly.

Develops precise expressions for random projections for better machine learning tasks.

problem Improving the accuracy of dimensionality reduction in machine learning tasks.
method Exploits recent developments in spectral analysis of random matrices to derive accurate expressions for random projection matrices.
result Provides precise expressions that reflect the practical performance of sketching methods, including Gaussian and Rademacher sketches.

FedSPDnet improves federated learning for SPD matrices, outperforming existing methods.

problem Federated learning for SPD matrices with orthogonality constraints.
method Two efficient aggregation strategies: ProjAvg and RLAvg, preserving geometric structure.
result FedSPDnet outperforms federated EEGnet in F1 score and robustness to federation and partial participation.

A Hermitian TQFT from non-semisimple quantum sl(2) modules.

problem Constructing a Hermitian TQFT from a non-semisimple category.
method Endowed a non-semisimple category of quantum sl(2) modules with a Hermitian structure and proved the resulting TQFT is Hermitian.
result Projective representations of the mapping class group in indefinite unitary matrices.

After recalling the notion of caustics of plane curves and basic equations, we first show the birationality of the caustic map for a general source point S in the plane. Then we prove more generally a theorem for curves D in the projective space of 3x3 symmetric matrices B. For a general 3x1 vector S the projection to …

2013-04-13abs ↗pdf ↗

Accelerates Birkhoff projection for manifold-constrained hyper-connections with high accuracy and speed.

problem Inaccurate and slow Birkhoff projection in mHC implementations.
method Dual formulation, Newton's method, implicit differentiation, warp-level CUDA kernel.
result Substantial speedups and accuracy improvements in doubly stochastic projections.

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of the nuclear norm over the spectral norm. The presented bound has i…

2014-03-30abs ↗pdf ↗

The vast majority of current machine learning algorithms are designed to predict single responses or a vector of responses, yet many types of response are more naturally organized as matrices or higher-order tensor objects where characteristics are shared across modes. We present a new machine learning algorithm BaTFLE…

2016-12-09abs ↗pdf ↗

The fundamental group of every surface that is not the projective plane or Klein bottle has a representation to a torsion-free group of upper-triangular matrices in SL(2,R) with no simple loop (i.e. a nontrivial element representing a simple closed curve) in the kernel.

2017-04-04abs ↗pdf ↗

Study exact limits of matrix reconstruction from noisy projections.

problem Reconstructing matrices from linear projections with high-dimensional data.
method Asymptotic analysis, universality properties, and generalized linear models.
result Exact asymptotic equations for optimal learning performance.

Density matrices are positively semi-definite Hermitian matrices with unit trace that describe the states of quantum systems. Many quantum systems of physical interest can be represented as high-dimensional low rank density matrices. A popular problem in {\it quantum state tomography} (QST) is to estimate the unknown l…

2016-10-16abs ↗pdf ↗

This paper is a next step in the project of systematic description of colored knot polynomials started in arXiv:1506.00339. In this paper, we managed to explicitly find the inclusive\textit{inclusive} Racah matrices, i.e. the whole set of mixing matrices in channels R3QR^{\otimes 3}\longrightarrow Q with all possible QQ, for …

2016-11-11abs ↗pdf ↗

As a typical dimensionality reduction technique, random projection can be simply implemented with linear projection, while maintaining the pairwise distances of high-dimensional data with high probability. Considering this technique is mainly exploited for the task of classification, this paper is developed to study th…

2013-12-12abs ↗pdf ↗

We model how Lipschitz continuity changes during neural network training.

problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.

The paper tackles learning varying DAG structures based on contextual features.

problem Learning a single DAG for the entire population from observational data.
method A neural network that maps contextual features to a weighted adjacency matrix of a DAG, with a projection layer to ensure acyclicity.
result The new approach can recover context-specific DAGs where existing methods fail.

Efficiently solves heterogeneous QPs by reducing variables using instance-specific projections.

problem Solving high-dimensional quadratic programming problems efficiently.
method Data-driven framework with a graph neural network generating projections tailored to each QP instance.
result Produces high-quality solutions with reduced computation time, outperforming existing methods.