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

50101151201 · May 202619922001200920172026
48 results for Uniform equivalence

We prove some criteria for uniform K-stability of log Fano pairs. In particular, we show that uniform K-stability is equivalent to ββ-invariant having a positive lower bound. Then we study the relation between optimal destabilization conjecture and the conjectural equivalence between uniform K-stability and K-stabilit…

2019-07-11abs ↗pdf ↗

This paper refines homotopy theory for cubical sets and uniform spaces.

problem Classical homotopy theory limitations in cubical sets and uniform spaces.
method Develops a uniform-theoretic refinement for cubical sets and uniform spaces, lifting to a full and faithful embedding.
result Lifts classical homotopy categories to new uniform homotopy categories, generalizing cohomology theories.

We study the classification of ultrametric spaces based on their small scale geometry (uniform homeomorphism), large scale geometry (coarse equivalence) and both (all scale uniform equivalences). We prove that these equivalences can be characterized with parallel constructions using a combinatoric tool called common zi…

2009-09-01abs ↗pdf ↗

We study surfaces with decorations and prove uniformization in non-Euclidean geometries.

problem Discrete conformal equivalence in non-Euclidean geometries.
method Variational principle and continuous deformation.
result One master theory of discrete conformal equivalence across different geometries.

New loss function equivalence reveals PER's uniform sampling can be improved.

problem Improving Prioritized Experience Replay (PER) for better learning efficiency.
method Transforming non-uniformly sampled data loss functions into uniformly sampled ones.
result Some environments can replace PER with a new loss function without performance loss.

Uniform convergence of isotopies implies ambient isotopy, aiding knot equivalence.

problem Determining when uniform convergence of isotopies leads to ambient isotopies.
method Using a diagrammatic condition to offload uniform convergence, constructing examples of tame knots.
result Constructing tame knots with countably-many crossings, distinguishing them from wild curves.

Equivalence proven between divisorial stability and quotient log divisorial stability.

problem Equivalence of divisorial stability and log divisorial stability under finite group actions.
method Interpolation technique and equivariant divisorial stability construction.
result Equivariant divisorial stability of a polarized variety is equivalent to log divisorial stability of its quotient.

Equivalence proven between uniformizing varieties and tensors, generalizing uniformization results.

problem Characterizing complex-projective varieties with klt singularities and ample canonical divisors.
method Constructing a uniformizing variation of Hodge structure from slope zero tensors and vice versa.
result Generalization of uniformization results to singular settings, including quotients of tube domains.

Uniform K-stability ensures existence of special metrics on toric manifolds.

problem Existence of conformally Kähler, Einstein-Maxwell metrics on toric manifolds.
method Introducing uniform K-stability and showing its equivalence to properness of relative K-energy.
result Uniform K-stability is necessary and sufficient for the existence of ff-extremal metrics on toric manifolds.

New findings on PAC learning and marginal distribution estimation.

problem Understanding how PAC learning relates to marginal distribution estimation under distributional constraints.
method Revisited the connection between PAC learning, uniform convergence, and density estimation, considering a known family of marginal distributions.
result PAC learning is sandwiched between two refined models of density estimation, differing only in whether the learner knows the set of well-estimated events in H.

The paper studies complex Finsler metrics and their equivalence to the Kobayashi metric.

problem Investigating properties and equivalence of complex Finsler metrics.
method Using curvature properties of Bergman metrics and Schwarz lemma, the paper analyzes complex Finsler metrics and their equivalence to the Kobayashi metric.
result Uniform equivalences of the Kobayashi metric and Carathéodory metric on bounded strongly convex domains with smooth boundaries are proven.

Study infinite genus surfaces and Schottky groups for uniformization.

problem Investigate infinite genus surfaces and Schottky groups for uniformization.
method Definitions and proofs for infinite genus surfaces and Schottky groups, showing uniformization by Schottky groups.
result Infinite genus surfaces and handlebodies can be topologically and quasiconformally uniformized by Schottky groups.

New theorem removes uniform finite upper bound for shrinkability of null decompositions.

problem Shrinkability of null decompositions with non-singleton elements.
method Defining squeezable and squashable subsets, proving their equivalence, and applying these definitions to null decompositions.
result Any null decomposition of a compact metric space whose non-singleton elements are recursively squeezable is shrinkable.

The paper establishes a correspondence for projective bundles over curves using test configurations and extremal metrics.

problem Establishing a correspondence for projective bundles over curves using test configurations and extremal metrics.
method Constructing compatible test configurations and using the generalized Calabi ansatz.
result The relative uniform stability of \( (\mathbb{P}(E),[ω]) \) implies the existence of an extremal metric.

We introduce uniform K-stability and its relationship with the coercivity property of the K-energy functional, for general polarized manifolds. Since the automorphism groups are not necessarily finite, size of the norm measuring uniformity should be reduced with respect to the group action. About this point we explain …

2016-10-25abs ↗pdf ↗

We provide a constructive, variational proof of Rivin's realization theorem for ideal hyperbolic polyhedra with prescribed intrinsic metric, which is equivalent to a discrete uniformization theorem for spheres. The same variational method is also used to prove a discrete uniformization theorem of Gu et al. and a corres…

2017-07-21abs ↗pdf ↗

In this paper, we prove the equivalent of ultracontractive bound of heat semigroup or the uniform upper bound of the heat kernel with the Nash inequality, Log-Sobolev inequalities on graphs. We also show that under the assumption of volume growth and nonnegative curvature CDE(n,0)CDE'(n,0) the Sobolev inequality, Nash inequa…

2015-02-06abs ↗pdf ↗

The paper explores uniform perfectness and centers in Morse boundaries.

problem Detecting κκ-center exhaustivity in uniformly perfect Morse boundaries.
method Analyzes CAT(0) and geodesic spaces, using visual boundary data and metric transforms.
result Fixed-basepoint uniform perfectness is insufficient for κκ-center exhaustivity.

Establishes a link between risk measures and uniform integrability in finance.

problem Understanding uniform integrability in the context of financial risk measures.
method Introduces the folding score of distortion risk measures to study uniform integrability directly with gains and losses.
result Obtains three sets of equivalent conditions for uniform integrability involving coherent risk measures.

Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.

problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.

Boundary rigidity defined for hyperbolic spaces, tied to geometric properties.

problem Understanding boundary rigidity in Gromov hyperbolic spaces.
method Analyzing properties of Gromov hyperbolic spaces and their boundaries.
result Boundary rigidity is equivalent to positive Cheeger isoperimetric constant and non-amenability.

Recent reports have described that learning Bayesian networks are highly sensitive to the chosen equivalent sample size (ESS) in the Bayesian Dirichlet equivalence uniform (BDeu). This sensitivity often engenders some unstable or undesirable results. This paper describes some asymptotic analyses of BDeu to explain the …

2012-02-14abs ↗pdf ↗

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.

In this survey paper we present the LL--moves between braids and how they can adapt and serve for establishing and proving braid equivalence theorems for various diagrammatic settings, such as for classical knots, for knots in knot complements, in c.c.o. 3--manifolds and in handlebodies, as well as for virtual knots, …

2011-03-22abs ↗pdf ↗

Right-angled Artin groups are classified based on measure equivalence.

problem Classifying right-angled Artin groups using measure equivalence.
method Proved measure equivalence implies isomorphic extension graphs, and used quasi-isometry results.
result No right-angled Artin group is superrigid for measure equivalence.

Equivalence of norms on manifolds with curvature bounds established.

problem Establishing equivalence of norms on manifolds with bounded sectional curvature.
method Using spectral projector and thickness condition for subsets.
result Constant in equivalence depends only on manifold dimension, curvature bounds, and frequency threshold.

One fundamental goal in any learning algorithm is to mitigate its risk for overfitting. Mathematically, this requires that the learning algorithm enjoys a small generalization risk, which is defined either in expectation or in probability. Both types of generalization are commonly used in the literature. For instance, …

2016-08-22abs ↗pdf ↗

We introduce a norm on the space of test configurations, which we call the minimum norm. We conjecture that uniform K-stability with respect to this norm is equivalent to the existence of a constant scalar curvature Kähler metric. This notion of uniform K-stability is analogous to coercivity of the Mabuchi functional. …

2014-12-01abs ↗pdf ↗

Proves constant scalar curvature Kähler metrics are very general.

problem Existence of constant scalar curvature Kähler metrics on smooth polarized varieties.
method Combining uniform arc K-stability and algebraic properties in families.
result The constant scalar curvature Kähler locus is very general.

Complete normal forms for specific real hypersurfaces in complex space are constructed.

problem Constructing complete normal forms for real hypersurfaces in C3\mathbb C^3.
method Utilizing equivariant moving frames for systematic symbolic manipulation.
result Complete normal forms for 5-dimensional real hypersurfaces in C3\mathbb C^3 are found.

Characterizes infinite ideal polyhedra in hyperbolic 3-space and proves their existence and rigidity.

problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Study ideal circle patterns (ICPs) and develop a uniform Ring Lemma via pointed Gromov-Hausdorff convergence.
result Establish existence and rigidity of embedded ICPs and infinite ideal polyhedra (IIP).

Bayesian network structure learning is often performed in a Bayesian setting, evaluating candidate structures using their posterior probabilities for a given data set. Score-based algorithms then use those posterior probabilities as an objective function and return the maximum a posteriori network as the learned model.…

2017-04-12abs ↗pdf ↗

Bayesian network structure learning is often performed in a Bayesian setting, by evaluating candidate structures using their posterior probabilities for a given data set. Score-based algorithms then use those posterior probabilities as an objective function and return the maximum a posteriori network as the learned mod…

2016-05-12abs ↗pdf ↗

The paper provides guarantees for feedback control with sensor errors.

problem Certifying performance and safety in feedback control systems with sensor errors.
method Solving a supervised learning problem to characterize sensor errors and providing uniform error bounds.
result Finite-time convergence rate on sub-optimality of using a regressor in closed-loop for waypoint tracking.