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

Trend · papers per month

7132026 · Jun 202019922001200920172026
48 results for Voronoi cells

New cell structure on O(3)/O(1)3O(3)/O(1)^3 derived from injectivity radius computation.

problem Constructing equivariant cell structures on flag manifolds.
method Injectivity radius computation and Dirichlet-Voronoi domains.
result New S3\mathfrak{S}_3-equivariant cell structure on O(3)/O(1)3O(3)/O(1)^3.

Algorithm finds adversarial examples for k-NN classifiers using Voronoi diagrams.

problem Ensuring robustness of k-NN classifiers against adversarial attacks.
method Geometric approach expanding outwards from input points to find minimum-norm adversarial examples.
result Our method outperforms existing approaches on various datasets.

Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

Proposes a new adversarial model to avoid accuracy vs. adversarial accuracy tradeoff.

problem Inherent tradeoff between accuracy and adversarial accuracy in existing adversarial robustness definitions.
method Introduces Voronoi-epsilon adversary that balances perturbation constraints.
result Voronoi-epsilon adversary avoids accuracy vs. adversarial accuracy tradeoff even with large εε.

Adversarial examples are a pervasive phenomenon of machine learning models where seemingly imperceptible perturbations to the input lead to misclassifications for otherwise statistically accurate models. We propose a geometric framework, drawing on tools from the manifold reconstruction literature, to analyze the high-…

2019-05-02abs ↗pdf ↗

The paper proves actions of lattices in higher rank groups have cost one.

problem Fixed price question for higher rank semisimple Lie groups.
method Low intensity Poisson point processes and geometry of Voronoi tessellations.
result Proves all probability measure preserving actions of lattices in higher rank groups have cost one.

We prove an optimal systolic inequality for CAT(0) metrics on a genus~2 surface. We use a Voronoi cell technique, introduced by C.~Bavard in the hyperbolic context. The equality is saturated by a flat singular metric in the conformal class defined by the smooth completion of the curve y^2=x^5-x. Thus, among all CAT(0) …

2005-01-02abs ↗pdf ↗

We establish the Gaussian Multi-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose Rn\mathbb{R}^n into qq cells of prescribed (positive) Gaussian measure when 2qn+12 \leq q \leq n+1, is to use a "simplicial cluster", obtained from the Voronoi cells of qq equidistant points. Moreover, we prove that…

2018-05-28abs ↗pdf ↗

In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi diagrams and compactifications of configuration spaces. We study moving and colliding p…

2002-10-22abs ↗pdf ↗

New insights into the top-K sparse softmax gating function for deep learning.

problem Understanding the theoretical effects of the top-K sparse softmax gating function on density and parameter estimations.
method Using a Gaussian mixture of experts, novel loss functions, and theoretical analysis.
result The convergence rates of density and parameter estimations are parametric under certain conditions, but slow under over-specified models.

The lattice of integer flows of a graph is known to determine the graph up to 2-isomorphism (work of Su--Wagner and Caporaso--Viviani). In this paper we give an algorithmic construction of the graphic matroid $\calM(G)$ of a graph GG, given its lattice of integer flows $\calF(G)$. The algorithm can then be applied to …

2016-11-19abs ↗pdf ↗

A hex sphere is a singular Euclidean sphere with four cones points whose cone angles are (integer) multiples of 2*pi/3 but less than 2*pi. Given a hex sphere M, we consider its Voronoi decomposition centered at the two cone points with greatest cone angles. In this paper we use elementary Euclidean geometry to describe…

2010-10-29abs ↗pdf ↗

Study on discrete Gaussian curvature for polyhedral surfaces.

problem Discretization of Gaussian curvature for polyhedral surfaces.
method Generalization of discrete conformal equivalence to define discrete Gaussian curvature and classify polyhedral surfaces.
result Existence of polyhedral surfaces with constant discrete Gaussian curvature in every discrete conformal class.

New algorithm for computing Veech groups from translation surfaces.

problem Computing Veech groups for translation surfaces.
method Infinite translation surface containing copies of all surfaces in a stratum; associated affine automorphisms of the infinite surface map marked segments to other pairs of segments.
result Explicit hyperbolic ball condition for Fuchsian groups to agree with their Dirichlet domain.

Study homogenizes equations on parallelizable manifolds using tensor localization and periodicity.

problem Homogenizing oscillating linear elliptic equations on parallelizable manifolds.
method Two-scale convergence through localization and periodicity induced by geometry.
result Explicit cell formulae for the homogenization limit and a theory of two-scale convergence of tensors.

Constructs an explicit cycle in arithmetic group cohomology.

problem Cohomology of SLn(Z)_n(\mathbb{Z}) at virtual cohomological dimension.
method Geometric rigidity of Voronoi tessellations and abstract framework for polyhedral tessellations.
result Explicit canonical cycle in top-dimensional homology of Voronoi complex.

New matching estimators correct bias in multivariate settings without smoothing parameters.

problem Bias in nearest-neighbor and matching estimators in multiple dimensions.
method Polynomial least squares fits on Voronoi tessellations.
result Novel estimators converge at n\sqrt{n} rate under mild smoothness assumptions.

Deviance Voronoi residuals improve earthquake insurance risk assessment.

problem Assessing earthquake insurance risk using spatio-temporal point process models.
method Extended Voronoi residuals and created simulation-based approach.
result Proposed formula for country-wide minimum capital test.

Motivated by the prediction of cell loads in cellular networks, we formulate the following new, fundamental problem of statistical learning of geometric marks of point processes: An unknown marking function, depending on the geometry of point patterns, produces characteristics (marks) of the points. One aims at learnin…

2018-12-19abs ↗pdf ↗

The paper provides convergence bounds for approximating a distribution using point clouds.

problem Approximating a distribution using discrete points with minimal Wasserstein distance.
method Lloyd's algorithm with Power cells, analyzed using gradient descent.
result Explicit upper bounds for the convergence speed of the Lloyd-type algorithm.

In this study the Voronoi interpolation is used to interpolate a set of points drawn from a topological space with higher homology groups on its filtration. The technique is based on Voronoi tessellation, which induces a natural dual map to the Delaunay triangulation. Advantage is taken from this fact calculating the p…

2019-11-08abs ↗pdf ↗

Generates infinite-depth hierarchical clusters from few examples.

problem Inadequate finite-sample clustering methods for fine-scale hierarchical structures.
method Classification fields generated by a local refinement rule, approximated by predictors.
result Learned predictors can approximate infinite-depth hierarchical structures.

Confirms isoperimetric conjectures on R^n and S^n for q ≤ min(5, n+1).

problem Minimizing total perimeter among bubbles enclosing prescribed volume.
method Tandem consideration of R^n and S^n, Möbius geometry, conformal Killing fields.
result Spherical interfaces and connected cells in minimizers, resolving Heppes conjecture.

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

Given a set S of n points in general position, we consider all k-th order Voronoi diagrams on S, for k=1,...,n, simultaneously. We deduce symmetry relations for the number of faces, number of vertices and number of circles of certain orders. These symmetry relations are independent of the position of the sites in S. As…

1999-05-04abs ↗pdf ↗

Bayesian model captures mean and variance of response variables.

problem Complex, predictor-dependent relationships and heteroscedastic patterns in data.
method Sum-of-tessellations for mean, product-of-tessellations for variance.
result Model captures nuanced variance structures and provides reliable predictive uncertainty.

Quantized Variational Inference improves ELBO optimization with fast convergence.

problem Maximizing Evidence Lower Bound (ELBO) for variational inference.
method Optimal Voronoi Tesselation for variance-free gradients, Richardson extrapolation for asymptotic improvement.
result Quantized Variational Inference leads to fast convergence with comparable computational cost.

Standard bubbles and partitions are stable in various model spaces.

problem Stability of standard bubbles and partitions in different model spaces.
method New conjugated Brascamp-Lieb inequality and conformally flattening boundary potential.
result Stability of standard bubbles and partitions in Rn\mathbb{R}^n, Sn\mathbb{S}^n, and Hn\mathbb{H}^n.

The paper analyzes how companies' investments before crises affect their performance after crises.

problem Understanding how companies' investments before financial crises impact their performance afterward.
method Cluster analysis using Voronoi tessellation with statistical outliers identified.
result Positive investments before crises are associated with better performance after crises.

Study spider mechanism configuration spaces using squared distance function.

problem Understand configuration spaces of spider mechanisms.
method Use Morse theory of squared distance function from body to fixed point.
result List and describe critical manifolds of squared distance function as products of polygon spaces.

New method reduces uncertainty in high-dimensional circuits by automatically determining tensor rank and adaptive sampling.

problem Uncertainty quantification in high-dimensional circuits due to fabrication process variations.
method Tensor regression with q/2\ell_{q}/ \ell_{2} group-sparsity regularization for rank determination and adaptive sampling.
result Captures uncertainty with only 100-600 simulation samples for 19-100 random variables.

A new framework detects anomalies in structured data.

problem Detecting anomalies in samples not conforming to low-dimensional manifolds.
method Preference Isolation Forest (PIF) framework combining adaptive isolation methods and preference embedding.
result Anomalies identified as isolated points in a high-dimensional preference space.

For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain.

2000-04-01abs ↗pdf ↗

A new method learns quantization boundaries in continuous space using tessellation.

problem Mapping between discrete and continuous distributions is difficult.
method Constructs normalizing flows on convex polytopes with exact likelihood evaluations.
result Improves likelihood evaluation and quantization learning across various data modalities.

Two methods using low-discrepancy points improve data compression for neural networks.

problem Efficiently compress large datasets for neural network training.
method Two methods based on low-discrepancy points: digital nets with averaging and clustering.
result Second method outperforms supercompress in compression error and neural network accuracy.