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

295886115 · Jun 202019922001200920172026
48 results for short-range memory

New perspective on SGD reveals short-range memory effects in deep learning.

problem Understanding the efficacy of stochastic gradient descent (SGD) in deep learning.
method Proposed that SGD is a discretization of an SDE driven by fractional Brownian motion (FBM).
result SGD stays longer in flat minima, favoring generalization.

Embed-KCPD segments text without labels, outperforming baselines.

problem Unsupervised text segmentation is challenging due to lack of boundary labels.
method Embed-KCPD represents sentences as embeddings and estimates boundaries via penalized KCPD.
result Embed-KCPD outperforms strong unsupervised baselines across benchmarks.

Study finds phase transition in context-sensitive language model with short-range interactions.

problem Understanding phase transitions in language models with short-range interactions.
method Constructed a random language model with short-range interactions and investigated its statistical properties.
result Phase transition occurs in context-sensitive language models with constant context length.

The problem of recovering the asymptotics of a short range perturbation of the Euclidean metric on R^n from fixed energy scattering data is studied. It is shown that if two such metrics, g1, g2, have scattering data at some fixed energy which are equal up to smoothing, then there exists a diffeomorphism ψ`fixing infini…

1997-10-31abs ↗pdf ↗

Proves energy expression on Poincaré-Einstein spaces.

problem Computing renormalized Yang-Mills energy on Poincaré-Einstein manifolds.
method Generalizes Chang-Qing-Yang method for renormalized volumes and uses scattering theory for Schrödinger operators.
result Agrees with anomaly boundary integrand in seven dimensions.

We introduce a general framework of the Mixed-correlated ARFIMA (MC-ARFIMA) processes which allows for various specifications of univariate and bivariate long-term memory. Apart from a standard case when Hxy=12(Hx+Hy)H_{xy}={1}{2}(H_x+H_y), MC-ARFIMA also allows for processes with Hxy<12(Hx+Hy)H_{xy}<{1}{2}(H_x+H_y) but also for long-range …

2013-07-23abs ↗pdf ↗

Split conformal prediction works well for time series despite temporal dependence.

problem Uncertainty quantification for time series predictions with past data.
method Split conformal prediction method for time series data with predictors having memory.
result Theoretical bounds on coverage probability for split conformal prediction in time series with memory.

Study evaluates neural networks based on random graph structures and finds key performance indicators.

problem Understanding and optimizing neural network architectures using graph theory.
method Evaluation of neural networks with random graph structures, focusing on structural and numerical properties.
result A new numerical graph characteristic selects a set of quasi-1-dimensional graphs that perform well.

News sentiment in U.S. economic newspapers has become more persistent over 45 years.

problem Understanding the temporal dynamics of U.S. economic news sentiment over time.
method Daily economic news sentiment index from 1980-2025, analyzed using sentiment indexes.
result News sentiment states have become more persistent, with longer residence times in optimistic or pessimistic regimes.

We consider Markov models of stochastic processes where the next-step conditional distribution is defined by a kernel density estimator (KDE), similar to Markov forecast densities and certain time-series bootstrap schemes. The KDE Markov models (KDE-MMs) we discuss are nonlinear, nonparametric, fully probabilistic repr…

2018-07-30abs ↗pdf ↗

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…

2002-12-16abs ↗pdf ↗

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

In this paper we consider certain asymptotically Euclidean spaces, namely compact manifolds with boundary X equipped with a scattering metric g, as defined by Melrose. We then consider Hamiltonians H which are `short-range' self-adjoint perturbations of the Laplacian of g. Melrose and Zworski have given a detailed desc…

1999-06-29abs ↗pdf ↗

Convolutional neural networks are commonly used to control the steering angle for autonomous cars. Most of the time, multiple long range cameras are used to generate lateral failure cases. In this paper we present a novel model to generate this data and label augmentation using only one short range fisheye camera. We p…

2018-08-20abs ↗pdf ↗

We propose a Standing Wave Decomposition (SWD) approximation to Gaussian Process regression (GP). GP involves a costly matrix inversion operation, which limits applicability to large data analysis. For an input space that can be approximated by a grid and when correlations among data are short-ranged, the kernel matrix…

2018-03-09abs ↗pdf ↗

Heretofore, neural networks with external memory are restricted to single memory with lossy representations of memory interactions. A rich representation of relationships between memory pieces urges a high-order and segregated relational memory. In this paper, we propose to separate the storage of individual experience…

2020-02-10abs ↗pdf ↗

The paper analyzes time-dependent streaming data with biased gradient estimates and proposes improved stochastic optimization methods.

problem Stochastic optimization in a streaming setting with time-dependent and biased gradient estimates.
method Analysis of several first-order methods including SGD, mini-batch SGD, and time-varying mini-batch SGD, along with their Polyak-Ruppert averages.
result Time-varying mini-batch SGD methods can break long- and short-range dependence structures, and biased SGD methods can achieve comparable performance to their unbiased counterparts.

Autoregressive networks can achieve promising performance in many sequence modeling tasks with short-range dependence. However, when handling high-dimensional inputs and outputs, the huge amount of parameters in the network lead to expensive computational cost and low learning efficiency. The problem can be alleviated …

2019-09-06abs ↗pdf ↗

Stable Hadamard Memory improves reinforcement learning by efficiently managing memory.

problem Memory models struggle in partially observable reinforcement learning environments.
method Introduces a novel memory model using the Hadamard product for efficient memory management and updates.
result Significantly outperforms state-of-the-art memory-based methods on challenging benchmarks.

We analyze the resolvent R(k)=(P+k2)1R(k)=(P+k^2)^{-1} of Schrödinger operators P=Δ+VP=Δ+V with short range potential VV on asymptotically conic manifolds (M,g)(M,g) (this setting includes asymptotically Euclidean manifolds) near k=0k=0. We make the assumption that the dimension is greater or equal to 3 and that PP has no L2L^2 null …

2007-01-18abs ↗pdf ↗

New memory allocation scheme improves image generation performance.

problem Improving episodic and semantic memory representation in neural networks.
method Developed a hierarchical latent variable model with differentiable, locally block allocated latent memory.
result Improved conditional likelihood values on various datasets.

DAM with MRL improves relational reasoning in MANNs.

problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.

We discuss memory models which are based on tensor decompositions using latent representations of entities and events. We show how episodic memory and semantic memory can be realized and discuss how new memory traces can be generated from sensory input: Existing memories are the basis for perception and new memories ar…

2017-08-09abs ↗pdf ↗

mGRN improves multivariate time series prediction by managing marginal and joint memories.

problem Extracting dependencies in multivariate sequential data with strong serial and cross-sectional dependencies.
method Developed a novel recurrent network architecture, Memory-Gated Recurrent Networks (mGRN), with gates for marginal and joint memories.
result mGRN consistently outperforms state-of-the-art architectures on various public datasets.

Model combines long-term and short-term memory using conceptors.

problem Transfer between long-term and short-term memory.
method Recurrent neural network with gated reservoir for short-term memory and conceptors for long-term memory.
result Standard operations on conceptors allow combining long-term memories and describing their effect on short-term memory.

Enhanced Hopfield model boosts memory retrieval capacity.

problem Memory retrieval in modern Hopfield models with limited capacity.
method Introduces a learnable feature map transforming energy function into kernel space, minimizing separation loss for uniform memory distribution.
result Significant reduction in metastable states, enhancing memory capacity and retrieval accuracy.

Memory networks are neural networks with an explicit memory component that can be both read and written to by the network. The memory is often addressed in a soft way using a softmax function, making end-to-end training with backpropagation possible. However, this is not computationally scalable for applications which …

2016-05-24abs ↗pdf ↗

We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian updat…

2018-04-05abs ↗pdf ↗

Generative diffusion models mimic biological memory networks, encoding associative dynamics in deep neural weights.

problem Understanding long-term memory mechanisms in neuroscience and AI.
method Interpreting generative diffusion models as energy-based models and comparing them to Hopfield networks.
result Generative diffusion models can encode associative dynamics of Hopfield networks in deep neural weights.

We augment recurrent neural networks with an external memory mechanism that builds upon recent progress in metalearning. We conceptualize this memory as a rapidly adaptable function that we parameterize as a deep neural network. Reading from the neural memory function amounts to pushing an input (the key vector) throug…

2019-07-23abs ↗pdf ↗

Accelerators with power-law memory are proposed in the framework of the discrete time approach. To describe discrete accelerators we use the capital stock adjustment principle, which has been suggested by Matthews.The suggested discrete accelerators with memory describe the economic processes with the power-law memory …

2016-12-23abs ↗pdf ↗

A new memory system handles non-stationary environments by self-sizing and retaining memories.

problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.

Deep learning typically requires training a very capable architecture using large datasets. However, many important learning problems demand an ability to draw valid inferences from small size datasets, and such problems pose a particular challenge for deep learning. In this regard, various researches on "meta-learning…

2017-10-19abs ↗pdf ↗