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

106213319425 · Jun 202019922001200920172026
48 results for gradient tensor

The paper shows how gradient flow on over-parametrized tensor decomposition behaves like deflation.

problem Understanding the training dynamics of gradient flow on tensor decomposition.
method Empirical observation and mathematical proof of gradient flow dynamics for orthogonally decomposable tensors.
result Gradient flow dynamics for orthogonally decomposable tensors follows a tensor deflation process, recovering all tensor components.

This paper classifies solitons under specific tensor conditions.

problem Classifying solitons under vanishing conditions on the Weyl, Cotton, and Cao-Chen tensors.
method Analyzing complete conformal gradient solitons and using tensor conditions.
result Classification of complete nontrivial locally conformally flat conformal gradient solitons.

We propose gradient adversarial training, an auxiliary deep learning framework applicable to different machine learning problems. In gradient adversarial training, we leverage a prior belief that in many contexts, simultaneous gradient updates should be statistically indistinguishable from each other. We enforce this c…

2018-06-21abs ↗pdf ↗

Study on gradient ρ-Einstein solitons with radially nonnegative Bach tensor.

problem Characterizing gradient ρ-Einstein solitons with specific tensor properties.
method Analyzing the properties of Bach tensor and using local warping to classify solitons.
result Gradient ρ-Einstein solitons with radially nonnegative Bach tensor are locally warped products of an interval and an Einstein manifold.

Gradient descent in tensor factorization favors low-rank solutions.

problem Tackling implicit regularization in tensor factorization problems.
method Gradient descent with small random initialization for overparametrized tensor factorization.
result Gradient descent leads to implicit regularization towards low tubal rank solutions.

New classification of gradient steady Ricci solitons with vanishing D-tensor.

problem Classifying gradient steady Ricci solitons with specific properties.
method Extending Cao-Chen's work on Bach-flat gradient Ricci solitons, proving properties for DD-flat solitons.
result Any nn-dimensional complete noncompact gradient steady Ricci soliton with vanishing DD-tensor is either Ricci-flat or isometric to the Bryant soliton.

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of…

2019-06-04abs ↗pdf ↗

ScaledGD algorithm estimates low-rank tensors efficiently from corrupted data.

problem Estimating meaningful information from corrupted tensor data.
method Scaled gradient descent (ScaledGD) algorithm with tailored spectral initializations.
result ScaledGD achieves linear convergence at a constant rate independent of condition number.

Gradient flows for surface energies with tensor fields are derived and analyzed.

problem Deriving consistent gradient flows for surface energies involving tensor fields.
method Introducing different gauges of surface independence and demonstrating their effects on energy decrease.
result Consistent choice of gauge and time derivative is necessary for energy decrease.

Study classifies gradient almost Ricci solitons with harmonic Weyl tensor.

problem Characterizing the local structure of gradient almost Ricci solitons with harmonic Weyl tensor.
method Local representation as multiply warped products, analysis of eigenvalues, and classification based on Weyl tensor properties.
result Classification of gradient almost Ricci solitons with harmonic Weyl tensor, extending previous results.

This paper derives new identities for the Weyl tensor on a gradient Ricci soliton, particularly in dimension four. First, we prove a Bochner-Weitzenböck type formula for the norm of the self-dual Weyl tensor and discuss its applications, including connections between geometry and topology. In the second part, we are co…

2013-11-04abs ↗pdf ↗

Gradient descent can find better tensor decompositions than lazy training in over-parameterized settings.

problem Finding better tensor decompositions in over-parameterized settings.
method Gradient descent on over-parameterized tensor decomposition problems.
result Gradient descent can find an approximate tensor decomposition with rank m=O(r2.5llogd)m = O^*(r^{2.5l}\log d), while lazy training requires m=Ω(dl1)m = Ω(d^{l-1}).

Tensor decomposition, a collection of factorization techniques for multidimensional arrays, are among the most general and powerful tools for scientific analysis. However, because of their increasing size, today's data sets require more complex tensor decomposition involving factorization with multiple matrices and dia…

2019-05-24abs ↗pdf ↗

New tensor formulation reveals gradient flow's bias in linear neural networks.

problem Understanding implicit bias in linear neural network training.
method Tensor formulation of neural networks, including fully-connected, diagonal, and convolutional networks.
result Gradient flow on linear tensor networks converges to solutions of specific optimization problems.

New findings on shrinking Ricci solitons with vanishing Bach-like tensors.

problem Characterizing gradient shrinking Ricci solitons with vanishing Bach-like tensors.
method Defining and analyzing Bach-like tensors, proving rigidity results, and deriving variational formulas.
result Vanishing Bach-like tensors force solitons to be either Einstein or isometric to the Gaussian soliton.

The study examines perfect fluid spacetimes and their properties.

problem Characterizing properties of perfect fluid spacetimes with concircular vector fields.
method Analyzing the conformal curvature tensor, state equation, and solitons in perfect fluid spacetimes.
result Perfect fluid spacetimes with concircular vector fields have specific properties related to the state equation and solitons.

We show that the only complete shrinking gradient Ricci solitons with vanishing Weyl tensor are quotients of the standard ones. This gives a new proof of the Hamilton-Ivey-Perel'man classification of 3-dimensional shrinking gradient solitons. We also prove a classification for expanding gradient Ricci solitons with con…

2007-12-08abs ↗pdf ↗

This paper solves tensor robust principal component analysis via scaled gradient descent.

problem Extracting useful information from tensor data robust to corruptions and ill-conditioning.
method Directly recovers low-rank tensor factors via scaled gradient descent with adaptive thresholding.
result The proposed algorithm converges linearly to the true low-rank tensor at a constant rate independent of the condition number.

We classify complete gradient Ricci solitons satisfying a fourth-order vanishing condition on the Weyl tensor, improving previously known results. More precisely, we show that any nn-dimensional (n4n\geq 4) gradient shrinking Ricci soliton with fourth order divergence-free Weyl tensor is either Einstein, or a finite q…

2016-02-01abs ↗pdf ↗

We prove that a gradient shrinking Ricci soliton with fourth order divergence-free Riemannian tensor is rigid. For the 44-dimensional case, we show that any gradient shrinking Ricci soliton with fourth order divergence-free Riemannian tensor is either Einstein, or a finite quotient of the Gaussian shrinking soliton $\…

2017-05-27abs ↗pdf ↗

NNEinFact fits any nonnegative tensor factorization quickly and accurately.

problem Limited user-friendly tools for fitting tailored nonnegative tensor factorizations.
method NNEinFact is an einsum-based multiplicative update algorithm that fits any nonnegative tensor factorization.
result NNEinFact converges to a stationary point of the loss, supports missing data, and fits tensors with hundreds of millions of entries in seconds.

New tensor recovery method improves efficiency under strict complementarity.

problem Efficiently recovering low-rank tensors using tensor nuclear norm.
method Developed strict complementarity condition for tensor nuclear norm ball and applied to gradient methods.
result Standard gradient methods achieve linear convergence and nearly linear runtime under strict complementarity.

We present a new method for online prediction and learning of tensors (NN-way arrays, N>2N >2) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor decompositions proposed in [1]. In this framework it is possible to treat 3-D tensors …

2015-07-28abs ↗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 ↗

Study rigidifies geometry of electrostatic systems with specific tensor properties.

problem Investigating rigidity in electrostatic systems with specific tensor properties.
method Analyzing static Einstein--Maxwell spacetimes with harmonic (anti-)self-dual Weyl tensor.
result Gradient of lapse function is an eigenvector of Ricci tensor and manifold is locally conformally flat.

Guaranteed convergence for tensor factorization using Riemannian gradient descent.

problem Recovering tensor train format from linear measurements.
method Optimization over left-orthogonal TT format using Riemannian gradient descent on Stiefel manifold.
result RGD converges linearly to the ground-truth tensor with polynomial error growth in tensor order.

New algorithm completes nonnegative tensors with fewer samples and faster convergence.

problem Tensor completion tension between sample complexity and computational complexity.
method Integer programming and Blended Conditional Gradients algorithm.
result Achieves information-theoretic sample complexity rate with practical convergence.

A new metric tensor improves Riemann manifold Monte Carlo for Bayesian models.

problem Improving sampling efficiency in Bayesian hierarchical models.
method Metric tensor derived from log-density gradient covariance matrices.
result Metric tensors enhance sampling for complex Bayesian models.

The paper extends gradient flow and relaxation studies to non-flat Riemannian manifolds.

problem Understanding gradient flows and relaxation in non-flat Riemannian manifolds.
method Developed a criterion for comparing relaxation along gradient descent curves using non-metricity tensor.
result Revealed a universal asymmetry: warming up is faster than cooling down.