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

306191121 · Jun 202019922001200920172026
48 results for rank-one update

Improves graph-based active learning for non-Gaussian models.

problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.

Novel algorithm for Markov decision processes using rank-one approximation.

problem Solving planning and learning problems of Markov decision processes.
method Policy iteration with rank-one approximation of transition probability matrix.
result The proposed algorithm consistently outperforms first-order algorithms and their accelerated versions.

This work presents a novel approach to train invertible linear layers by adding rank-one perturbations.

problem Training invertible linear layers during optimization with gradient-based methods is challenging.
method Train rank-one perturbations and add them to weight matrices infrequently, keeping track of inverses and determinants.
result Invertible linear layers improve mixing and mode separation in normalizing flows.

GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an incremental algorithm for identifying a subspace of Rn from a sequence of vectors in this subspace, where only a subset of components of each vector is revealed at each iteration. Recent analysis has shown that GROUSE converges locally at an expected linea…

2013-07-21abs ↗pdf ↗

Gradient descent with growing learning rate enables learning non-linear features in neural networks.

problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.

We obtain the Plancherel theorem for the quotient of a simple Lie group of real rank one by a convex-cocompact discrete subgroup and its consequences for the spectrum of locally invariant differential operators on bundles over Kleinian manifolds. We develop a geometric version of scattering theory. The paper is an upda…

1998-10-26abs ↗pdf ↗

Algorithm recovers factors of rank-1 matrices from noisy measurements.

problem Estimating factors of a rank-1 matrix from nonlinearly transformed and noisy measurements.
method Alternating minimization with random initialization and analysis of empirical error recursion.
result Algorithm converges geometrically fast from random initialization, with sharp guarantees.

A new quasi-Newton method uses cubic regularization to avoid saddle points in deep learning.

problem Avoiding saddle points and poor local minima in deep learning models.
method Limited-memory symmetric rank-one quasi-Newton approach with adaptive regularized cubics.
result The method effectively avoids saddle points and converges to better local minima.

We develop a notion of rank one properly convex domains (or Hilbert geometries) in the real projective space. This is in the spirit of rank one non-positively curved Riemannian manifolds and CAT(0) spaces. We define rank one isometries for Hilbert geometries and characterize them as being equivalent to contracting elem…

2019-12-30abs ↗pdf ↗

The study establishes uncertainty principles on harmonic manifolds of rank one.

problem Developing uncertainty principles for harmonic manifolds of rank one.
method Derivation of various uncertainty principles including Heisenberg, Morgen, Schrödinger, and Hömanders principles.
result Generalization of Hausdorff-Young inequality to harmonic manifolds of rank one.

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is mo…

2018-01-31abs ↗pdf ↗

Improved stability for matrix recovery from rank-one measurements.

problem Phase retrieval problem of recovering rank-one positive semidefinite matrices.
method Developed a smoothing Newton method based on Bures-Wasserstein gradient descent.
result Superlinear convergence with rigorous guarantees and stable implementation.

Compact rank one symmetric spaces are rigid under certain curvature conditions.

problem Rigidity of compact rank one symmetric spaces under curvature constraints.
method Examined compact symmetric spaces with metric g0g_0 of rank one, and another metric gg with sectional curvature bounded by 0 to 1.
result If gg equals g0g_0 outside a convex subset, then gg is isometric with g0g_0.

This paper proposes a boosting-based solution addressing metric learning problems for high-dimensional data. Distance measures have been used as natural measures of (dis)similarity and served as the foundation of various learning methods. The efficiency of distance-based learning methods heavily depends on the chosen d…

2015-12-10abs ↗pdf ↗

Stochastic Rank-One Bandits (Katarya et al, (2017a,b)) are a simple framework for regret minimization problems over rank-one matrices of arms. The initially proposed algorithms are proved to have logarithmic regret, but do not match the existing lower bound for this problem. We close this gap by first proving that rank…

2019-12-06abs ↗pdf ↗

In this paper, based on research on rank-one isometries by W.Ballmann and M.Brin and recent research on rank-one isometries of Coxeter groups by P.Caprace and K.Fujiwara, we study a topological fractal structure of boundaries of Coxeter groups. We also show that the limit-point set is dense in a boundary of a Coxeter g…

2009-12-01abs ↗pdf ↗

Study shows generative priors improve rank-one matrix recovery with optimal sample complexity.

problem Recovering a rank-one signal matrix from noisy data with additional prior information.
method Analysis of a nonlinear least squares objective with a favorable global optimization landscape.
result Established optimal sample complexity for generative priors in rank-one matrix recovery.

The paper analyzes tensor recovery from symmetric rank-one measurements using information theory.

problem Recovering tensors with low symmetric rank from symmetric rank-one measurements.
method Covering numbers argument, Carbery-Wright inequality, orthogonal polynomials, Fano's inequality.
result Near-optimal sample complexity bounds for log-concave distributions.

Gradient descent solves rank-one matrix estimation problem with detailed time evolution analysis.

problem Estimating a rank-one symmetric matrix corrupted by noise.
method Gradient descent on a sphere, using local versions of the semi-circle law.
result Explicit formulas for the time evolution of the estimator and cost function, revealing phase transitions.

We give examples of rank one compact surfaces on which there exist recurrent geodesics that cannot be shadowed by periodic geodesics. We build rank one compact surfaces such that ergodic measures on the unit tangent bundle of the surface are not dense in the set of probability measures invariant by the geodesic flow. F…

2010-04-29abs ↗pdf ↗