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

2845698531,137 · Jun 202019922001200920172026
48 results for natural generalization

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 ↗

The paper proposes a method to train time-varying generative models using natural gradients.

problem Training time-varying generative models efficiently and accurately.
method Projecting generative model parameters onto an exponential family manifold and optimizing using natural gradient descent.
result The proposed method efficiently approximates the natural gradient and can be applied to various exponential family models.

Paper proves naturally reductive property is inaudible for certain manifolds.

problem Proving naturally reductive property is inaudible for specific manifolds.
method Using a pair of non-compact 11-dimensional generalized Heisenberg groups, the paper proves the naturally reductive property is inaudible.
result The naturally reductive property is inaudible for certain manifolds.

Natural gradient descent avoids the magic of model parametrization, leading to different optimization outcomes.

problem Understanding the impact of model parametrization on optimization and generalization in deep learning.
method Characterization of natural gradient flow in deep linear networks and nonlinear neural networks.
result Natural gradient descent fails to generalize in some cases, while gradient descent with the right architecture performs well.

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 ↗

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 ↗

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.

We study the conditions under which the tangent bundle (TM,G)(TM,G) of an nn-dimensional Riemannian manifold (M,g)(M,g) is conformally flat, where GG is a general natural lifted metric of gg. We prove that the base manifold must have constant sectional curvature and we find some expressions for the natural lifted metric $G…

2008-10-09abs ↗pdf ↗

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.

Proposes model-based robust deep learning to handle natural variation in data.

problem Deep learning's fragility to natural variation in data.
method Develops model-based robust training algorithms using deep generative models to learn natural variation.
result Deep neural networks trained with model-based algorithms outperform standard and norm-bounded robust algorithms.

Naturally reductive spaces, in general, can be seen as an adequate generalization of Riemannian symmetric spaces. Nevertheless, there are some that are closer to symmetric spaces than others. On the one hand, there is the series of Hopf fibrations over complex space forms, including the Heisenberg groups with their met…

2019-09-10abs ↗pdf ↗

We construct a natural generalized complex structure on the total space of any bundle endowed with a Chern connection and whose typical fibre is a homogeneous symplectic manifold. This extends known constructions of generalized complex structures on Lie groups and leads to natural examples of holomorphic maps between g…

2012-10-17abs ↗pdf ↗

We assume a vector bundle p:EMp: E\to M with a general linear connection KK and a classical linear connection $\Lam$ on MM. We prove that all classical linear connections on the total space EE naturally given by $(\Lam, K)$ form a 15-parameter family. Further we prove that all connections on J1EJ^1 E naturally given by…

2004-10-21abs ↗pdf ↗

Improved robot navigation using multi-head attention for natural language instructions.

problem Improving robot navigation in unfamiliar environments.
method Proposes a multi-head attention mechanism blending layer in a neural network model.
result Significant performance gains in translating instructions for unseen environments.

We propose some natural generalizations of Reidemeister moves that do not increase the number of crossings in the generated diagrams. Experimentations make us conjecture that this class of monotonic moves is complete for computing canonical forms and then deciding isotopy.

2007-07-08abs ↗pdf ↗

A new method generates natural-looking adversarial examples by bounding internal activation values.

problem Creating natural-looking adversarial examples that closely mimic the original input.
method Bounding internal activation values through a distribution quantile bound and polynomial barrier loss function.
result Our attack achieves similar success and confidence levels as state-of-the-art methods but with more natural-looking perturbations.

New approach improves adversarial robustness without sacrificing natural generalization.

problem Balancing adversarial robustness and natural generalization in machine learning.
method Friendly adversarial training (FAT) using early-stopped PGD to find least adversarial data.
result Early-stopped PGD achieves adversarial robustness without compromising natural generalization.

Study flag curvature in homogeneous Finsler spaces with a specific metric.

problem Analyzing flag curvature in homogeneous Finsler spaces with a generalized mm-Kropina metric.
method Provided explicit formula for flag curvature, showed equivalence of definitions, and studied curvature of naturally reductive spaces.
result Equivalence of two definitions of naturally reductive homogeneous Finsler spaces for the generalized mm-Kropina metric.

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 ↗

Generative Adversarial Networks (GANs) have gathered a lot of attention from the computer vision community, yielding impressive results for image generation. Advances in the adversarial generation of natural language from noise however are not commensurate with the progress made in generating images, and still lag far …

2017-05-31abs ↗pdf ↗

The reduction theorems for general linear and classical connections are generalized for operators with values in higher order gauge-natural bundles. We prove that natural operators depending on the s1s_1-jets of classical connections, on the s2s_2-jets of general linear connections and on the rr-jets of tensor fields …

2004-05-26abs ↗pdf ↗

New insights into natural exponential families improve regret bounds for bandit problems.

problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.

A central challenge in neuroscience is to understand neural computations and circuit mechanisms that underlie the encoding of ethologically relevant, natural stimuli. In multilayered neural circuits, nonlinear processes such as synaptic transmission and spiking dynamics present a significant obstacle to the creation of…

2017-02-06abs ↗pdf ↗

iPrompt uses LLMs to generate natural-language explanations of data patterns.

problem Finding and explaining patterns in data using natural language.
method Interpretable autoprompting (iPrompt) that generates natural-language explanations based on LLMs.
result iPrompt can accurately find and explain data patterns, improving upon human-written prompts.