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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for regular lattice data

New method estimates spatial weights matrix for lattice data, improving prediction accuracy.

problem Estimating spatial dependence structure for regular lattice data.
method Adaptive lasso with cross-sectional resampling to estimate sparse spatial weights matrix.
result Improves prediction accuracy of nitrogen dioxide concentrations.

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building associated to a graph product of finite groups, a uniform lattice is commensurable with…

2009-04-17abs ↗pdf ↗

Study Poisson boundaries of building lattices and generalize rigidity results.

problem Understanding Poisson boundaries of building lattices and their rigidity properties.
method Proved Poisson boundaries and used them to generalize rigidity results.
result Generalized rigidity results for morphisms and cocycles from lattices in buildings to groups with negative curvature.

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differen…

2007-07-25abs ↗pdf ↗

Data compression speeds up machine learning loss calculations.

problem Computational demand in calculating mean squared error for large datasets.
method Use rank-1 lattices to compress data, assigning weights based on original data and responses.
result Our QMC data compression algorithms can lead to arbitrary high convergence rates for smooth functions.

We study cocompact lattices with dense projections in a product G1×G2G_1 \times G_2 of locally compact groups and show, under the assumption that each GiG_i is a closed subgroup of the automorphism group Aut(Ti)Aut(T_i) of a regular tree satisfying certain local transitivity conditions, that such a lattice is contained in only…

2013-05-21abs ↗pdf ↗

Study flat metrics from right prisms, finding non-lattice surfaces with translation coverings.

problem Analyzing flat metrics from right regular prisms.
method Viewing prisms as n-differentials and analyzing unfoldings, proving translation coverings to hyperelliptic surfaces.
result Non-lattice surfaces admit translation coverings to hyperelliptic surfaces, allowing explicit computation of orbit closures and counting problems.

Investigates methods to regularize quantile regression for accurate predictions.

problem Improving accuracy and fairness in quantile regression predictions.
method Various regularization techniques including expected pinball loss, monotonicity constraints, and rate constraints.
result Deep lattice networks can maintain non-crossing quantiles and improve calibration and fairness.

Paper proves rigidity of Doyle spirals in hexagonal lattice circle packings.

problem Proving Doyle conjecture for hexagonal lattice circle packings.
method Using Liouville theorem of discrete harmonic functions based on logarithmic radii ratio observation.
result Proves rigidity of Doyle spirals in hexagonal lattice circle packings with bounded radii ratios.

We study tt*-geometry on the classifying space for regular singular TERP-structures, e.g., Fourier-Laplace transformations of Brieskorn lattices of isolated hypersurface singularities. We show that (a part of) this classifying space can be canonically equipped with a hermitian structure. We derive an estimate for the h…

2007-12-21abs ↗pdf ↗

This paper solves PDEs for embedding discrete lattices into smooth manifolds.

problem Embedding discrete lattices into smooth manifolds while preserving geometric and topological properties.
method Rigorous mathematical framework and analysis of partial differential equations (PDEs).
result Existence and regularity of solutions to PDEs under initial boundary conditions.

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.

Improved speech recognition for voice assistants by analyzing speech data.

problem Reducing false triggers in speech-enabled assistants.
method Post-processing LVCSR hypothesis lattice with a Bidirectional Lattice Recurrent Neural Network (LatticeRNN).
result LatticeRNN significantly improves detection accuracy over traditional methods.

We define an infinite series of translation coverings of Veech's double-n-gon for odd n greater or equal to 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular n-gon for even n greater or equal to 8. These families give rise to expl…

2010-05-25abs ↗pdf ↗

Study finds the spectrum of a cubic Dirac operator on specific oscillator group manifolds.

problem Determining the spectrum of a cubic Dirac operator on oscillator group manifolds.
method Explicit decomposition of the regular representation and calculation of eigenspaces.
result Explicit eigenspaces and spectrum of the cubic Dirac operator determined.

This paper is a contribution to harmonic analysis of compact solvmanifolds. We consider the four-dimensional oscillator group Osc1{\rm Osc}_1, which is a semi-direct product of the three-dimensional Heisenberg group and the real line. We classify the lattices of Osc1{\rm Osc}_1 up to inner automorphisms of Osc1{\rm Osc}_1. F…

2019-11-29abs ↗pdf ↗

Deep convolutional neural networks (CNNs) have shown outstanding performance in the task of semantically segmenting images. However, applying the same methods on 3D data still poses challenges due to the heavy memory requirements and the lack of structured data. Here, we propose LatticeNet, a novel approach for 3D sema…

2019-12-12abs ↗pdf ↗

Novel method for learning Gaussian graphical models from paired data.

problem Learning Gaussian graphical models for dependent groups.
method Introducing twin order to explore the search space more efficiently.
result The twin order makes the model space a distributive lattice, leading to more efficient model exploration.

New risk measures for incomplete markets without lattice structures.

problem Risk measures on incomplete markets without lattice structures.
method Study of risk measures without lattice structures, focusing on tractable dual representations and solid superspaces.
result Existence of a tractable dual representation equivalent to a Fatou-like property, and extension theorems under certain conditions.

New framework for detecting complex interactions in multivariate data.

problem Insufficient pairwise measures fail to capture multivariate data complexities.
method Lattice theory and operator functions to derive higher-order information-theoretic measures.
result Streitberg Information fully characterizes all interactions among dd variables.

We provide examples of towers of covers of cusped hyperbolic 3-manifolds whose exponential homological torsion growth is explicitly computed in terms of volume growth. These examples arise from abelian covers of alternating links in the thickened torus. A corollary is that the spanning tree entropy for each regular pla…

2019-01-22abs ↗pdf ↗

Research on graph representation learning has received a lot of attention in recent years since many data in real-world applications come in form of graphs. High-dimensional graph data are often in irregular form, which makes them more difficult to analyze than image/video/audio data defined on regular lattices. Variou…

2019-09-03abs ↗pdf ↗

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…

2011-11-21abs ↗pdf ↗

Machine learning classifies topological phases in leaky photonic lattices.

problem Classifying topological phases in leaky photonic lattices using limited data.
method A fully connected neural network trained on bulk intensity measurements.
result Accurate determination of topological properties from intensity distributions.

We give a simple example showing that a knot or link diagram that lies in the Z2{\mathbb{Z}}^2 lattice is not necessarily the projection of a lattice stick knot or link in the Z3{\mathbb{Z}}^3 lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the Z2{\mathbb{Z}}^2 lat…

2018-03-09abs ↗pdf ↗