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

Trend · papers per month

3570105140 · Jun 202019922001200920182026
48 results for Tessellated Kernel

New algorithm optimizes tessellated kernels for larger datasets and improved performance.

problem Limited accuracy and complexity in machine learning algorithms based on kernel optimization.
method 2-step algorithm for optimizing tessellated kernels, scaling to 10,000 data points and extending to regression.
result Significant improvement in performance over Neural Nets and SimpleMKL with similar computation time.

Study groups of piecewise isometries in tessellations of Euclidean space.

problem Understanding the structure of groups formed by cutting and gluing tessellations.
method Proving structure results about groups of piecewise isometries of tessellations, including elementary amenability.
result Groups of piecewise isometries of tessellations are elementary amenable.

Up to isomorphism there are six fixed-point free crystallographic groups in Euclidean Space generated by twists (screw motions). In each case, an orientable 3-manifold is obtained as the quotient of E3 by such a group. The cubic tessellation of E3 induces tessellations on each such manifold. These tessellations of the …

2015-05-01abs ↗pdf ↗

By regular tessellation, we mean any hyperbolic 3-manifold tessellated by ideal Platonic solids such that the symmetry group acts transitively on oriented flags. A regular tessellation has an invariant we call the cusp modulus. For small cusp modulus, we classify all regular tessellations. For large cusp modulus, we pr…

2014-06-11abs ↗pdf ↗

Study compares tessellation strategies for taxi demand-supply forecasting models.

problem Improving taxi demand-supply forecasting using neural networks.
method Compared Voronoi tessellation and Geohash tessellation for LSTM models.
result Variable-sized polygon tessellation yields superior performance in LSTM models.

Hybrid tessellation improves taxi demand forecasting accuracy.

problem Improving taxi demand forecasting accuracy through optimal spatial partitioning.
method Compared Geohash and Voronoi tessellations, then developed a hybrid HEDGE-based strategy.
result Hybrid tessellation outperforms individual strategies, achieving above 80% accuracy.

We present an explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F(n) embedded in CP3 defined by the equation z0^n + z1^n + z2^n + z3^n = 0 in the standard homogeneous coordinates [z0, z1, z2, z3], where n is any positive integer. Note that F(4) in particular is a K3 surface. Our tessellation…

2008-04-20abs ↗pdf ↗

The article describes how decorations on hyperbolic surfaces lead to unique tessellations and decompositions.

problem Understanding the geometric structure of decorated hyperbolic surfaces.
method Developing a characterisation of canonical tessellations and dual decompositions using hyperbolic geometry.
result Decorations on hyperbolic surfaces induce unique canonical tessellations and dual decompositions.

The spectral properties of p-forms on the fundamental domains of regular tesselations of the d-dimensional sphere are discussed. The degeneracies for all ranks, p, are organised into a double Poincare series which is explicitly determined. In the particular case of coexact forms of rank (d-1)/2, for odd d, it is shown …

2006-01-13abs ↗pdf ↗

The paper constructs tessellations of the hyperbolic plane for surfaces with marked points.

problem Constructing tessellations of the hyperbolic plane for surfaces with marked points.
method Constructs tessellations of the Poincaré upper half plane for half-translation surfaces with marked points.
result The tessellation Π(M,Σ)Π(M,Σ) is equivariant and invariant under the action of PSL(2,R)\mathrm{PSL}(2,\mathbb{R}) and half-translations.

Develops a new non-adversarial framework for better generative models.

problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.

The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and versions (necessarily modified from the Euclidean setting) of the empty circumsp…

2013-08-22abs ↗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.

Improved taxi demand-supply forecasts using graph-based LSTM.

problem Accurate taxi demand-supply forecasting with complex spatial and temporal patterns.
method Investigated impact of spatial partitioning techniques (Voronoi vs. Geohash) on LSTM network performance.
result GraphLSTM offers competitive performance against ConvLSTM, at lower complexity, across real-world data sets.

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.

An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right, or 120-isosceles triangle; a 120-rhombus; a 60-90-120 kite; or a regular hexagon…

2009-08-22abs ↗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.

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 ↗

Study jigsaw constructions of hyperbolic lattices and answer questions on arithmeticity and pseudomodularity.

problem Constructing and analyzing non-commensurable, non-uniform, non-arithmetic lattices in hyperbolic geometry.
method Hyperbolic jigsaw construction and recursive formulas for tessellations.
result Demonstration of recursive formula for tessellation of hyperbolic plane, generalizing Farey addition.

This work uses stochastic geometry to improve STIT processes in machine learning.

problem Improving STIT processes for efficient and consistent machine learning applications.
method Utilizing tools from stochastic geometry to characterize kernels and obtain consistency results.
result Generalization of STIT processes and their kernels, leading to improved machine learning methods.

The analytic torsion is computed on fixed-point free and non fixed-point free factors (tessellations) of the three--sphere. We repeat the standard computation on spherical space forms (Clifford-Klein spaces) by an improved technique. The transformation to a simpler form of the spectral expression of the torsion on sphe…

2009-04-06abs ↗pdf ↗

The study classifies graphs on surfaces with positive curvature properties.

problem Classifying graphs on surfaces with specific curvature properties.
method Using medial graphs and classification techniques.
result Complete classification of graphs on surfaces with positive Forman curvature and corner curvature.

We prove that every complete finite-volume hyperbolic 3-manifold MM that is tessellated into (embedded) right-angled regular polyhedra (dodecahedra or ideal octahedra) embeds geodesically in a complete finite-volume connected orientable hyperbolic 4-manifold WW, which is also tessellated into right-angled regular pol…

2015-10-21abs ↗pdf ↗

The main goal of this paper is to define a 1-1 correspondence between between substitution tilings constructed by inflation and the arithmetic of positional representation in the underlying real vector space. It introduces a generalization of inflationary tessellations to equivalence classes of tiles. Two tiles belong …

2015-05-03abs ↗pdf ↗

A finite subset S of a closed hyperbolic surface F canonically determines a "centered dual decomposition" of F: a cell structure with vertex set S, geodesic edges, and 2-cells that are unions of the corresponding Delaunay polygons. Unlike a Delaunay polygon, a centered dual 2-cell Q is not determined by its collection …

2011-03-23abs ↗pdf ↗

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.