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 diagonal changes

We define a second-order neural network stochastic gradient training algorithm whose block-diagonal structure effectively amounts to normalizing the unit activations. Investigating why this algorithm lacks in robustness then reveals two interesting insights. The first insight suggests a new way to scale the stepsizes, …

2017-05-25abs ↗pdf ↗

Proposes a method to predict responses from covariates over time.

problem Predicting responses from covariates with changing conditional distributions over time.
method Invariant Subspace Decomposition (ISD) framework that splits the conditional distribution into time-invariant and time-dependent components.
result The decomposition can be used for zero-shot and time-adaptation prediction tasks.

Variational Bayesian neural networks combine the flexibility of deep learning with Bayesian uncertainty estimation. However, inference procedures for flexible variational posteriors are computationally expensive. A recently proposed method, noisy natural gradient, is a surprisingly simple method to fit expressive poste…

2018-11-30abs ↗pdf ↗

Given an nn-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the nn-gon (viewed as a disc with nn marked points on the boundary) with an arbitrary oriented surface with a number of la…

2017-01-06abs ↗pdf ↗

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 ↗

Detects exotic surfaces without smooth invariants, providing first example of knotted RP².

problem Detecting exotic surfaces without smooth invariants.
method Two versions of families (Seiberg-Witten) generalizations of Donaldson's diagonalization theorem.
result First example of exotically knotted RP² with diffeomorphic complements.

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.

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.

Let G be a simply connected, simple, complex Lie group of rank 2. We give explicit Fock-Goncharov coordinates for configurations of triples and quadruples of affine flags in G. We show that the action on triples by orientation preserving permutations corresponds to explicit quiver mutations, and that the same holds for…

2016-05-26abs ↗pdf ↗

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 ↗

We make a minimal, but very effective alteration to the VAE model. This is about a drop-in replacement for the (sample-dependent) approximate posterior to change it from the standard white Gaussian with diagonal covariance to the first-order autoregressive Gaussian. We argue that this is a more reasonable choice to ado…

2019-09-13abs ↗pdf ↗

In this paper we show that the non-alternating torus knots are homologically thick, i.e. that their Khovanov homology occupies at least three diagonals. Furthermore, we show that we can reduce the number of full twists of the torus knot without changing certain part of its homology, and consequently, we show that there…

2005-11-21abs ↗pdf ↗

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.