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

285684112 · May 202619922001200920182026
48 results for Lipchitz equivalence

The paper studies stability of nilpotent structures on collapsed manifolds.

problem Stability of pure nilpotent structures on collapsed manifolds.
method Proves stability of nilpotent structures under L_0-bi-Lipchitz equivalence and sufficient collapsed metrics.
result Under certain conditions, pure nilpotent structures are stable and uniquely determined by the original metric.

We present a fully nonparametric method to estimate the value function, via simulation, in the context of expected infinite-horizon discounted rewards for Markov chains. Estimating such value functions plays an important role in approximate dynamic programming and applied probability in general. We incorporate "soft in…

2013-12-26abs ↗pdf ↗

A lot of effort has been invested into characterizing the convergence rates of gradient based algorithms for non-linear convex optimization. Recently, motivated by large datasets and problems in machine learning, the interest has shifted towards distributed optimization. In this work we present a distributed algorithm …

2012-07-12abs ↗pdf ↗

Study shows how to control jump-diffusion processes with stable feedback controls in reinforcement learning.

problem Control jump-diffusion processes with unknown coefficients in reinforcement learning.
method Lipschitz continuous optimal feedback controls, stability analysis of forward-backward SDEs, least-squares algorithm.
result Achieves O(NlnN)O(\sqrt{N\ln N}) regret for linear-convex learning problems with jumps.

This work analyzes how deep neural networks' expressiveness increases with depth and width.

problem Understanding the expressiveness of deep neural networks (DNNs) based on their Lipschitz constants.
method Leveraging random matrix theory, the study characterizes the expressiveness of DNNs by their Lipschitz constant, showing exponential and polynomial increases with depth and width, respectively.
result The expressiveness of DNNs increases exponentially with depth and polynomially with width, consistent with function approximation benefits.

Study examines equivalence relations on the pair of pants, proving k-equivalence implies 1-equivalence and 2-equivalence.

problem Understanding equivalence classes of closed curves on the pair of pants.
method Examined k-equivalence, proving it implies 1-equivalence and 2-equivalence, and deepened understanding of 1-equivalence.
result k-equivalence implies 1-equivalence and 2-equivalence on the pair of pants.

Paper solves equivalence problems for fifth-order differential operators using Cartan's method.

problem Equivalence problem for fifth-order differential operators under fiber-preserving transformations.
method Cartan's method of equivalence applied to solve two versions of the equivalence problem.
result Sufficient and necessary conditions for fiber-preserving transformations between fifth-order differential operators.

Paper extends Stanford's equivalence to virtual knots and proves equivalence to Goussarov-Polyak-Viro's n-equivalence.

problem Characterizing finite type invariants in virtual knot theory.
method Using the lower central series of the pure virtual braid group to define an L_n-equivalence.
result L_n-equivalence on virtual string links is equivalent to Goussarov-Polyak-Viro's n-equivalence.

Geodesically equivalent metrics on homogeneous spaces are shown to be affinely equivalent.

problem Characterizing geodesically equivalent metrics on homogeneous spaces.
method Analyzing left GG-invariant metrics on G/HG/H and using algorithms to find geodesically equivalent metrics.
result Existence of non-proportional geodesically equivalent metrics implies non-full holonomy algebra.

In this paper we discuss four problems regarding Markov equivalences for subclasses of loopless mixed graphs. We classify these four problems as finding conditions for internal Markov equivalence, which is Markov equivalence within a subclass, for external Markov equivalence, which is Markov equivalence between subclas…

2011-10-20abs ↗pdf ↗

This article is dedicated to solve the equivalence problem for two third order differential operators on the line under general fiber--preserving transformation using the Cartan method of equivalence. We will do three versions of the equivalence problems: first via the direct equivalence problem, second equivalence pro…

2011-01-17abs ↗pdf ↗

Equivalent bicategories constructed from action Lie groupoids.

problem Equivalence of bicategories constructed from action Lie groupoids.
method Localizing at equivariant weak equivalences, surjective submersive equivariant weak equivalences, and all weak equivalences.
result Weak equivalences between action Lie groupoids are isomorphic to compositions of nice forms of equivariant weak equivalences.

Develops LL_\infty spaces over dg manifolds and establishes an equivalence with LL_\infty algebroids.

problem Defining and comparing LL_\infty spaces and algebroids over dg manifolds.
method Establishes an equivalence between categories of LL_\infty algebroids and LL_\infty spaces, constructs a faithful functor.
result Detects weak equivalences between LL_\infty algebroids and LL_\infty spaces.

Two Riemannian manifolds are called eigenvalue equivalent when their sets of eigenvalues of the Laplace-Beltrami operator are equal (ignoring multiplicities). They are (primitive) length equivalent when the sets of lengths of their (primitive) closed geodesics are equal. We give a general construction of eigenvalue equ…

2006-06-14abs ↗pdf ↗

In this paper, two sufficient conditions are provided for given two K-equivalent map-germs to be bi-Lipschitz A-equivalent. These are Lipschitz analogues of the known results on C^r-A-equivalence (0r)(0 \leq r \leq \infty) for given two K-equivalent map-germs. As a corollary of one of our results, a Lipschitz version of …

2013-02-20abs ↗pdf ↗

Paper explores state-action equivalence in RL, improving regret bounds.

problem Improving reinforcement learning performance by leveraging state-action equivalence.
method Introduces a notion of similarity between state-action pairs, defines equivalence structure, and presents algorithms for confidence sets.
result Confidence sets improve RL performance, especially in known equivalence structures.

In present paper, the equivalence problem for fourth order differential operators with one variable under general fiber-preserving transformation using the Cartan method of equivalence is applied. Two versions of equivalence problems are considered. First, the direct equivalence problem and second equivalence problem i…

2014-05-24abs ↗pdf ↗

The equivalence (or weak equivalence) classes of orientation-preserving free actions of a finite group G on an orientable 3-dimensional handlebody of genus g can be enumerated in terms of sets of generators of G. They correspond to the equivalence classes of generating n-vectors of elements of G, where n=1+(g-1)/|G|, u…

2001-09-22abs ↗pdf ↗

Let MM and NN be Nash manifolds, and ff and gg Nash maps from MM to NN. If MM and NN are compact and if ff and gg are analytically R-L equivalent, then they are Nash R-L equivalent. In the local case, CinftyC^infty R-L equivalence of two Nash map germs implies Nash R-L equivalence. This shows a difference of Nash…

2010-04-23abs ↗pdf ↗

Study stable equivalence relations on 4-manifolds, proving homotopy equivalent manifolds with abelian fundamental group are stably diffeomorphic.

problem Classifying stable equivalence relations on 4-manifolds.
method Combination of modified and classical surgery, focusing on homotopy equivalence up to stabilisation.
result Closed oriented homotopy equivalent 4-manifolds with abelian fundamental group are stably diffeomorphic.

Study shows equivalence in foliations and pre-symplectic forms aligns with gauge equivalence.

problem Deformation theory of foliations and pre-symplectic forms.
method Proved geometric equivalence agrees with algebraic gauge equivalence using LL_{\infty}-algebras.
result Gauge equivalences for foliations and pre-symplectic structures are consistent.

Establishes equivalence between models of derived stacks.

problem Tackles the equivalence between different models of derived geometry.
method Uses Quillen equivalence to show categories of higher derived stacks are equivalent.
result Shows equivalence among models of derived manifolds, Carchedi-Roytenberg, Behrend-Liao-Xu, and Alexandrov-Kontsevich-Schwarz-Zaboronsky.

If the fundamental group of the complement of a smooth embedding f: S^2 \subset R^4 is a cyclic group, the map can be deformed to the standard embedding by a generic one-parameter family with at most cusp singularities. If two smooth embeddings are connected by such a deformation, they will be called cusp equivalent. W…

1999-11-20abs ↗pdf ↗

Characterizes Bayesian networks up to unconditional equivalence.

problem Characterizing Bayesian networks up to unconditional equivalence.
method Transformational characterization via undirected graphs and specified moves.
result Two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of moves.

We study gauge transformations of Dirac structures and the relationship between gauge and Morita equivalences of Poisson manifolds. We describe how the symplectic structure of a symplectic groupoid is affected by a gauge transformation of the Poisson structure on its identity section, and prove that gauge-equivalent in…

2002-02-12abs ↗pdf ↗

System uses neural networks to prove program equivalence via rewrite rules.

problem Proving equivalence between two dataflow graphs.
method Developed a graph-to-sequence neural network trained on example generation to find semantics-preserving rewrite rules.
result System correctly outputs a rewrite sequence for 96% of program pairs, proving equivalence.

This paper classifies superintegrable systems on 2D geometries with projective symmetries.

problem Classifying superintegrable systems on 2D geometries with projective symmetries.
method Combining metric projective differential geometry and superintegrability, defining projective equivalence, and applying transformation rules.
result Potentials of projectively equivalent Hamiltonians follow a linear superimposition rule.