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

Trend · papers per month

4284125167 · May 202619922001200920182026
48 results for uniform pairing

We show relationships between uniform K-stability and plt blowups of log Fano pairs. We see that it is enough to evaluate certain invariants defined by volume functions for all plt blowups in order to test uniform K-stability of log Fano pairs. We also discuss the uniform K-stability of two log Fano pairs under crepant…

2017-01-01abs ↗pdf ↗

Equality in Miyaoka-Yau inequality implies uniformization of Klt pairs.

problem Understanding uniformization of Klt pairs under equality in Miyaoka-Yau inequality.
method Analyzing Kähler klt pairs with specific conditions and using orbifold Miyaoka-Yau inequality.
result Orbifold universal cover is either the unit ball or affine space.

Proves finitely generated associated graded rings for valuations on log Fano pairs.

problem Stability thresholds of log Fano pairs.
method Proves finite generation of associated graded rings for valuations.
result Log Fano pairs are uniformly K-stable if their stability threshold is less than a certain value.

Study proves uniform ellipticity implies uniform polyconvexity for anisotropic energy functionals.

problem Investigating uniform ellipticity and polyconvexity for anisotropic geometric energy functionals.
method Proves a variant of a recent result using real polyhedral chains.
result Uniform ellipticity of an anisotropic energy functional implies uniform polyconvexity of the integrand.

We construct a pair of transverse genuine laminations on an atoroidal 3-manifold admitting transversely orientable uniform 1-cochain. The laminations are induced by the uniform 1-cochain and they are indeed the "straightening" of the coarse laminations defined in [Ca], by using minimal surface techniques. Moreover, whe…

2003-04-07abs ↗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.

Shows uniform K-stability is open in Q-Gorenstein families of Q-Fano varieties.

problem Detecting uniform K-stability in families of Q-Fano varieties.
method Examined the behavior of the stability threshold in families and showed it is lower semicontinuous.
result Uniform K-stability is a Zariski open condition in Q-Gorenstein families of Q-Fano varieties.

PCA++ improves robustness to background noise in contrastive learning.

problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.

This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.

problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.

We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry; these examples show that the bi-twist construction is often efficient and natural…

2013-06-19abs ↗pdf ↗

Improved sample complexity for Gaussian Mixture Models using Pair Correlation Factor.

problem Understanding the sample complexity of Gaussian Mixture Models.
method Introducing Pair Correlation Factor (PCF) to measure clustering of component means and improving sample complexity bounds.
result The Pair Correlation Factor (PCF) more accurately determines the difficulty of parameter recovery in Gaussian Mixture Models.

The study shows that random surfaces built from polygons converge to a Poisson-Dirichlet partition.

problem Understanding geometric properties of random surfaces constructed from polygons.
method Uniformly pairing polygon sides to form surfaces, analyzing degree sequences and geometric properties using probabilistic techniques.
result Several geometric properties of the graph are universal, converging to a Poisson-Dirichlet partition as non o \infty.

We will show that for a polynomially contractible manifold of bounded geometry and of polynomial volume growth every coarse and rough cohomology class pairs continuously with the K-theory of the uniform Roe algebra. As an application we will discuss non-vanishing of rough index classes of Dirac operators over such mani…

2015-05-15abs ↗pdf ↗

Pessimistic Minimax Value Iteration finds efficient NE policies from offline data.

problem Finding an approximate Nash equilibrium in offline Markov games with non-uniform coverage.
method Pessimistic Minimax Value Iteration (PMVI) constructs pessimistic value function estimates and solves NEs.
result Established a nearly minimax optimal result for offline Markov games with function approximation.

Unified bounds for sketched bilinear forms in machine learning and statistics.

problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.

Uniform-in-time analysis for Stein Variational Gradient Descent across various metrics.

problem Understanding long-term behavior of finite-particle systems in relation to their mean-field limits.
method Developed uniform-in-time propagation-of-chaos results for continuous-time SVGD using cutoff strategies and finite-dimensional theories.
result Uniform-in-time propagation-of-chaos bounds in various metrics, including Langevin kernel Stein discrepancy, Wasserstein-1, and Wasserstein-2 distances.

Uniform heat kernel and diffusion bridge asymptotics for sub-Riemannian geometry.

problem Analyzing sub-Riemannian heat kernels and their derivatives on incomplete manifolds.
method Localized asymptotic analysis, focusing on minimizing geodesics and the non-abnormal cut locus.
result Uniform bounds and expansions for heat kernels and their derivatives on compacts, including the diffusion bridge measure.

The paper connects arithmetic invariants of hyperbolic 3-manifolds.

problem Understanding the arithmetic properties of hyperbolic 3-manifolds.
method Analyzes profinite completions and algebraic invariants of fundamental groups.
result Uniform lattices with isomorphic profinite completions have identical arithmetic properties.

The paper proves a mapping from a space of holonomy varieties to Teichmüller spaces, with a non-empty discrete intersection.

problem Intersection of Poincaré holonomy varieties and their properties.
method Holomorphic mapping and branched covering proof.
result Intersection of arbitrary Poincaré holonomy varieties is a non-empty discrete set.

Tian initiated the study of incomplete Kähler-Einstein metrics on quasi-projective varieties with cone-edge type singularities along a divisor, described by the cone-angle 2π(1α)2π(1-α) for α(0,1)α\in (0, 1). In this paper we study how the existence of such Kähler-Einstein metrics depends on αα. We show that in the negative s…

2012-09-30abs ↗pdf ↗

The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering by applying one-way clustering algorithms independently on t…

2007-12-17abs ↗pdf ↗

We produce examples of taut foliations of hyperbolic 3-manifolds which are R-covered but not uniform --- ie the leaf space of the universal cover is R, but pairs of leaves are not contained in bounded neighborhoods of each other. This answers in the negative a conjecture of Thurston `Three-manifolds, foliations and cir…

1998-08-14abs ↗pdf ↗

SDP approach recovers communities in multilayer hypergraphs from aggregated similarity matrices.

problem Community recovery in multilayer hypergraphs using aggregated similarity matrices.
method Semidefinite programming (SDP) approach.
result Information-theoretic conditions for exact recovery in both assortative and disassortative cases.

New uniform K-theory and Poincare duality established for manifolds.

problem Developing a new framework for K-theory and K-homology.
method Constructing uniform K-homology, defining external and cap products, proving homotopy invariance and Poincare duality.
result Established Poincare duality between uniform K-theory and uniform K-homology on spin-c manifolds.