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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for diagonal move

Researchers find explicit Bäcklund transforms for specific quadrics.

problem Isometric deformations of diagonal higher dimensional quadrics without center.
method Explicitly found Bäcklund transforms using the Bianchi Permutability Theorem and 3-moving Möbius configuration.
result Explicit solutions can be iterated with arbitrary constants.

We construct new classes of exact solutions of the 4D vacuum Einstein equations which describe ellipsoidal black holes, black tori and combined black hole -- black tori configurations. The solutions can be static or with anisotropic polarizations and running constants. They are defined by off--diagonal metric ansatz wh…

2001-11-19abs ↗pdf ↗

A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of…

2019-09-04abs ↗pdf ↗

Stochastic gradient descent (\textsc{Sgd}) methods are the most powerful optimization tools in training machine learning and deep learning models. Moreover, acceleration (a.k.a. momentum) methods and diagonal scaling (a.k.a. adaptive gradient) methods are the two main techniques to improve the slow convergence of \text…

2018-10-01abs ↗pdf ↗

ADAHESSIAN optimizes machine learning models with adaptive second-order methods.

problem Efficiently optimizing machine learning models with second-order methods.
method Dynamic Hessian estimation via adaptive estimates, incorporating fast approximations and moving averages.
result ADAHESSIAN achieves state-of-the-art performance across various tasks.

Diagonal linear networks converge to lasso regularization path during training.

problem Understanding the regularization behavior of diagonal linear networks.
method Analyzing the training trajectory of diagonal linear networks and comparing it to the lasso regularization path.
result The training trajectory of diagonal linear networks is closely related to the lasso regularization path.

We show that a basis of a semisimple Lie algebra of compact type, for which any diagonal left-invariant metric has a diagonal Ricci tensor, is characterized by the Lie algebraic condition of being "nice". Namely, the bracket of any two basis elements is a multiple of another basis element. This extends the work of Laur…

2019-12-29abs ↗pdf ↗

Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.

problem Determine grid homology of diagonal knots and compare them to other knot types.
method Use grid diagrams and combinatorial knot Floer homology to analyze diagonal knots.
result Grid homology detects the number of prime factors and decompositions of the knot into non-integer tangles.

The paper analyzes ridge regression with random features for non-identically distributed data.

problem Analyzing ridge regression performance for data with heterogeneous variance profiles.
method Combining linear-plus-chaos approximation and operator-valued free probability.
result Derives asymptotic equivalents for training and test risks under non-identically distributed data.

Study on stability of non-diagonal Einstein metrics on specific homogeneous spaces.

problem Stability analysis of non-diagonal Einstein metrics on HimesH/ΔKH imes H/ΔK.
method Formula for scalar curvature, study of stability with Hilbert action.
result Non-diagonal Einstein metrics on MM are unstable with different coindexes.

Adaptive gradient approaches that automatically adjust the learning rate on a per-feature basis have been very popular for training deep networks. This rich class of algorithms includes Adagrad, RMSprop, Adam, and recent extensions. All these algorithms have adopted diagonal matrix adaptation, due to the prohibitive co…

2019-05-26abs ↗pdf ↗

Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.

problem Subspace clustering with block diagonal structure for noisy data.
method ABDR explicitly pursues block diagonality without sacrificing convexity, using a specially designed convex regularizer.
result Experimental results show ABDR outperforms state-of-the-arts.

The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal separation. We consider the diagonalization criterion studied in a seminal paper by Pham (…

2018-11-28abs ↗pdf ↗

We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analogy with the extrinsic geometric properties of strata in the Weil-Petersson completion. As a consequence, we exhibit convex flat subgraphs of every possible rank inside the diagonal pants graph.

2011-11-04abs ↗pdf ↗

Classify projective subvarieties in Bogomolov-Guan manifolds using quasi-diagonals.

problem Classify projective subvarieties in non-Kahler holomorphically symplectic manifolds.
method Use quasi-diagonals to classify projective subvarieties.
result Prove that any projective subvariety belongs to a fiber of the Lagrangian fibration.

In this paper, we study deep diagonal circulant neural networks, that is deep neural networks in which weight matrices are the product of diagonal and circulant ones. Besides making a theoretical analysis of their expressivity, we introduced principled techniques for training these models: we devise an initialization s…

2019-01-29abs ↗pdf ↗

The main purpose of this note is to prove that any basis of a nilpotent Lie algebra for which all diagonal left-invariant metrics have diagonal Ricci tensor necessarily produce quite a simple set of structural constants; namely, the bracket of any pair of elements of the basis must be a multiple of some of them and onl…

2011-10-18abs ↗pdf ↗

SignSGD analysis quantifies its effects in high dimensions.

problem Understanding signSGD's effects in high-dimensional settings.
method High-dimensional analysis of signSGD, deriving SDE and ODE for risk.
result Quantification of signSGD's effects: effective learning rate, noise compression, diagonal preconditioning, gradient noise reshaping.

New method improves deep learning model robustness and accuracy for long sequences.

problem Challenges in learning long-range sequence tasks using state-space models.
method Proposes a perturb-then-diagonalize (PTD) methodology to address ill-posed diagonalization problems in SSMs.
result Demonstrates improved robustness and accuracy of S5-PTD model on Long-Range Arena benchmark.

We give a quadratic lower bound on the dimension of the space of conjugacy classes of subgroups of SL(n,R) that are limits under conjugacy of the diagonal subgroup. We give the first explicit examples of abelian n-1 dimensional subgroups of SL(n,R) which are not such a limit, however all such abelian groups are limits …

2014-12-17abs ↗pdf ↗

Diagonal metrics solve Hermitian-Einstein equations for decomposed Higgs bundles.

problem Existence of diagonal pluriharmonic metrics in GG-Higgs bundles.
method Analyzes Higgs bundles over compact Kähler manifolds, decomposes vector bundles, and uses torus action to relate stability and conditions.
result Necessary and sufficient conditions for the existence of diagonal metrics solving Hermitian-Einstein equations.

We formulate an approach to the geometry of Riemann-Cartan spaces provided with nonholonomic distributions defined by generic off-diagonal and nonsymmetric metrics inducing effective nonlinear and affine connections. Such geometries can be modelled by moving nonholonomic frames on (pseudo) Riemannian manifolds and desc…

2008-06-24abs ↗pdf ↗

In this paper, we propose a new Recurrent Neural Network (RNN) architecture. The novelty is simple: We use diagonal recurrent matrices instead of full. This results in better test likelihood and faster convergence compared to regular full RNNs in most of our experiments. We show the benefits of using diagonal recurrent…

2017-04-18abs ↗pdf ↗