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

Trend · papers per month

53107160213 · Jun 202019922001200920172026
48 results for 2D grid mapping

A novel method compresses point cloud attributes by folding them onto a 2D grid.

problem Efficiently compressing point cloud attributes for storage and transmission.
method Interpreting point clouds as 2D manifolds, folding onto a grid, and mapping attributes to the grid using optimized methods.
result The proposed folding-based approach achieves performance comparable to state-of-the-art codecs.

The paper studies how grid cell patterns emerge in neural networks.

problem Understanding how grid cells in the brain form hexagonal firing patterns.
method Training recurrent neural networks with conformal normalization of velocity inputs.
result Conformal normalization is crucial for the emergence of hexagonal grid patterns in neural networks.

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

The paper analyzes how grid cells perform path integration and learns hexagon grid patterns.

problem Understanding how grid cells perform path integration calculations.
method Theoretical analysis of a general representation model of path integration by grid cells, identifying group representation and isotropic scaling conditions.
result The learned model of hexagon grid patterns is capable of accurate long distance path integration.

2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as…

2019-08-05abs ↗pdf ↗

Deep learning speeds spectral density estimation for large 2D/3D grids.

problem Computational challenges in estimating spectral densities for large grids.
method Deep learning neural network for spectral density estimation.
result Deep learning estimator is a universal approximator and faster than existing methods.

Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.

problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.

Study of harmonic maps on 2D simplicial complexes, proving existence and regularity.

problem Existence and regularity of harmonic maps between 2D simplicial complexes.
method Extending previous work, study metrics conformal to flat or ideal hyperbolic, proving existence, uniqueness, and regularity of harmonic maps.
result Existence, uniqueness, and regularity results for harmonic maps between 2D simplicial complexes.

We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.

2015-04-05abs ↗pdf ↗

Study on p-biharmonic maps from gradient Ricci solitons, focusing on 2D cigar soliton.

problem Understanding p-biharmonic maps on gradient Ricci solitons.
method Analyzing p-biharmonic maps from gradient Ricci solitons, specifically 2D cigar soliton.
result Obtained results on p-biharmonic maps from gradient Ricci solitons, particularly on 2D cigar soliton.

pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.

problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.

Autonomous driving requires 3D perception of vehicles and other objects in the in environment. Much of the current methods support 2D vehicle detection. This paper proposes a flexible pipeline to adopt any 2D detection network and fuse it with a 3D point cloud to generate 3D information with minimum changes of the 2D d…

2018-02-12abs ↗pdf ↗

We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…

2011-04-30abs ↗pdf ↗

Node2Grids uncouples GCN training for large graphs, saving memory and computation.

problem GCNs' coupled training framework limits flexibility and scalability for large-scale graphs.
method Node2Grids maps coupled graph data into independent grid-like data for efficient processing.
result Node2Grids achieves comparable results to GCNs while saving memory and computation.

Efficiently prices American options with multiple assets using sparse grids.

problem Pricing American options with multiple underlying assets efficiently.
method Dynamic programming formulation followed by sparse grid interpolation.
result Sparse grids reduce the number of interpolation points and maintain function smoothness.

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose topology is easy to compute, under a birational mapping of the plane or the spac…

2018-12-30abs ↗pdf ↗

Bayesian deep learning improves geostatistical mapping with auxiliary data.

problem Traditional geostatistical methods are limited in feature learning and uncertainty estimation.
method Deep neural networks learn complex relationships from auxiliary data for probabilistic mapping.
result Deep learning produces detailed, probabilistic maps with uncertainty estimates.

We build a connection between topology of smooth 4-manifolds and the theory of topological modular forms by considering topologically twisted compactification of 6d (1,0) theories on 4-manifolds with flavor symmetry backgrounds. The effective 2d theory has (0,1) supersymmetry and, possibly, a residual flavor symmetry. …

2018-11-19abs ↗pdf ↗

The paper finds a family of 2D surfaces where Laplacian and Dirichlet-to-Neumann commute.

problem Finding surfaces with commuting boundary Laplacian and Dirichlet-to-Neumann map.
method Investigated 2D submanifolds of R^2, classified surfaces of genus 0 or with k≥3 boundary components.
result One-parameter family of 2D submanifolds with commuting Laplacian and Dirichlet-to-Neumann map.

We study the periods mapping from the moduli space of real hyperelliptic curves with marked point on an oriented oval to the euclidean space. The mapping arises in the analysis of Chebyshev construction used in the constrained optimization of the uniform norm of polynomials and rational functions. The decomposition of …

2016-06-10abs ↗pdf ↗

The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If GG is an infinite graph with cofinite free Zd{\mathbb Z}^d-symmetry, then the logarithmic Mahler measure m(Δ)m(Δ) of its Laplacian polynomial ΔΔ is the …

2016-02-08abs ↗pdf ↗

New method characterizes surface quadrilateral layouts as special immersions.

problem Characterize surface quadrilateral layouts mathematically.
method Characterizes quadrilateral layouts as special immersions of a cut representation of the surface into the Euclidean plane.
result Mathematically describes and generalizes integer grid maps.

We present a new method of learning a continuous occupancy field for use in robot navigation. Occupancy grid maps, or variants of, are possibly the most widely used and accepted method of building a map of a robot's environment. Various methods have been developed to learn continuous occupancy maps and have successfull…

2019-10-18abs ↗pdf ↗