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

139278416555 · May 202619922001200920182026
48 results for uniformizing structure

Uniformizes surfaces with boundaries, focusing on triple junctions.

problem Uniformization of surfaces with boundaries, especially triple junctions.
method Extends conformal structure results to triple junction surfaces.
result Weak uniformization results for triple junction surfaces.

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.

Uniformizes Hodge structures, proving Lyapunov exponents and log-Anosov monodromy.

problem Analyzing weight 3 variations of Hodge structures and their Lyapunov exponents.
method Developed uniformizations and used analytic properties to prove conjectures and properties of monodromy representations.
result Proved log-Anosov property and established strong Torelli theorem for the VHS.

The paper creates spherical CR structures for Whitehead link surgeries.

problem Creating spherical CR structures for Dehn surgeries of the Whitehead link.
method Applying spherical CR Dehn surgery theorem to deform Ford domains.
result Infinitely many Dehn surgeries of the Whitehead link complement with spherical CR structures.

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.

Study uniform learnability of binary classification networks with communication.

problem Learning a network with communication between vertices from uniform ergodic Random Graph Process.
method Introduced structural Rademacher complexity and used martingale method and Marton's coupling.
result Uniform learnability as worst-case theoretical limits for binary classification problems.

Smooth DNNs mitigate the curse of dimensionality in uniform convergence for various regression tasks.

problem The curse of dimensionality in uniform convergence of ReLU networks.
method Analysis of smoothly activated deep neural networks (smooth DNNs), establishing pseudo-dimension bounds and non-asymptotic approximation guarantees.
result Smooth DNNs achieve non-asymptotic uniform convergence rates across multiple statistical contexts, mitigating the curse of dimensionality.

A new projective structure on Riemann surfaces differs from the uniformization theorem's structure.

problem Comparing two projective structures on compact Riemann surfaces.
method Using Hodge theory and the Torelli map to compare the (0,1)(0,1)-component of the differential of sections of moduli spaces.
result The two projective structures differ in general, with the (0,1)(0,1)-component of the differential of the section corresponding to η^\widehat{\eta} being a nonzero constant multiple of the Siegel form.

The paper proves existence and eigenvalue bounds for CR structures, leading to uniformization theorems.

problem Existence and eigenvalue estimates for CR structures.
method Analyzes pseudo-Einstein contact forms and CR Paneitz operator.
result Derives eigenvalue upper bounds and uniformization theorems for CR 3-manifolds.

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 ↗

Uniform K-homology theory applied to elliptic operators on manifolds with boundary.

problem Developing a theory to study boundary conditions for elliptic operators on non-compact manifolds.
method Theory of relative uniform K-homology, developing a relative index map.
result Uniform K-homology classes of boundary conditions and their connection to the higher ρ-invariant.

Complex projective structures can be joined via simple bubbling and debubbling.

problem Joining complex projective structures with quasi-Fuchsian holonomy.
method Performing (de)grafting via a sequence of one bubbling and one debubbling.
result Any complex projective structure can be joined to the uniformizing structure by a simple sequence of one bubbling and one debubbling.

Lie groupoids and algebroids define uniformity and homogeneity in Cosserat media.

problem Defining uniformity and homogeneity in Cosserat media without reference crystals.
method Associated Lie groupoids and algebroids to Cosserat media, using them to characterize homogeneity.
result New definitions of homogeneity independent of reference crystals.

The paper provides uniform inference for high-dimensional graphical models.

problem Estimating dependencies in large sets of variables with high-dimensional data.
method Uniform estimation rates and sparsity guarantees for the square-root estimator in random design under approximate sparsity conditions.
result The paper establishes uniform estimation rates and sparsity guarantees for graphical models in high-dimensional settings.

Classifies meromorphic affine connections on complex surfaces.

problem Investigating uniformization in higher dimensions with singularities.
method Extending work on holomorphic connections, classifying meromorphic connections on compact surfaces.
result Classification of meromorphic affine connections on compact complex surfaces.

The paper proves a conjecture about manifold limits and characterizes their structure.

problem Characterizing limits of manifolds with a uniform contractibility function.
method Short proof using Gromov-Hausdorff distance and ANR properties.
result Obstruction vanishes if and only if the manifold can be approximated by PL-manifolds.

The paper studies Blaschke products, proving uniformization and non-degeneracy of pressure metrics.

problem Analytic aspects of Blaschke products and their moduli space.
method Definition of complex structure and proof of uniformization theorem.
result Pressure semi-norms are non-degenerate outside the super-attracting locus.

Uniformity and proximity are two different ways for defining small scale structures on a set. Coarse structures are large scale counterparts of uniform structures. In this paper, motivated by the definition of proximity, we develop the concept of asymptotic resemblance as a relation between subsets of a set to define a…

2013-10-23abs ↗pdf ↗

This paper investigates the geometry of compact contact manifolds that are uniformized by contact Lie groups, i.e., compact manifolds that are the quotient of some Lie group G with a left invariant contact structure and a uniform lattice subgroup. We re-examine Alexander's criteria for existence of lattices on solvable…

2009-04-20abs ↗pdf ↗

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.

Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time significantly. For theoretical performance guarantees, each row must be sampled with pr…

2014-08-21abs ↗pdf ↗

UCPO improves diversity in reinforcement learning models, maintaining high accuracy.

problem RLVR objectives often lead to diversity collapse, reducing coverage of correct solutions.
method UCPO adds a conditional uniformity penalty to GRPO, redistributing probability mass.
result UCPO improves Pass@K and diversity while maintaining competitive Pass@1 accuracy.

LOCUS separates brain network connectivity matrices efficiently.

problem High dimensionality, latent sources, and spurious findings in analyzing brain connectivity matrices.
method LOCUS: low-rank structure with uniform sparsity, iterative Node-Rotation algorithm.
result LOCUS achieves more efficient and accurate source separation for connectivity matrices.

New algorithm improves online clustering of bandits with minimal frequency constraints.

problem Online clustering of bandits with non-uniform user frequencies.
method Proposes an efficient algorithm with simple set structures to represent clusters, proving a regret bound free of minimal frequency constraints.
result The new algorithm consistently outperforms existing methods in experiments on synthetic and real datasets.

DA-LSTM adapts LSTM depth to non-uniform data, improving efficiency.

problem Non-uniform information distribution in sequential data cannot be accurately modeled by traditional LSTM.
method Developed DA-LSTM architecture that dynamically adjusts LSTM depth based on information distribution.
result DA-LSTM reduces computation resource usage and convergence time by 41.78% and 46.01% respectively.

Paper studies Wiman-Edge pencil and Wiman curve, providing uniformizations and modular interpretations.

problem Understanding the geometry and uniformization of the Wiman-Edge pencil and Wiman curve.
method Explicit uniformizations of the Wiman-Edge pencil and Wiman curve as quotients of the hyperbolic plane and arithmetic quotients.
result Explicit uniformizations and modular interpretations of the Wiman-Edge pencil and Wiman curve.

The study examines metrics on Riemannian spaces with bounded properties and finds conditions for Lipschitz and uniform bounds.

problem Investigating bounded rough Riemannian metrics and their properties.
method Analyzing the structure of bounded rough Riemannian metrics and finding conditions for Lipschitz and uniform bounds.
result Weak conditions are identified for Lipschitz and uniform bounds on the metrics.

The paper confirms a specific type of Sasakian manifold's structure.

problem Characterizing Sasakian manifolds with nonnegative transverse bisectional curvature.
method Analyzing the Sasakian analogue of Yau's uniformization conjecture.
result 5-dimensional Sasakian manifolds with positive transverse bisectional curvature are CR-biholomorphic to the standard Heisenberg group.

New methods for estimating and inferring nonparametric structural functions and elasticities.

problem Estimating and inferring nonparametric structural functions and their derivatives.
method Data-driven sieve dimension choice and uniform confidence bands construction.
result Optimal estimation and inference procedures with minimax rates of convergence.

The study compares uniform-price and discriminatory auctions in terms of learning difficulty.

problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.

The paper examines sequences of metric spaces converging to compact limits with specific properties.

problem Understanding convergence of metric spaces with compact limits.
method Analyzes sequences of metric spaces with increasing distance functions and uniform bounds, proving convergence under certain conditions.
result Uniform and Gromov-Hausdorff convergence and volume preserving intrinsic flat convergence to compact limits.