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,742 papers · 148 categories

Trend · papers per month

169338506675 · Jun 202019922001200920172026
48 results for generalised functions

Researchers create a Kähler structure on complex projective plane using elliptic functions.

problem Constructing a toric generalised Kähler structure on CP2\mathbb{C}P^2.
method Expressed various structures in terms of elliptic functions and computed the generalised Kähler potential.
result Various structures on CP2\mathbb{C}P^2 are described using elliptic functions.

Extends nonlinear theory of distributional geometry.

problem Developing a theory for nonsmooth differential geometry.
method Extending Colombeau theory to tensor fields, introducing Lie derivative and covariant derivative, defining generalised metric.
result Preserves Einstein equations and curvature of cones in nonsmooth geometry.

The ability of a reinforcement learning (RL) agent to learn about many reward functions at the same time has many potential benefits, such as the decomposition of complex tasks into simpler ones, the exchange of information between tasks, and the reuse of skills. We focus on one aspect in particular, namely the ability…

2018-12-18abs ↗pdf ↗

Study translators in Generalised Robertson-Walker spacetimes, identifying warping functions and classifying examples.

problem Understanding translators in Generalised Robertson-Walker spacetimes.
method Analyzing translators as submanifolds satisfying the mean curvature flow equation with a specific vector field.
result Identification of three one-parameter families of warping functions and classification of translators.

This work improves generalisation bounds using chaining and information theory.

problem Improving generalisation bounds for supervised learning algorithms.
method Developed a theoretical framework linking generalisation bounds to their chained counterparts, derived new bounds using Wasserstein distance.
result Chained generalisation bounds can be tighter than standard bounds, especially for concentrated hypothesis distributions.

We show that finiteness of the Lorentzian distance is equivalent to the existence of generalised time functions with gradient uniformly bounded away from light cones. To derive this result we introduce new techniques to construct and manipulate achronal sets. As a consequence of these techniques we obtain a functional …

2014-12-17abs ↗pdf ↗

Enhances robustness in experimental design through Generalised Bayesian inference.

problem Poor inference and estimates of information gain when statistical model is incorrectly specified.
method Generalised Bayesian (Gibbs) inference framework applied to experimental design.
result GBOED enhances robustness to outliers and incorrect assumptions about noise distribution.

The κκ-generalised distribution fits daily stock returns well.

problem Stock returns are often heavy-tailed, not normally distributed.
method Used the κκ-generalised distribution with a Monte-Carlo goodness of fit test.
result The κκ-generalised distribution fits historic daily stock returns well for a significant proportion of analyzed stocks.

Heterotic backgrounds described using generalised geometry, preserving minimal supersymmetry.

problem Characterizing heterotic backgrounds preserving minimal supersymmetry in four dimensions.
method Using generalised geometry, characterizing backgrounds by an SU(3)imesSpin(6+n)SU(3) imes Spin(6+n) structure and an involutive subbundle of the generalised tangent bundle.
result The analysis of infinitesimal deformations reproduces known cohomologies of massless moduli.

Let M be the interior of a compact 3-manifold with non-empty boundary, and T be an ideal (topological) triangulation of M. This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures and generalised angle structures on (M; T) respectively in terms of a generalis…

2005-10-25abs ↗pdf ↗

In this paper we aim for a generalisation of the Steenrod Approximation Theorem from, concerning a smoothing procedure for sections in smooth locally trivial bundles. The generalisation is that we consider locally trivial smooth bundles with a possibly infinite-dimensional typical fibre. The main result states that a c…

2006-10-07abs ↗pdf ↗

Improved similarity search in embeddings using InfoNCE loss.

problem Improving similarity search in embedding models trained by contrastive learning.
method Introduced a new continuity bound for InfoNCE loss via Gâteaux differentiation, preserving the averaging effect of negative samples.
result Demonstrated that the averaging effect of kk negative samples in InfoNCE loss carries over to stabilisation of generalisation error as kk grows.

Study links neural network inductive bias, feature learning, and generalization on Boolean functions.

problem Understanding how neural networks learn and generalize on Boolean data.
method End-to-end analysis of depth-2 discrete fully connected networks and DNF formulas, using Monte Carlo learning.
result Predictable training dynamics and interpretable features emerge, linking inductive bias and generalization.

Study on generalisation in random feature learning and hidden manifold models.

problem Generalisation in high-dimensional learning problems.
method Replica method from statistical physics for asymptotic generalisation performance.
result Closed-form expression for generalisation performance in various high-dimensional settings.

In a complete Riemannian manifold (M,g)(M, g) if the hessian of a real valued function satisfies some suitable conditions then it restricts the geometry of (M,g)(M, g). In this paper we characterize all compact rank-1 symmetric spaces, as those Riemannian manifolds (M,g)(M, g) admitting a real valued function uu such that the …

1995-11-23abs ↗pdf ↗

We consider a Gaussian process formulation of the multiple kernel learning problem. The goal is to select the convex combination of kernel matrices that best explains the data and by doing so improve the generalisation on unseen data. Sparsity in the kernel weights is obtained by adopting a hierarchical Bayesian approa…

2011-10-24abs ↗pdf ↗

The paper generalizes Cartan Geometry using Polacek and Siegel's approach.

problem Formulating sigma model dynamics in a covariant way.
method Using Polacek and Siegel's generalised curvature and torsion approach within the generalised metric formalism.
result Almost all higher generalised tensors correspond to covariant derivatives of the generalised Riemann tensor.

Investigates Lipschitz continuity in neural networks across various settings.

problem Understanding the Lipschitz behavior of neural networks.
method Empirical investigation of Lipschitz bounds in different neural network architectures and datasets.
result Remarkable fidelity of the lower Lipschitz bound and a Double Descent trend in both upper and lower bounds.

New approach to compute generalization performance using known risk distribution.

problem Computing generalization performance in machine learning.
method Assumes known risk distribution ρ(r)ρ(r), computes expected error using empirical risk minimization, and considers power-law behavior of ρ(r)ρ(r).
result Corrected typical behavior of generalization performance due to chance correlations in training set.

We discuss the structure of "exceptional generalised geometry" (EGG), an extension of Hitchin's generalised geometry that provides a unified geometrical description of backgrounds in eleven-dimensional supergravity. On a d-dimensional background, as first described by Hull, the action of the generalised geometrical O(d…

2008-04-08abs ↗pdf ↗

For Hitchin's generalised geometries we introduce and analyse the concept of a structured submanifold which encapsulates the classical notion of a calibrated submanifold. Under a suitable integrability condition on the ambient geometry, these generalised calibrated cycles minimise a functional occurring as D-brane ener…

2006-05-29abs ↗pdf ↗

The paper applies generalised geometry to semi-Riemannian immersions and hypersurfaces.

problem Analyzing semi-Riemannian immersions and hypersurfaces using generalised geometry.
method Develops the pullback of generalised metrics and divergence operators, introduces generalised exterior curvature, and derives Gauß-Codazzi equations.
result Establishes the constraint equations for the initial value formulation of the generalised Einstein equations.

We introduce a natural generalisation of holomorphic curves to morphisms of supermanifolds, referred to as holomorphic supercurves. More precisely, supercurves are morphisms from a Riemann surface, endowed with the structure of a supermanifold which is induced by a holomorphic line bundle, to an ordinary almost complex…

2011-02-24abs ↗pdf ↗

The elastic net was introduced as a heuristic algorithm for combinatorial optimisation and has been applied, among other problems, to biological modelling. It has an energy function which trades off a fitness term against a tension term. In the original formulation of the algorithm the tension term was implicitly based…

2011-08-14abs ↗pdf ↗