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

Trend · papers per month

3.1%6.3%9.4%12.5% · Jun 199519922001200920182026
48 results for cell grid architecture

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.

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.

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.

C2G-Net improves image classification of similar objects like cells.

problem Classifying images with many similar objects efficiently and interpretably.
method Combines image compression and a CNN with reduced parameters.
result C2G-Net achieves similar accuracy to conventional CNNs but with reduced training time and improved interpretability.

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.

A model for grid cells using vectors and matrices for position and motion.

problem Representing self-position and motion in a high-dimensional space.
method Vector-matrix multiplication, magnified local isometry, and global adjacency kernel.
result The model can learn hexagon patterns and correct errors.

New insights into data geometry reveal manifold structure in grid-cell activity.

problem Understanding the roles of different dimensions in data geometry.
method Generalised Hanson-Wright inequality and random function model analysis.
result Persistence diagrams reveal latent homology and manifold structure.

Extends NAS to learn both intra-cell and inter-cell architectures for language modeling.

problem Limited NAS systems restrict search to recurrent or convolutional cells.
method Designs a joint learning method to perform intra-cell and inter-cell NAS simultaneously.
result Significantly outperforms a strong baseline on PTB and WikiText data.

CSA fills a gap in RLVR-trained LLM deployment by providing anytime-valid selective risk control.

problem Deployment of RLVR-trained LLMs in regulated organizations requires a safety certificate for every round without waiting for long-run averages.
method CSA uses a (test statistic, validity guarantee, deployment rule) framework to fill the gap, maintaining a Ville-type e-process per threshold on a Bonferroni grid.
result CSA provides the first anytime-valid selective risk control for RLVR-trained LLMs, matching the long-run average certification rate and satisfying pathwise validity and non-refusing deployment on every cell.

Algorithm discovers dynamic cell structures for better neural network performance.

problem Finding optimal neural network architectures for diverse data samples and time steps.
method Combines recurrent and recursive neural networks to dynamically search for customized cell structures.
result Achieves better prediction accuracy compared to existing models.

Space2Vec learns multi-scale spatial representations from grid cell insights.

problem Encoding spatial features with varying scales from GIS data.
method Proposes Space2Vec, a multi-scale representation learning model using grid cell insights.
result Space2Vec outperforms baselines in predicting POI types and image classification with geo-locations.

NAS favors wide and shallow cell structures, leading to fast convergence but not necessarily better generalization.

problem Understanding and improving the architectures generated by NAS algorithms.
method Empirical and theoretical study of existing NAS algorithms (DARTS, ENAS) and their architectures.
result Existing NAS algorithms favor wide and shallow cell structures, leading to fast convergence but not necessarily better generalization.

This paper compares Grid Search, Random Search, and Genetic Algorithm for NAS.

problem Hyperparameter optimization for neural architecture search.
method Comparison of Grid Search, Random Search, and Genetic Algorithm.
result Genetic Algorithm outperforms Grid Search and Random Search in terms of accuracy and execution time.

M-CaStLe discovers causal structures in multivariate space-time data.

problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.

New model predicts weekly earthquakes with better tail risk assessment.

problem Violation of Poisson assumption in seismic data.
method Neural network for per-cell overdispersion estimation.
result 8.6% reduction in mean pinball deviation, 12.5% lower CRPS in tail events.

Better neural arithmetic logic units improve cell counting model generalization.

problem Neural networks struggle with high cell counts outside training data range.
method Introduced Neural Arithmetic Logic Units (NALU) for arithmetic operations in existing architectures.
result Improved cell counting accuracy for higher numeric ranges with better generalization.

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

This paper proposes a new hashing-based KNN technique for faster nearest neighbor selection.

problem Slowness of KNN in big datasets due to searching entire dataset.
method Divide data space into subcells, use hashing to map data points, and select nearest neighbors layer by layer.
result The proposed technique offers competitive performance with KNN and KDtree while significantly improving time efficiency.

Input-cell attention improves RNN saliency detection over time.

problem Vanishing saliency in RNNs makes them unreliable for detecting important features at arbitrary time intervals.
method Proposes input-cell attention, a novel RNN cell structure that uses a fixed-size matrix embedding to attend to different inputs from current or previous time steps.
result Input-cell attention produces a saliency map that can detect important features regardless of their occurrence in time.

New model generates realistic single-cell gene expression data.

problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.

Interactive framework identifies insights in power grid maps.

problem Manual identification of insights in power grid maps is laborious and expertise-dependent.
method Proposes an interactive framework using DenseU-Hierarchical VAE to learn and modulate representations.
result Framework outperforms baseline models in identifying and annotating insights.

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid models. A data set of temporal event sequences can be represented as a data set of three-dimensional points, each point is defined by three varia…

2015-05-06abs ↗pdf ↗

Dynamic cell-free networks reduce complexity in serving many devices with distributed APs and DRL.

problem Designing efficient cell-free networks with many devices and APs.
method Dynamic architecture, SIC, DAS, DRL for optimization.
result DRL significantly improves performance in dynamic cell-free networks.

A novel circuit motif uses sister cells for inference with correlated priors.

problem Structured priors in neural systems pose architectural challenges.
method Proposes a novel circuit motif using sister cells to implement correlated priors without direct interactions.
result Demonstrates the efficacy of correlated priors for inference in noisy environments.

Simulating fluid flow in geological formations requires mesh generation, lithology mapping to the cells, and computing geometric properties such as normal vectors and volume of cells. The purpose of this research work is to compute and process the geometrical information required for performing numerical simulations in…

2006-07-17abs ↗pdf ↗

A novel method visualizes higher-dimensional spaces using hyperbolic geometry.

problem Challenges in visualizing higher-dimensional spaces.
method Interactive visualization of higher-dimensional grids based on hyperbolic geometry.
result Our method shows the whole higher-dimensional space at once and avoids disadvantages of previous methods.

The counting grid is a grid of microtopics, sparse word/feature distributions. The generative model associated with the grid does not use these microtopics individually. Rather, it groups them in overlapping rectangular windows and uses these grouped microtopics as either mixture or admixture components. This paper bui…

2015-03-12abs ↗pdf ↗

Power grids are one of the most important components of infrastructure in today's world. Every nation is dependent on the security and stability of its own power grid to provide electricity to the households and industries. A malfunction of even a small part of a power grid can cause loss of productivity, revenue and i…

2017-11-08abs ↗pdf ↗

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

FNO model predicts GCS pressure fields with 81% less data, even with limited high-fidelity data.

problem Accurate prediction of complex physical behaviors in large-scale 3D geological carbon storage problems with limited data.
method Multi-fidelity Fourier Neural Operator (FNO) for efficient training with multi-fidelity datasets.
result Multi-fidelity FNO model predicts pressure fields with reasonable accuracy even with limited high-fidelity data.

CT improves neural network performance on cell complex data.

problem Improving predictive performance of neural networks on complex data.
method Introducing the Cellular Transformer (CT) that generalizes graph-based transformers to cell complexes.
result CT achieves state-of-the-art performance on cell complex datasets without complex enhancements.