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

2955918861,181 · Jun 202019922001200920172026
48 results for global finitely generated

Smooth distributions on subcartesian spaces can be globally finitely generated.

problem Understanding smooth distributions on subcartesian spaces.
method Embedding in Euclidean space, Whitney Embedding Theorem, and distribution theory.
result Smooth generalized distributions and subbundles on connected subcartesian spaces are globally finitely generated.

We introduce a special class of knots, called global knots, in F^2 x R and we construct new isotopy invariants, called T-invariants, for global knots. Some T-invariants are of finite type but they cannot be extracted from the generalized Kontsevitch integral (which is consequently not the universal invariant of finite …

2000-12-12abs ↗pdf ↗

Continuing our previous work (arXiv:1509.07981v1), we derive another global gradient estimate for positive functions, particularly for positive solutions to the heat equation on finite or locally finite graphs. In general, the gradient estimate in the present paper is independent of our previous one. As applications, i…

2015-10-24abs ↗pdf ↗

We prove a global algebraic version of the Lie-Tresse theorem which states that the algebra of differential invariants of an algebraic pseudogroup action on a differential equation is generated by a finite number of rational-polynomial differential invariants and invariant derivations.

2011-11-23abs ↗pdf ↗

The study characterizes quasi Yamabe solitons with potential vector fields.

problem Characterizing quasi Yamabe solitons with specific properties.
method Analyzing potential vector fields and their norms in quasi Yamabe solitons.
result If the potential vector field has a finite global norm in a complete non-trivial, non-compact quasi Yamabe soliton with finite volume, the scalar curvature becomes constant and the soliton reduces to a Yamabe soliton.

Proposes a new method to control FDR using frequentist-assisted horseshoe for high-dimensional testing.

problem Designing tests with frequentist false discovery rate control using horseshoe prior.
method Frequentist-assisted horseshoe procedure for high-dimensional normal means testing.
result Consistently achieves robust finite-sample FDR control in various sparse cases.

We study the global theory of linear wave equations for sections of vector bundles over globally hyperbolic Lorentz manifolds. We introduce spaces of finite energy sections and show well-posedness of the Cauchy problem in those spaces. These spaces depend in general on the choice of a time function but it turns out tha…

2014-08-21abs ↗pdf ↗

New framework analyzes deep learning optimization with finite width networks, revealing generalization gaps and excess risks.

problem Analyzing generalization error of deep learning with finite width networks.
method Formulating neural network training as transportation map estimation and analyzing via infinite dimensional Langevin dynamics.
result Achieves fast learning rate and minimax optimal rates for classification and regression problems.

The paper conjectures and proves fixed points for certain group actions on nonpositively curved spaces.

problem Actions by automorphisms of finitely generated groups on nonpositively curved complexes without fixed points.
method Use of Helly graphs and geodesic clique paths to prove ellipticity results.
result Finitely generated torsion groups cannot act without fixed points on nonpositively curved spaces.

A theorem for debiasing machine learning with finite sample guarantees.

problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.

We prove a global smooth isometric immersion for negatively curved surfaces with finite total curvature.

problem Finding a sufficient condition for a complete negatively curved surface to be isometrically embedded in R^3.
method Developed new techniques to overcome slow decay and oscillations of Gauss curvature, reformulating the Gauss-Codazzi equations as a symmetric hyperbolic system.
result Proved the global existence of a smooth solution to the Gauss-Codazzi system, achieving a global smooth isometric immersion of the surface into R^3.

We prove global rigidity for compact hyperbolic and spherical cone-3-manifolds with cone-angles π\leq π (which are not Seifert fibered in the spherical case), furthermore for a class of hyperbolic cone-3-manifolds of finite volume with cone-angles π\leq π, possibly with boundary consisting of totally geodesic hyperbo…

2005-04-06abs ↗pdf ↗

The aim of this survey is to give an overview on the geometry of Einstein maximal globally hyperbolic 2+1 spacetimes of arbitrary curvature, conatining a complete Cauchy surface of finite type. In particular a specialization to the finite type case of the canonicla Wick rotation-rescaling theory, previously developed b…

2007-04-17abs ↗pdf ↗

New framework for DNN training guarantees convergence to global minimum.

problem Training deep neural networks to converge to global minimum.
method Reformulated minimization problem with recursive algorithmic framework, using bounded style assumptions.
result Convergence to an ε-(global) minimum with O(1/ε^3) gradient computations.

New Alexandrov-Patchwork construction for Lorentzian spaces with curvature bounds.

problem Understanding finite diameter constraints in Lorentzian geometry.
method Constructing Alexandrov-Patchwork and proving Bonnet-Myers theorem for Lorentzian spaces.
result Lorentzian spaces with curvature bounds have finite diameter.

A new method for clearing liability networks using sheaves on directed hypergraphs.

problem Clearing in liability networks using a novel mathematical approach.
method Associate a liability sheaf on a directed hypergraph to a liability network, identifying clearing configurations as global sections of this sheaf.
result Clearing configurations are precisely the global sections of the sheaf, and the sheaf construction is functorial under change of coefficient category.

New scalable MARL framework for dynamic networked systems.

problem Scalability in multi-agent reinforcement learning with dynamic dependencies.
method Scalable Actor Critic framework for non-local and stochastic dependencies.
result Finite-time error bound showing convergence rate dependence on information spread speed.

In this paper, we study the global Kähler-Ricci flow on a complete non-compact Kähler manifold. We prove the following result. Assume that (M,g0)(M,g_0) is a complete non-compact Kähler manifold such that there is a potential function ff of the Ricci tensor, i.e., Rijˉ(g0)=fijˉ. R_{i\bar{j}}(g_0)=f_{i\bar{j}}. Assume that the quan…

2012-09-23abs ↗pdf ↗

We construct finitely generated groups with strong fixed point properties. Let Xac\mathcal{X}_{ac} be the class of Hausdorff spaces of finite covering dimension which are mod-pp acyclic for at least one prime pp. We produce the first examples of infinite finitely generated groups QQ with the property that for any act…

2007-11-27abs ↗pdf ↗

The Tits alternative applies to groups acting on specific CAT(0) spaces.

problem Understanding the structure of groups acting on CAT(0) spaces.
method Proving the Tits alternative for groups acting on visibility CAT(0) spaces with bounded packing property.
result Groups either almost nilpotent or contain a free nonabelian subgroup of rank 2.

Unified framework for Arnold-type invariants via dual complexes and finite-difference structures.

problem Study of Arnold-type invariants of immersed curves and surfaces.
method Framework on dual complexes, locally normalized maps, finite-difference structures, and Shumakovitch-type identities.
result Unified evaluation of Arnold-type invariants St(1)St_{(1)} and St(2)St_{(2)} on dual skeleta.

New algorithm for nonstationary multi-armed bandits with optimal performance.

problem Nonstationary multi-armed bandits with changing model parameters over time.
method Adaptive Resetting Bandit (ADR-bandit) algorithm using adaptive windowing techniques.
result ADR-bandit achieves nearly optimal performance in both abrupt and gradual changes.

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using, respectively, the systems of trivial groups, symmetric groups, braid groups and pur…

2014-05-21abs ↗pdf ↗

New bounds for SMC show its advantage over MCMC in multimodal distributions.

problem Estimating expectations under multimodal distributions with slow global mixing.
method Proves finite sample complexities for SMC with local mixing times, addressing bias through sequential resampling.
result SMC provides fully polynomial time approximation for multimodal problems.