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

64127191254 · Jun 202019922001200920172026
48 results for naturality

Study quantifies firm risks from nature decline, showing significant equity losses.

problem Estimating the financial impact of nature deterioration on companies.
method Developed metrics (Country Degradation Index, Nature Risk Score) and assessed five environmental hazards.
result Global equities lose 26.8% in a nature decline scenario, with worst firms losing 75%.

When a gauge-natural invariant variational principle is assigned, to determine {\em canonical} covariant conservation laws, the vertical part of gauge-natural lifts of infinitesimal principal automorphisms -- defining infinitesimal variations of sections of gauge-natural bundles -- must satisfy generalized Jacobi equat…

2004-06-04abs ↗pdf ↗

A new method for classifying naturally reductive spaces is presented. This method relies on the structure theory of naturally reductive spaces developed in \cite{Storm2018a} and the new construction of naturally reductive spaces in \cite{Storm2018}. We obtain the classification of all naturally reductive spaces in dime…

2018-10-08abs ↗pdf ↗

Defines and proves the uniqueness of a second natural connection on Riemannian Π-manifolds.

problem Characterizing and proving uniqueness of a natural connection on Riemannian Π-manifolds.
method Definition and proof of the second natural connection, proving its uniqueness and necessary/sufficient condition for coincidence with the first natural connection.
result Proves the uniqueness of the second natural connection on Riemannian Π-manifolds.

New definition of naturally reductive Finsler manifolds using geodesic graphs.

problem Defining naturally reductive Finsler manifolds using geodesic graphs.
method Proposed a new geometrical definition using geodesic graphs and constructed examples of Finsler metrics.
result Explicit examples of Finsler naturally reductive metrics constructed.

Study characterizes naturally reductive metrics on homogeneous manifolds.

problem Characterizing naturally reductive (α1,α2)(α_1, α_2) metrics on homogeneous manifolds.
method Characterization through local ff-products and equivalence of properties.
result Explicit flag curvature formula for naturally reductive metrics.

A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A concrete transitive group of isometries is given for the new spaces and also the na…

2016-05-02abs ↗pdf ↗

Natural gradient simplification for deep learning networks.

problem Efficiency in training deep Bayesian networks.
method Analysis of two geometries of Fisher information matrix and development of a method to simplify natural gradient for the second geometry.
result A method to simplify natural gradient for deep networks using an auxiliary recognition model.

Study finds real-world datasets contain natural experiments that can improve model performance.

problem Detecting natural experiments in real-world datasets for causal inference.
method Synthetic graph simulation and feature selection based on causal links.
result Real-world datasets contain natural experiments that can be exploited for improved model performance.

Paper shows spectra can't distinguish naturally reductive manifolds.

problem Cannot distinguish naturally reductive manifolds using Laplace-Beltrami spectrum.
method Characterized naturally reductive 2-step nilpotent Lie groups via Ambrose-Singer's structures; constructed isospectral pairs of 9-dimensional nilmanifolds.
result Spectra of Laplace-Beltrami operator can't distinguish naturally reductive manifolds from non-naturally reductive ones.

In the present paper we study naturally reductive homogeneous (α,β)(α,β)-metric spaces. Under some conditions, we give some necessary and sufficient conditions for a homogeneous (α,β)(α,β)-metric space to be naturally reductive. Then we show that for such spaces the two definitions of naturally reductive homogeneous Finsler …

2013-05-26abs ↗pdf ↗

I.A.B. Strachan introduced the notion of a natural Frobenius submanifold of a Frobenius manifold and gave a sufficient but not necessary condition for a submanifold to be a natural Frobenius submanifold. This paper will give a necessary and sufficient condition and classify the natural Frobenius hypersurfaces.

2007-08-23abs ↗pdf ↗

Introduces a natural parallel translation for navigation data.

problem Navigation data geometric representation and parallelism.
method Introduces a natural parallel translation using Riemannian parallelism.
result The natural parallel translation preserves the Randers norm and has a finite-dimensional holonomy group.

A reductive structure is associated here with Lagrangian canonically defined conserved quantities on gauge-natural bundles. Parametrized transformations defined by the gauge-natural lift of infinitesimal principal automorphisms induce a variational sequence such that the generalized Jacobi morphism is naturally self-ad…

2007-12-06abs ↗pdf ↗

Square-root natural-gradient improves variational inference convergence.

problem Challenges in establishing theoretical convergence guarantees for natural-gradient descent.
method Square-root parameterization for Gaussian covariance.
result Establishes novel convergence guarantees for natural-gradient Gaussian inference.

Paper proposes a natural hedging framework with graphical assessment for longevity risk management.

problem Lack of a unified framework for natural hedging and graphical risk assessment.
method Structured natural hedging framework integrated with a graphical risk metric.
result Demonstrates flexibility, interpretability, and practical value for longevity risk management.

Variational inference transforms posterior inference into parametric optimization thereby enabling the use of latent variable models where otherwise impractical. However, variational inference can be finicky when different variational parameters control variables that are strongly correlated under the model. Traditiona…

2019-03-07abs ↗pdf ↗

Paper discusses natural quasiconvexity and its relation to decomposable sums in risk measures.

problem Understanding natural quasiconvexity and its implications in risk measures.
method Relates natural quasiconvexity to decomposable sums, proposes a general treatment of convexity index, and proves equivalence for certain spaces.
result Natural quasiconvexity and convexity are equivalent for conditional risk measures on LpL^p spaces under mild conditions.

Natural volume forms defined for pseudo-Finslerian manifolds with specific metrics.

problem Defining natural volume forms on pseudo-Finslerian manifolds with mm-th root metrics.
method Definitions depend on the parity of mm, expressed in terms of Cayley hyperdeterminants.
result Volume forms computation simplified by avoiding integration over the indicatrix.

We introduce a simple algorithm, True Asymptotic Natural Gradient Optimization (TANGO), that converges to a true natural gradient descent in the limit of small learning rates, without explicit Fisher matrix estimation. For quadratic models the algorithm is also an instance of averaged stochastic gradient, where the par…

2017-12-22abs ↗pdf ↗

AI helps assess nature-related financial risks for financial institutions.

problem Challenges in evaluating nature-related risks due to large data volume and complexity.
method Uses AI to address data gaps, uncertainty, and complex systems.
result Potential AI solutions for two use cases: beef supply and water utility.

A family of naturally reductive pseudo-Riemannian spaces is constructed out of the representations of Lie algebras with ad-invariant metrics. We exhibit peculiar examples, study their geometry and characterize the corresponding naturally reductive homogeneous structure.

2010-07-27abs ↗pdf ↗

Paper presents a rank-1 approximation method for natural policy gradients in deep RL.

problem Computing natural gradients requires inverting the Fisher Information Matrix, which is computationally expensive.
method Develops a rank-1 approximation to the inverse Fisher Information Matrix for efficient natural policy optimization.
result The rank-1 approximation converges faster and has similar sample complexity to stochastic policy gradient methods.

A new method uses natural gradients for efficient distribution optimization.

problem Challenges in computing natural gradients for many distributions.
method Reframe optimization as a surrogate distribution with easy natural gradient computation.
result Expands set of distributions efficiently targetable with natural gradients.

The main result of this paper is that every naturally reductive space can be explicitly constructed from the construction in \cite{Storm2018}. This gives us a general formula for any naturally reductive space and from this we prove reducibility and isomorphism criteria.

2018-10-05abs ↗pdf ↗

Paper solves local well-posedness for Schrödinger flow into sphere with natural boundary conditions.

problem Local well-posedness of Schrödinger flow into S2\mathbb{S}^2 with natural boundary conditions.
method Developed a new approximation scheme to solve the problem.
result Solved the local well-posedness problem for the Schrödinger flow into S2\mathbb{S}^2 with natural boundary conditions.

Paper tackles efficient evaluation of natural stochastic policies in offline RL.

problem Efficiency issues in evaluating natural stochastic policies due to unknown evaluation policy.
method Derive efficiency bounds for tilting and modified treatment policies, propose nonparametric estimators.
result Proposed estimators attain efficiency bounds under lax conditions and enjoy partial double robustness.

Natural graph networks are a new class of graph neural networks that are more flexible and scalable.

problem Traditional graph neural networks are limited by equivariance to node permutations.
method Introduced natural graph networks, which are more flexible and scalable than conventional graph neural networks.
result Natural graph networks are as scalable as conventional message passing graph neural networks but more flexible.