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.

169,291 papers · 148 categories

Trend · papers per month

7132026 · Oct 202519922001200920182026
48 results for Hölder diffeomorphisms

Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.

problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.

Paper offers a new method to solve risk-sharing problems in Principal-Agent models.

problem Risk-sharing in Principal-Agent models with CARA utilities.
method Optimal decomposition of expected utility using Reverse-H{ö}lder inequality.
result Proof of existence and uniqueness of the solution under general assumptions.

New algorithm adapts to unknown smoothness in stochastic bandits with polynomial cost.

problem Adapting to unknown smoothness in stochastic bandits.
method Reconsidered Locatelli and Carpentier's lower bound, defined admissible rate functions, and developed a new algorithm.
result New algorithm matches minimal rate functions and provides polynomial cost of adaptation.

Let SS be a closed oriented surface of genus at least 22, and denote by T(S)\mathcal{T}(S) its Teichm{ü}ller space. For any isotopy class of closed curves γγ, we compute the first three derivatives of the length function _γ:T(S)R_+\ell\_γ:\mathcal{T}(S)\rightarrow\mathbf{R}\_+ in the shearing coordinates associated to a maxim…

2015-06-22abs ↗pdf ↗

We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…

2015-02-26abs ↗pdf ↗

Study of finite energy quasiplurisubharmonic functions on toric Kähler manifolds.

problem Characterizing and understanding finite energy quasiplurisubharmonic functions on toric Kähler manifolds.
method Characterization through convex functions and integrability properties of Legendre transforms.
result Log-Lipschitz convex functions on Delzant polytopes correspond to toric quasiplurisubharmonic functions with exponential integrability.

Validates economic scenarios using statistical tests on stochastic processes.

problem Ensuring the accuracy of real-world economic scenario models.
method Applies Chevyrev and Oberhauser's (2022) signature and maximum mean distance test to various stochastic processes.
result Demonstrates the test's effectiveness across different path properties relevant to financial modeling.

Study shows zero-shot super-resolution in neural operators is impossible in many cases.

problem Understanding the theoretical limits of zero-shot super-resolution in neural operators.
method Systematic theoretical study including information-theoretic and generalization bounds analysis.
result Zero-shot super-resolution is information-theoretically impossible in many settings.

Local Ricci flow under negative curvature conditions, with applications to metric space smoothing.

problem Finding solutions to Ricci flow under local negative curvature conditions.
method Local solution to Ricci flow equation with uniform existence time and bounded curvature.
result Local Ricci flow exists for a uniform time with bounded curvature, generalizing previous results.

Efficient algorithms for contextual bandits with smooth regret in continuous action spaces.

problem Efficient learning in large or continuous action spaces.
method Smooth regret notion and efficient algorithms for general function approximation.
result Statistically and computationally efficient algorithms for contextual bandits with smooth regret.

Smooth manifolds have equivalent diffeomorphism groups if and only if they are diffeomorphic.

problem Understanding when diffeomorphism groups of smooth manifolds are elementarily equivalent.
method Analyzing the equivalence of CrC^r and CsC^s diffeomorphism groups of smooth manifolds.
result Equivalent diffeomorphism groups imply diffeomorphic manifolds, strengthening previous results.

Paper derives explicit expression of Alekseev-Meinrenken diffeomorphism.

problem Understanding the Alekseev-Meinrenken diffeomorphism.
method Via the Stokes phenomenon of meromorphic linear systems of ODEs with Poncaré rank 1.
result Explicit expression of the Alekseev-Meinrenken diffeomorphism.

According to Pixton, there are Morse-Smale diffeomorphisms of the 3-sphere which have no energy function, that is a Lyapunov function whose critical points are all periodic points of the diffeomorphism. We introduce the concept of quasi-energy function for a Morse-Smale diffeomorphism as a Lyapunov function with the le…

2008-10-23abs ↗pdf ↗

We determine the Riemannian manifolds for which the group of exact volume preserving diffeomorphisms is a totally geodesic subgroup of the group of volume preserving diffeomorphisms, considering right invariant L2L^2-metrics. The same is done for the subgroup of Hamiltonian diffeomorphisms as a subgroup of the group of…

2001-03-30abs ↗pdf ↗

Generalizes π2π_2-diffeomorphism finiteness to non-zero first homotopy groups.

problem Bounding diffeomorphic types of compact manifolds with vanishing first and second homotopy groups.
method Generalizing the π2π_2-diffeomorphism finiteness theorem to include non-zero first homotopy groups.
result Diffeomorphic types of compact manifolds with non-zero first homotopy groups can be bounded.

Study partially hyperbolic diffeomorphisms on 3-manifolds, proving some classification results.

problem Classifying partially hyperbolic diffeomorphisms on 3-manifolds.
method Detailed proofs of results on partially hyperbolic diffeomorphisms on 3-manifolds, focusing on dynamically coherent cases.
result Some results towards the classification of partially hyperbolic diffeomorphisms on 3-manifolds.

General lower bounds on neural network approximation in L^p norm.

problem Fundamental limits of neural network expressivity.
method General lower bound proof on approximation in L^p norm, applied to feed-forward neural networks.
result Neural networks can't approximate certain functions as well as previously thought.

Study shows mean action of periodic orbits in annuli is bounded by their Calabi invariant.

problem Understanding the average distortion of periodic orbits in area-preserving annuli.
method Analyzes action functions and Calabi invariants of diffeomorphisms near annulus boundaries.
result Infimum of mean action of periodic orbits is bounded by their Calabi invariant.

Theta graph diffeomorphism shows nontrivial mapping class of 4-sphere.

problem Identifying nontrivial elements in the smooth mapping class group of 4-sphere.
method Diagrammatic calculus for smooth mapping class group of 4-sphere, Watanabe's clasper surgery construction.
result Theta graph diffeomorphism is isotopic to a nontrivial element of (1,2)-subgroup.

Positive paths connect diffeomorphisms on contact manifolds.

problem Defining and analyzing positivity in diffeomorphism groups of manifolds with contact structures.
method By examining paths of diffeomorphisms that are positively transverse to the contact distribution, showing flexibility and connecting diffeomorphisms.
result Any two diffeomorphisms on standard contact structure of R^(2n+1) can be connected by a positive path.

The paper finds diffeomorphic complex intersections with distinct Hodge numbers.

problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.

The paper proposes a deep learning approach to efficiently approximate diffeomorphisms for shape alignment.

problem Finding optimal reparameterizations of shapes for computing geodesic distances.
method The authors develop a neural network-based algorithm to construct approximations of diffeomorphisms using PyTorch.
result The proposed method achieves universal approximation properties and bounds on Lipschitz constants for the constructed diffeomorphisms.

Using the categorical description of supergeometry we give an explicit construction of the diffeomorphism supergroup of a compact finite-dimensional supermanifold. The construction provides the diffeomorphism supergroup with the structure of a Frechet supermanifold. In addition, we derive results about the structure of…

2009-04-17abs ↗pdf ↗