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

Trend · papers per month

14274154 · Jun 202019922001200920172026
48 results for Hippocampal Pyramidal Neurons

Develops LSTM for predicting neuronal dynamics over long time-horizons.

problem Understanding and controlling complex brain behaviors.
method Long Short-Term Memory (LSTM) neural network architecture for multi-time step predictions.
result LSTM improves short time-horizon prediction accuracy and multi-time step predictions of neuronal dynamics.

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

ConformalHDC improves HDC's uncertainty quantification for neuromorphic learning.

problem Lack of rigorous uncertainty quantification in Hyperdimensional Computing.
method Combines conformal prediction with HDC's efficiency, proposing set-valued and point-valued formulations.
result Demonstrates improved robustness and accuracy in decoding neural stimulus information.

The paper analyzes Laplacian pyramids for extending and denoising discrete functions.

problem Analyzing conditions for convergence and stability of Laplacian pyramids.
method Investigates Laplacian pyramids for extension and denoising, providing convergence conditions and stability bounds.
result Mild conditions are provided under which the Laplacian pyramids algorithm converges and stability bounds are proven.

Low level features like edges and textures play an important role in accurately localizing instances in neural networks. In this paper, we propose an architecture which improves feature pyramid networks commonly used instance segmentation networks by incorporating low level features in all layers of the pyramid in an o…

2019-03-16abs ↗pdf ↗

A novel approach for augmenting histopathological images by blending Gaussian-Laplacian pyramids.

problem Data imbalance and inter-patient variability in histopathological images.
method Image blending using Gaussian-Laplacian pyramids to distribute inter-patient variability.
result Promising gains in performance compared to existing data augmentation techniques.

Sequences of correlated binary patterns can represent many time-series data including text, movies, and biological signals. These patterns may be described by weighted combinations of a few dominant structures that underpin specific interactions among the binary elements. To extract the dominant correlation structures …

2019-01-22abs ↗pdf ↗

Pyramid Attention Networks improve image restoration by leveraging self-similarities across scales.

problem Lack of full exploitation of self-similarities in image restoration by recent deep learning methods.
method Introduces a Pyramid Attention module that processes multi-scale feature correspondences to borrow clean signals from coarser levels.
result Pyramid Attention module achieves state-of-the-art results in various image restoration tasks.

Single wide layer followed by a pyramidal structure ensures global convergence in deep networks.

problem Ensuring global convergence in deep neural networks with limited width constraints.
method Proves that a single wide layer followed by a pyramidal structure guarantees global convergence for over-parameterized networks.
result Single wide layer of width NN suffices for global convergence in deep networks with constant-width remaining layers.

By formulating N = 1, 2, 4, 8, D = 3, Yang-Mills with a single Lagrangian and single set of transformation rules, but with fields valued respectively in R,C,H,O, it was recently shown that tensoring left and right multiplets yields a Freudenthal-Rosenfeld-Tits magic square of D = 3 supergravities. This was subsequently…

2013-12-23abs ↗pdf ↗

QC-SPHARM detects Alzheimer's Disease early using hippocampal surface geometry.

problem Early detection of Alzheimer's Disease (AD) using hippocampal surface geometry.
method Spherical harmonics registration, conformality and curvature distortions quantification, t-test feature selection, SVM classification.
result 85.2% testing accuracy on ADNI data, 81.2% on aMCI progression data.

In this paper, we construct a pyramid Ricci flow starting with a complete Riemannian manifold (Mn,g0)(M^n,g_0) that is PIC1, or more generally satisfies a lower curvature bound KIC1α0K_{IC_1}\geq -α_0. That is, instead of constructing a flow on M×[0,T]M\times [0,T], we construct it on a subset of space-time that is a union of parabo…

2019-06-17abs ↗pdf ↗

Improves speaker verification for variable-duration utterances using a feature pyramid module.

problem Improving robustness for variable-duration utterances in speaker verification.
method Integrates a feature pyramid module into multi-scale aggregation to enhance speaker-discriminative information from multiple layers.
result Improves performance for both short and long utterances compared to state-of-the-art approaches.

PyFi uses adversarial agents to train VLMs on financial image understanding.

problem Training VLMs to understand complex financial questions.
method PyFi-600K dataset and adversarial MCTS mechanism.
result Fine-tuned VLMs improve by 19.52% and 8.06% on financial question accuracy.

SPF uses a hierarchical approach to efficiently emulate climate changes.

problem Slow and unstable climate emulation for long horizons.
method Spatiotemporal Pyramid Flows (SPF) model data hierarchically across spatial and temporal scales.
result SPF outperforms flow matching baselines and pre-trained models on ClimateBench.

Enhances neural networks' robustness against adversarial samples without sacrificing clean sample generalization.

problem Limited generalization and time complexity of adversarial training.
method Feature Pyramid Decoder (FPD) framework that integrates denoising and image restoration modules into CNNs and constrains the Lipschitz constant.
result FPD-enhanced CNNs achieve sufficient robustness against general adversarial samples on various datasets.

We introduce a wavelet-domain functional analysis of variance (fANOVA) method based on a Bayesian hierarchical model. The factor effects are modeled through a spike-and-slab mixture at each location-scale combination along with a normal-inverse-Gamma (NIG) conjugate setup for the coefficients and errors. A graphical mo…

2016-02-12abs ↗pdf ↗

This paper focuses on a class of linear Hawkes processes with general immigrants. These are counting processes with shot noise intensity, including self-excited and externally excited patterns. For such processes, we introduce the concept of age pyramid which evolves according to immigration and births. The virtue if t…

2015-04-24abs ↗pdf ↗

Local unsupervised learning outperforms end-to-end training for image classification.

problem Local unsupervised learning is believed to be inferior to end-to-end training.
method Designing a local algorithm to learn convolutional filters at scale on large image datasets using local Hebbian learning.
result Convolutional networks with patch normalization significantly outperform standard networks on image classification tasks.

The challenge of object categorization in images is largely due to arbitrary translations and scales of the foreground objects. To attack this difficulty, we propose a new approach called collaborative receptive field learning to extract specific receptive fields (RF's) or regions from multiple images, and the selected…

2014-02-02abs ↗pdf ↗

Non-linear dimensionality reduction techniques such as manifold learning algorithms have become a common way for processing and analyzing high-dimensional patterns that often have attached a target that corresponds to the value of an unknown function. Their application to new points consists in two steps: first, embedd…

2013-11-26abs ↗pdf ↗

State of the art deep reinforcement learning algorithms take many millions of interactions to attain human-level performance. Humans, on the other hand, can very quickly exploit highly rewarding nuances of an environment upon first discovery. In the brain, such rapid learning is thought to depend on the hippocampus and…

2016-06-14abs ↗pdf ↗

We construct a global homeomorphism from any 3D Ricci limit space to a smooth manifold, that is locally bi-Holder. This extends the recent work of Miles Simon and the second author, and we build upon their techniques. A key step in our proof is the construction of local "pyramid Ricci flows", existing on uniform region…

2018-03-01abs ↗pdf ↗

Neuron Shapley identifies key neurons in deep networks, improving model accuracy and fairness.

problem Identifying responsible neurons in deep networks for better model performance and fairness.
method Neuron Shapley framework quantifies neuron contributions, accounting for interactions.
result Removing just 30 critical filters can destroy model accuracy, revealing network function.

Describes explaining neurons in deep representations using compositional logical concepts.

problem Interpreting neuron behavior in deep neural networks.
method Identifying compositional logical concepts that closely approximate neuron behavior.
result Compositional explanations provide insights into model performance and allow for adversarial example creation.

SeReNe prunes neurons with low sensitivity to reduce network size.

problem Large neural networks consume too many resources on resource-constrained devices.
method Exploits neural sensitivity as a regularizer to prune neurons with low sensitivity.
result Pruning neurons with low sensitivity achieves competitive compression ratios.

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.