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

56113169225 · Jun 202019922001200920172026
48 results for expressive memory

The mathematical model of a linear system with the short memory about own stochastic behavior is proposed. It is assumed that the system is under a continual influence of independent stochastic impulses. In a short memory approximation the expression of the stochastic process is found. An application of the model propo…

2004-01-14abs ↗pdf ↗

Iterative learning to infer approaches have become popular solvers for inverse problems. However, their memory requirements during training grow linearly with model depth, limiting in practice model expressiveness. In this work, we propose an iterative inverse model with constant memory that relies on invertible networ…

2019-11-25abs ↗pdf ↗

State-of-the-art models are now trained with billions of parameters, reaching hardware limits in terms of memory consumption. This has created a recent demand for memory-efficient optimizers. To this end, we investigate the limits and performance tradeoffs of memory-efficient adaptively preconditioned gradient methods.…

2019-02-12abs ↗pdf ↗

In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks und…

2018-05-01abs ↗pdf ↗

Implicit models can match or exceed explicit models with more test-time compute.

problem Understanding the expressive power and scaling of implicit models.
method Nonparametric analysis of expressive power, mathematical characterization of implicit operators, and test-time scaling experiments.
result Implicit models can progressively express more complex mappings through iteration, matching a richer function class with test-time compute.

The paper introduces a new stochastic volatility model with long-term memory and jumps.

problem Developing a model for variance and volatility swaps with long-term memory and jumps.
method Fractional Barndorff-Nielsen and Shephard model incorporating long-term memory and jumps.
result Arbitrage-free prices for variance and volatility swaps derived for the new model.

Study reveals Transformer's expressive power and mechanisms.

problem Understanding the approximation properties of Transformer for sequence modeling.
method Systematic study of Transformer's components and their combined effects, establishing approximation rates.
result Reveals roles of critical parameters in Transformer, such as number of layers and attention heads.

We study the problem of learning associative memory -- a system which is able to retrieve a remembered pattern based on its distorted or incomplete version. Attractor networks provide a sound model of associative memory: patterns are stored as attractors of the network dynamics and associative retrieval is performed by…

2019-10-07abs ↗pdf ↗

We introduce a Vasicek-type short rate model which has two additional parameters representing memory effect. This model presents better results in yield curve fitting than the classical Vasicek model. We derive closed-form expressions for the prices of bonds and bond options. Though the model is non-Markov, there exist…

2015-04-07abs ↗pdf ↗

We analyse perception and memory, using mathematical models for knowledge graphs and tensors, to gain insights into the corresponding functionalities of the human mind. Our discussion is based on the concept of propositional sentences consisting of \textit{subject-predicate-object} (SPO) triples for expressing elementa…

2020-01-29abs ↗pdf ↗

Transformers can store facts efficiently using associative memories.

problem Understanding how transformers store and recall factual information.
method Proved linear scaling of storage capacities for linear and MLP associative memories, introduced a synthetic task, and analyzed gradient flow.
result Shallow transformers can achieve near optimal storage capacity for factual recall tasks using associative memories.

Spot option prices, forwards and options on forwards relevant for the commodity markets are computed when the underlying process S is modelled as an exponential of a process ξ with memory as e.g. a Lévy semi-stationary process. Moreover a risk premium \r{ho} representing storage costs, illiquidity, convenience yield or…

2017-11-01abs ↗pdf ↗

Analyzed a generalized voter model with power-law herding intensity, revealing anomalous diffusion and long-range memory.

problem Anomalous diffusion and long-range memory in a generalized voter model.
method Derived analytical expressions for moments and first passage time distribution, confirmed numerically.
result The model exhibits long-range memory indicators despite being a Markov model.

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.

Bayesian neural networks can be partially stochastic without losing predictive power.

problem The necessity of fully stochastic parameters in Bayesian neural networks.
method Theoretical and empirical investigation of partially stochastic networks compared to fully stochastic ones.
result Expressive predictive distributions require only small amounts of stochasticity, and partially stochastic networks can match or outperform fully stochastic networks.

We propose Deep Closed-Form Subspace Clustering (DCFSC), a new embarrassingly simple model for subspace clustering with learning non-linear mapping. Compared with the previous deep subspace clustering (DSC) techniques, our DCFSC does not have any parameters at all for the self-expressive layer. Instead, DCFSC utilizes …

2019-08-26abs ↗pdf ↗

IVF k-means algorithm improves performance on large sparse data sets.

problem Efficiently clustering large-scale sparse data sets with numerous classes.
method Sparse data representation and inverted-file structure for high-speed and low-memory clustering.
result IVF achieves better performance than other algorithms on real document data sets.

Enhances reward specification in RL with a novel language-based approach.

problem Reward specification in RL can lead to unintended, potentially harmful behaviours.
method Developed a novel class of language-based Reward Machines using RML's built-in memory.
result Can specify non-regular, non-Markovian reward functions for complex tasks.

We consider the general problem of modeling temporal data with long-range dependencies, wherein new observations are fully or partially predictable based on temporally-distant, past observations. A sufficiently powerful temporal model should separate predictable elements of the sequence from unpredictable elements, exp…

2017-02-15abs ↗pdf ↗

The paper tackles scalability issues in Graph Representation Learning.

problem Prohibitive time and memory complexities in Graph Representation Learning.
method Leveraging the K-Core Decomposition property of Graphs to reduce time and memory consumption.
result Proposed techniques significantly reduce computational resources without compromising embedding quality.

Introduces Exponentially Weighted Signature for better path representation.

problem Uniform treatment of historical information in signatures.
method Generalizes EFM signature to bounded linear operators, enabling contextualised temporal weighting.
result EWS is the unique solution to a linear controlled differential equation and generalizes state-space models.

Recent empirical studies suggest that the volatility of an underlying price process may have correlations that decay slowly under certain market conditions. In this paper, the volatility is modeled as a stationary process with long-range correlation properties in order to capture such a situation, and we consider Europ…

2016-04-01abs ↗pdf ↗

New RNN model handles long-term dependencies in irregularly-sampled time series.

problem Handling long-term dependencies in irregularly-sampled time series data.
method Designing ODE-LSTMs that separate memory from continuous-time state.
result ODE-LSTMs outperform other RNN-based models on non-uniformly sampled data with long-term dependencies.

PLUMAGE improves large model training efficiency and stability.

problem Accelerator memory and networking constraints during large model training.
method Probabilistic Low rank Unbiased Minimum Variance Gradient Estimator (PLUMAGE) that resolves bias and variance issues.
result PLUMAGE reduces training loss by 28% on average across the GLUE benchmark.

New explanation of reservoir computing using random projections.

problem Understanding the randomness in reservoir computing.
method Constructing strongly universal reservoir systems as random projections of state-space systems.
result Approximation of any fading memory filters class by training a linear readout for each filter.

Recurrent Neural Networks (RNNs), which are a powerful scheme for modeling temporal and sequential data need to capture long-term dependencies on datasets and represent them in hidden layers with a powerful model to capture more information from inputs. For modeling long-term dependencies in a dataset, the gating mecha…

2017-06-07abs ↗pdf ↗

Word2Vec is a widely used algorithm for extracting low-dimensional vector representations of words. It generated considerable excitement in the machine learning and natural language processing (NLP) communities recently due to its exceptional performance in many NLP applications such as named entity recognition, sentim…

2016-04-15abs ↗pdf ↗

Owing to their ability to both effectively integrate information over long time horizons and scale to massive amounts of data, self-attention architectures have recently shown breakthrough success in natural language processing (NLP), achieving state-of-the-art results in domains such as language modeling and machine t…

2019-10-13abs ↗pdf ↗

We analyze generalization in deep learning models using random matrix theory.

problem Understanding the generalization error in deep learning models with random feature representations.
method Applying Random Matrix Theory to derive asymptotic generalization error formulas for various architectures.
result Linear ESNs are equivalent to ridge regression with exponentially time-weighted input covariance, revealing an inductive bias towards recent inputs.

Sequence models assign probabilities to variable-length sequences such as natural language texts. The ability of sequence models to capture temporal dependence can be characterized by the temporal scaling of correlation and mutual information. In this paper, we study the mutual information of recurrent neural networks …

2019-05-10abs ↗pdf ↗