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

Trend · papers per month

4385128170 · Jun 202019922001200920172026
48 results for memory length

New approach reduces malware detection memory requirements and speeds up training.

problem Efficiently classifying long sequences of malware detection data.
method Developed a new temporal max pooling method and global channel gating design.
result 116x more memory efficient and 25.8x faster training on original dataset.

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

Global Memory Augmentation (GMAT) improves Transformer performance on long documents.

problem Large memory requirements of Transformer pairwise dot-product attention for long sequences.
method Integrates a dense global memory of length M into sparse Transformer blocks.
result Significant improvement on various tasks, including synthetic tasks, masked language modeling, and reading comprehension.

New algorithm reduces costs and latency for large language model inference.

problem Optimizing inference costs and latency for large language models with GPU constraints.
method Formulated as an online scheduling problem with endogenous memory growth, introduced fluid model and WAIT algorithms.
result Reduced costs and latency, especially in near-overloaded and overloaded regimes.

Algorithm learns linear systems from partial observations with near-optimal rate.

problem Identifying linear dynamical systems from partial observations, especially those with long-term memory.
method Multi-scale low-rank approximation using SVD on Hankel matrices of increasing sizes, combined with Fourier domain concentration bounds.
result Near-optimal rate of $\widetilde O\left(\sqrt\frac{d}{T} ight)$ in H2\mathcal{H}_2 error, with logarithmic dependence on memory length.

Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.

problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.

To understand the fundamental trade-offs between training stability, temporal dynamics and architectural complexity of recurrent neural networks~(RNNs), we directly analyze RNN architectures using numerical methods of ordinary differential equations~(ODEs). We define a general family of RNNs--the ODERNNs--by relating t…

2019-04-29abs ↗pdf ↗
Agents Play Mix-gamephysics.soc-ph

In mix-game which is an extension of minority game, there are two groups of agents; group1 plays the majority game, but the group2 plays the minority game. This paper studies the change of the average winnings of agents and volatilities vs. the change of mixture of agents in mix-game model. It finds that the correlatio…

2005-05-17abs ↗pdf ↗

Compact Recurrent Transformer (CRT) improves Transformer efficiency for long sequences.

problem Efficiently scaling Transformer architecture to long sequences with limited compute resources.
method Combines shallow Transformer models with recurrent neural networks and persistent memory.
result CRT achieves comparable or superior performance to full-length Transformers with shorter segments and reduced FLOPs.

Deep neural networks with memory learn reduced equations from partial data.

problem Constructing governing equations for unknown dynamical systems from limited data.
method Formulate a discrete approximation of memory integrals, use deep neural networks to incorporate history terms.
result Deep neural networks can learn reduced equations with memory from partial data.

Transformers are powerful sequence models, but require time and memory that grows quadratically with the sequence length. In this paper we introduce sparse factorizations of the attention matrix which reduce this to O(nn)O(n \sqrt{n}). We also introduce a) a variation on architecture and initialization to train deeper net…

2019-04-23abs ↗pdf ↗

We analyze computational limits of modern Hopfield models based on pattern norms.

problem Understanding the efficiency of modern Hopfield models from a fine-grained complexity perspective.
method Fine-grained complexity analysis and upper bound criterion for pattern norms.
result Below a specific norm threshold, efficient variants of modern Hopfield models exist.

An associative memory is a framework of content-addressable memory that stores a collection of message vectors (or a dataset) over a neural network while enabling a neurally feasible mechanism to recover any message in the dataset from its noisy version. Designing an associative memory requires addressing two main task…

2016-11-29abs ↗pdf ↗

Music relies heavily on repetition to build structure and meaning. Self-reference occurs on multiple timescales, from motifs to phrases to reusing of entire sections of music, such as in pieces with ABA structure. The Transformer (Vaswani et al., 2017), a sequence model based on self-attention, has achieved compelling …

2018-09-12abs ↗pdf ↗

Paper proposes new method for time series confidence intervals using LSTM.

problem Constructing accurate confidence intervals for multivariate time series.
method Uses Long Short Term Memory Network (LSTM) and novel block bootstrap techniques.
result Demonstrates improved accuracy in constructing confidence intervals.

We study finite sample properties of estimators of power-law cross-correlations -- detrended cross-correlation analysis (DCCA), height cross-correlation analysis (HXA) and detrending moving-average cross-correlation analysis (DMCA) -- with a special focus on short-term memory bias as well as power-law coherency. Presen…

2014-09-24abs ↗pdf ↗

In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication netw…

2019-05-10abs ↗pdf ↗

Study shows memory needs grow with task sequence length in continual learning.

problem Challenges in retaining aptitude for multiple learning tasks sequentially.
method Complexity-theoretic study using communication complexity and multiplicative weights update.
result Memory needs grow linearly with task sequence length, suggesting intractability.

Paper presents methods to create stock price confidence intervals using LSTM models.

problem Creating accurate confidence intervals for LSTM-estimated stock prices.
method Three bootstrap methods for dependent data, optimal block length selection, and benchmark comparison.
result Illustrated through stock price data, different bootstrap strategies provide varying confidence intervals.

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability. Moreover, with a significant probability, the solution will be the first in the list.…

2004-04-05abs ↗pdf ↗

Paper introduces a new framework to improve sample efficiency in POMDPs learning.

problem Challenges in off-policy evaluation for POMDPs, especially with hidden states.
method Exploits the metric structure of belief space to relax coverage assumptions.
result Unified analysis technique yields tighter error bounds and sample efficiency improvements.

Efficiently infers latent SDEs with scalable memory and time costs.

problem Inference of latent SDEs with high time and memory complexity.
method Amortized reparametrization of expectations under linear SDEs, coupled with efficient gradient approximation.
result Achieves similar performance to adjoint sensitivities with fewer model evaluations.

Kernel networks' stability edge linked to Fisher Information singularity.

problem Understanding the stability edge in high-capacity kernel Hopfield networks.
method Statistical manifold analysis and Riemannian geometry.
result The Ridge of Optimization corresponds to the Edge of Stability, revealing a dual equilibrium.

Efficient sparse attention reduces self-attention complexity and improves model performance.

problem Quadratic compute and memory requirements of self-attention for long sequences.
method Content-based sparse attention with dynamic routing module.
result Routing Transformer achieves state-of-the-art performance on various benchmarks.

New linear models improve time series classification efficiency and interpretability.

problem Complex and inefficient classifiers limit interpretability and applicability to variable-length time series.
method Symbolic representations, multi-resolution, multi-domain, linear models.
result mtSS-SEQL+LR achieves similar accuracy to state-of-the-art methods but with lower time and memory usage.

Proposes a neural network for learning step-size policies for L-BFGS optimization.

problem Optimizing step sizes for L-BFGS in large-scale problems.
method Neural network architecture using local iterate information, trained via stochastic optimization.
result Outperforms existing step size selection methods in training classifiers.

New model captures long-range patterns in sequences efficiently.

problem Efficiently capturing long-range patterns in sequential data.
method Inspired by wavelet multiresolution analysis, introduces MultiresLayer with multiresolution convolution.
result State-of-the-art performance on sequence classification and autoregressive density estimation tasks.

Linformer reduces transformer complexity to linear, improving efficiency.

problem High cost of training and deploying large transformer models for long sequences.
method Approximates self-attention with low-rank matrix, proposing Linformer with O(n)O(n) complexity.
result Linformer performs similarly to standard transformers but is more memory- and time-efficient.