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

Trend · papers per month

169338506675 · Jun 202019922001200920172026
48 results for discrete uniform distribution

Discrete diffusion models improve data generation for discrete data like language and graphs.

problem Adapting diffusion models to discrete state spaces for better data generation.
method Formulated as CTMCs, used uniformization of continuous Markov chains for sampling.
result Derive guarantees for sampling from any distribution on a hypercube, aligning with state-of-the-art achievements.

Study on materials with disclinations, limiting their size.

problem Limiting the size of disclinations in materials with symmetries.
method Defining material-uniform hyperelastic bodies with disclinations, rigorously analyzing their properties.
result The size of disclinations is limited by the symmetries of the constitutive relation.

The paper introduces a new discretization of Gaussian curvature on surfaces.

problem Discretizing Gaussian curvature on surfaces with conic singularities.
method Discrete conformal theory and variational principles with constraints.
result Established a discrete uniformization theorem for surfaces with non-positive Euler number.

This paper introduces methods to handle discrete data by dequantization.

problem Handling discrete data in deep learning models.
method Dequantization framework, including importance-weighted and Rényi dequantization objectives, and autoregressive dequantization.
result Improved performance on uniform dequantization distributions and state-of-the-art negative log-likelihood on CIFAR10.

We study the motion of discrete interfaces driven by ferromagnetic interactions in a two-dimensional low-contrast periodic environment, by coupling the minimizing movements approach by Almgren, Taylor and Wang and a discrete-to-continuum analysis. As in a recent paper by Braides and Scilla dealing with high-contrast pe…

2014-07-25abs ↗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 methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

We study distribution testing with communication and memory constraints in the following computational models: (1) The {\em one-pass streaming model} where the goal is to minimize the sample complexity of the protocol subject to a memory constraint, and (2) A {\em distributed model} where the data samples reside at mul…

2019-06-11abs ↗pdf ↗

Paper formulates mutual information optimal control for discrete-time systems.

problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.

The paper establishes a discrete uniformization theorem for surfaces with piecewise hyperbolic metrics.

problem Finding decorated piecewise hyperbolic metrics with prescribed combinatorial curvature.
method Introduced combinatorial α-Ricci flow with surgery to handle potential singularities and prove longtime existence and convergence.
result Existence of decorated piecewise hyperbolic metrics with prescribed combinatorial α-curvature.

GADD accelerates uniform-rate discrete diffusion models by 2 orders of magnitude.

problem Slow sampling in uniform-rate discrete diffusion models.
method Gibbs-based corrector (GADD) that constructs Gibbs posterior likelihoods directly from the concrete score function.
result Achieves an overall sampling complexity of O(polylog(ε1))\mathcal{O}(\mathrm{polylog} (\varepsilon^{-1})).

The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.

problem Finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
method Discrete uniformization theorem, combinatorial α-Yamabe flow, combinatorial α-Calabi flow, edge flipping surgery.
result Longtime existence and convergence of combinatorial α-Yamabe flow and combinatorial α-Calabi flow with surgery.

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 ↗

The paper proves a theorem for discretizing Gaussian curvature on surfaces.

problem Discretizing Gaussian curvature on surfaces with nonpositive Euler number.
method Discrete conformal theory and variational principles with constraints.
result Each decorated piecewise Euclidean metric on surfaces with nonpositive Euler number is discrete conformal to a metric with a specific discrete curvature constant.

Adaptive sampling improves graph diffusion models by maintaining uniform information speed.

problem Standard diffusion models overlook non-homogeneous dynamics on complex manifolds.
method Information-geometric framework using Fisher-Rao metric and Drift Variation Score (DVS).
result DVS solver ensures uniform rate of distributional change, improving structural fidelity and efficiency.

Discrete conformal maps on surfaces with vertex decorations are studied.

problem Discrete conformal equivalence for decorated piecewise Euclidean surfaces.
method Intimate relationship between decorated PE-surfaces, canonical tessellations of hyperbolic surfaces, and convex hyperbolic polyhedra; concave variational principle.
result Proof of discrete uniformization theorem for decorated PE-surfaces.

The paper analyzes sampling efficiency of discrete diffusion models, providing sharp and adaptive guarantees.

problem Theoretical foundations of discrete diffusion models, especially sampling efficiency.
method Continuous-time Markov chain (CTMC) formulation, ττ-leaping-based samplers, effective total correlation.
result The ττ-leaping algorithm achieves an iteration complexity of order ildeO(d/ε) ilde O(d/\varepsilon) for uniform discrete diffusion, improving existing bounds by a factor of dd.

There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example, over a domain of size nn, distinguishing the uniform distribution from distrib…

2019-07-06abs ↗pdf ↗

Unified framework for discrete diffusion modeling with flexible noising processes.

problem Efficient modeling of large discrete state spaces with arbitrary corruption dynamics.
method Generalized Discrete Diffusion from Snapshots (GDDS) framework that supports uniformization for fast noising and snapshot-based ELBO for reverse process.
result GDDS outperforms existing discrete diffusion methods in training efficiency and generation quality.

We consider the discrete representations of 3-manifold groups into PU(2,1)PU(2,1) that appear in the Falbel-Koseleff-Rouillier census, such that the peripheral subgroups have cyclic unipotent holonomy. We show that two of these representations have conjugate images, even though they represent different 3-manifold groups. Th…

2014-10-02abs ↗pdf ↗

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature me…

2013-09-17abs ↗pdf ↗

A Neural Network (NN) based numerical method is formulated and implemented for solving Boundary Value Problems (BVPs) and numerical results are presented to validate this method by solving Laplace equation with Dirichlet boundary condition and Poisson's equation with mixed boundary conditions. The principal advantage o…

2019-09-24abs ↗pdf ↗

Investment strategy optimization from discrete to continuous models.

problem Optimizing investment strategies and stopping times in both continuous and discrete settings.
method Characterized value functions via quadratic reflected BSDEs for continuous case, discretized BSDEs for discrete case, and derived uniform convergence rates.
result Uniform convergence and rate from discrete to continuous quadratic reflected BSDEs.

Foster and Hart proposed an operational measure of riskiness for discrete random variables. We show that their defining equation has no solution for many common continuous distributions including many uniform distributions, e.g. We show how to extend consistently the definition of riskiness to continuous random variabl…

2013-01-08abs ↗pdf ↗

Driven by the need for parallelizable hyperparameter optimization methods, this paper studies \emph{open loop} search methods: sequences that are predetermined and can be generated before a single configuration is evaluated. Examples include grid search, uniform random search, low discrepancy sequences, and other sampl…

2017-06-06abs ↗pdf ↗

Unified framework for convergence of discrete diffusion models without state space size dependence.

problem Fundamental limitations in existing convergence theory for discrete diffusion models, especially under singular priors and large vocabularies.
method Unified adjoint-equation-based framework that establishes dimension-free convergence guarantees in any integral probability metric (IPM).
result First dimension-free convergence bounds applicable to both masked and uniform priors, free of state space size SS.

Optimal transport is #P-hard when components are independent, even with approximate solutions.

problem Computational complexity of optimal transport with independent marginals.
method Proved #P-hardness and developed a pseudo-polynomial time approximation algorithm.
result Optimal transport is #P-hard even with independent components and approximate solutions.

The study examines arithmetic orbifolds and their length spectra, proving uniform discreteness and linear dependence of geodesic lengths.

problem Uniform discreteness and linear dependence of geodesic lengths in arithmetic orbifolds.
method Analyzes Salem numbers and Lie groups to prove uniform discreteness, and uses geometric properties to show linear dependence of geodesic lengths.
result Existence of a positive constant δ(X) such that squares of lengths of closed geodesics shorter than δ must be pairwise linearly dependent over Q.

Optimal testing of discrete distributions with high probability, achieving sample complexity bounds.

problem Testing discrete distributions with high probability accuracy.
method Characterizing sample complexity as a function of parameters like δ, providing sample-optimal testers.
result Optimal algorithms for closeness and independence testing, achieving within constant factors of information-theoretic lower bounds.

A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying …

2014-01-18abs ↗pdf ↗

Random matrix ensembles yield uniform distributions on manifolds.

problem Understanding distributions of vectors in random matrix ensembles.
method Analyzing eigenvalues, singular values, and Autonne-Takagi vectors of various random matrix ensembles.
result Uniform distributions on specific manifolds for different types of random matrix ensembles.

We prove the existence of positive lower bounds on the Cheeger constants of manifolds of the form X/ΓX/Γ where XX is a contractible Riemannian manifold and $Γ<\Isom(X)$ is a discrete subgroup, typically with infinite co-volume. The existence depends on the L2L^2-Betti numbers of ΓΓ, its subgroups and of a uniform latt…

2013-03-24abs ↗pdf ↗

We establish a uniform comparison between the spectrum of the rough Laplacian (acting on sections of a vector bundle of complex rank one or of harmonic curvature) with the spectrum of a discrete operator (a generalization of a discrete magnetic Laplacian added with a potential) acting on a finite dimensional space comi…

2006-09-21abs ↗pdf ↗

We study Betti numbers of sequences of Riemannian manifolds which Benjamini-Schramm converge to their universal covers. Using the Price inequalities we developed elsewhere, we derive two distinct convergence results. First, under a negative Ricci curvature assumption and no assumption on sign of the sectional curvature…

2019-09-12abs ↗pdf ↗