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

131263394525 · Jun 202019922001200920172026
48 results for gradient mapping

Maps and measures on surfaces link best Lipschitz and least gradient functions.

problem Analyzing maps between surfaces and their geometric properties.
method Duality between best Lipschitz and least gradient maps, geodesic laminations, and transverse measures.
result The infinity harmonic map defines a geodesic lamination and the least gradient map defines a transverse measure.

Study on p-biharmonic maps from gradient Ricci solitons, focusing on 2D cigar soliton.

problem Understanding p-biharmonic maps on gradient Ricci solitons.
method Analyzing p-biharmonic maps from gradient Ricci solitons, specifically 2D cigar soliton.
result Obtained results on p-biharmonic maps from gradient Ricci solitons, particularly on 2D cigar soliton.

Local constancy of index for certain gradient mappings proved.

problem Proving the local constancy of the index for specific gradient mappings.
method Using a more general theorem for quasiregular gradient mappings, deducing the result from the Hessian's properties.
result The index is locally constant for C1,1C^{1,1} functions with uniformly positive determinant Hessian almost everywhere.

In this paper, we first obtain an LqL^q gradient estimate for pp-harmonic maps, by assuming the target manifold supporting a certain function, whose gradient and Hessian satisfy some analysis conditions. From this LqL^q gradient estimate, we get a corresponding Liouville type result for pp-harmonic maps. Secondly, us…

2019-12-28abs ↗pdf ↗

Riemannian stochastic gradient descent approximates a diffusion process called Riemannian stochastic modified flow.

problem Improving convergence rate of Riemannian stochastic gradient descent.
method Using stochastic differential geometry, the paper shows RSGD can be approximated by the Riemannian stochastic modified flow (RSMF).
result RSGD can be approximated by the solution to the RSMF driven by an infinite-dimensional Wiener process, increasing the order of approximation.

Method generates time-series attribution maps with identifiability guarantees.

problem Lack of identifiability guarantees in gradient-based attribution methods.
method Regularized contrastive learning algorithm trained on time-series data.
result Empirically shows robust approximation of zero vs. non-zero entries in the ground-truth attribution map.

In this paper, we will show the Yau's gradient estimate for harmonic maps into a metric space (X,dX)(X,d_X) with curvature bounded above by a constant κκ, κ0κ\geq0, in the sense of Alexandrov. As a direct application, it gives some Liouville theorems for such harmonic maps. This extends the works of S. Y. Cheng [4] and H.…

2017-11-14abs ↗pdf ↗

We present a proof due to Duistermaat that the gradient flow of the norm squared of the moment map defines a deformation retract of the appropriate piece of the manifold onto the zero level set of the moment map. Duistermaat's proof is an adaptation of Lojasiewicz's argument for analytic functions to functions which ar…

2004-10-27abs ↗pdf ↗

For stationary harmonic maps between Riemannian manifolds, we provide a necessary and sufficient condition for the uniform interior and boundary gradient estimates in terms of the total energy of maps. We also show that if analytic target manifolds do not carry any harmonic S^2, then the singular sets of stationary map…

1999-05-01abs ↗pdf ↗

Given a Kähler manifold (Z,J,ω)(Z,J,ω) and a compact real submanifold MZM\subset Z, we study the properties of the gradient map associated with the action of a noncompact real reductive Lie group G{\rm G} on the space of probability measures on M.M. In particular, we prove convexity results for such map when G{\rm G} is A…

2017-01-17abs ↗pdf ↗

Gradient maps of real reductive group actions on manifolds studied.

problem Analyzing gradient maps of real reductive group actions on manifolds.
method Examined gradient maps μpμ_{\mathfrak{p}} on submanifolds XX of ZZ.
result Gradient flow of ff has a unique limit and critical points in the same orbit belong to the same KK-orbit.

Study on semistable points and convexity of gradient maps for group actions.

problem Analyzing semistable points and convexity in group actions.
method Examining a real reductive group action on a Kahler manifold with Hamiltonian properties.
result Openness and connectedness of semistable points, convexity theorems for GG-action and two-orbit variety.

Improved Liouville theorems for ancient solutions to V-harmonic map heat flows.

problem Establishing Liouville theorems for ancient solutions to V-harmonic map heat flows.
method Refined gradient estimates and exponential growth conditions.
result Better Liouville theorems for ancient solutions to V-harmonic map heat flows.

This study proves the local existence of a symplectic gradient flow on a flat torus.

problem Proving the local existence of a symplectic gradient flow on a flat torus.
method Using a moment map and a DeTurck trick to make the flow strictly parabolic and showing local existence and regularity.
result The group of symplectomorphisms of the real four-dimensional torus is locally contractible.

The Liouville theorem is proven for harmonic maps from a specific type of manifold.

problem Proving Liouville theorem for harmonic maps from a special class of manifolds.
method Gradient estimate and Liouville theorem for harmonic maps from Kasue manifolds.
result Liouville theorem is proven for harmonic maps from Kasue manifolds.

The study reveals simplicity bias in neural networks leading to better compositional mappings.

problem Understanding when and how to encourage neural networks to learn compositional mappings.
method Examined compositional mappings through coding length and gradient descent dynamics.
result Neural networks tend to learn the simplest bijections, explaining their good generalization.

Explaining the output of a deep network remains a challenge. In the case of an image classifier, one type of explanation is to identify pixels that strongly influence the final decision. A starting point for this strategy is the gradient of the class score function with respect to the input image. This gradient can be …

2017-06-12abs ↗pdf ↗

Forest tree species mapped with high accuracy using satellite data.

problem Classifying dominant tree species in Swedish forests.
method Extreme gradient boosting model with Bayesian optimization, combining Sentinel-1/2 satellite data and field observations.
result Overall accuracy of 85%, F1 score of 0.82, Matthews correlation coefficient of 0.81.

New method uses transport maps for efficient Bayesian inference.

problem Efficiently perform sequential Bayesian inference of static model parameters.
method Estimation of structured transport maps to extract conditional distributions.
result Gradient-based characterization of posterior density for online parameter estimation.

A neural network method tackles high-dimensional diffeomorphic mapping problems.

problem High-dimensional diffeomorphic mapping struggles with the curse of dimensionality.
method Combines variational principles with quasi-conformal theory for accurate, bijective mappings.
result Validated accuracy, robustness, and effectiveness in complex registration scenarios.

In this paper, we present a novel and principled approach to learn the optimal transport between two distributions, from samples. Guided by the optimal transport theory, we learn the optimal Kantorovich potential which induces the optimal transport map. This involves learning two convex functions, by solving a novel mi…

2019-08-28abs ↗pdf ↗

1-Lipschitz neural networks produce clearer, more focused Saliency Maps for explainable AI.

problem Noisy and limited Saliency Maps from traditional neural networks.
method Dual loss of optimal transport problem for 1-Lipschitz neural networks.
result Saliency Maps from 1-Lipschitz networks are highly concentrated and less noisy, aligning with human explanations.

This work establishes properties on diffeological structures for set-valued maps and measures.

problem Establish rigorous properties on diffeological structures for set-valued maps and measures.
method Using diffeologies, the authors link various structures including set-valued maps, relations, gradients, measures, and shape analysis.
result Established rigorous properties on sample diffeologies.

For a Hamiltonian action of a compact group UU of isometries on a compact Kähler manifold ZZ and a compatible subgroup GG of UCU^{\mathbb{C}}, we prove that for any closed GG--invariant subset YZY\subset Z the image of the gradient map μp(Y)μ_{\mathfrak{p}}(Y) is independent of the choice of the invariant Kähler form …

2014-02-07abs ↗pdf ↗

New method creates universal perturbations to fool neural network interpretations.

problem Vulnerability of gradient-based saliency maps to adversarial perturbations.
method Gradient-based optimization and PCA-based approach to create UPI.
result Existence and successful application of Universal Perturbation for Interpretation (UPI).

This work links SOMs and GMMs, providing a mathematical basis for their use.

problem Understanding the relationship between SOMs and GMMs.
method Mathematical treatment showing SOMs as gradient descent on a GMM log-likelihood.
result SOMs can be interpreted as probabilistic models, justifying their use in various applications.

AdaGrad fails to adapt to Hölder-smoothness in composite optimization problems.

problem AdaGrad's convergence rate is suboptimal for composite objectives.
method Exhibited a simple one-dimensional convex problem to highlight AdaGrad's limitations.
result AdaGrad does not achieve the classical convergence rate for Hölder-smooth objectives.

We introduce a new tool for interpreting neural net responses, namely full-gradients, which decomposes the neural net response into input sensitivity and per-neuron sensitivity components. This is the first proposed representation which satisfies two key properties: completeness and weak dependence, which provably cann…

2019-05-02abs ↗pdf ↗

Recently, researchers proposed various low-precision gradient compression, for efficient communication in large-scale distributed optimization. Based on these work, we try to reduce the communication complexity from a new direction. We pursue an ideal bijective mapping between two spaces of gradient distribution, so th…

2019-01-24abs ↗pdf ↗