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

130260389519 · Jun 202019922001200920172026
48 results for memory processes

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 ↗

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 ↗

Research on long-range memory in financial and social systems using various models.

problem Understanding the nature of long-range memory in socioeconomic systems.
method Various Markov processes including point processes, stochastic differential equations, and agent-based models.
result New estimators of self-similarity and long-range memory for non-Gaussian systems are needed.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

We propose a stochastic process driven by memory effect with novel distributions including both exponential and leptokurtic heavy-tailed distributions. A class of distribution is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation and the closed form momen…

2012-01-27abs ↗pdf ↗

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.

Deep neural networks estimate long memory parameters efficiently.

problem Estimating long memory parameters in stochastic processes.
method Scale-invariant 1D Convolutional Neural Networks (CNNs) and Long Short-Term Memory (LSTM) models trained with synthetic data.
result Neural models outperform conventional methods in precision, speed, consistency, and robustness.

We study how the round-off (or discretization) error changes the statistical properties of a Gaussian long memory process. We show that the autocovariance and the spectral density of the discretized process are asymptotically rescaled by a factor smaller than one, and we compute exactly this scaling factor. Consequentl…

2011-07-22abs ↗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.

It is generally accepted that many time series of practical interest exhibit strong dependence, i.e., long memory. For such series, the sample autocorrelations decay slowly and log-log periodogram plots indicate a straight-line relationship. This necessitates a class of models for describing such behavior. A popular cl…

2007-06-13abs ↗pdf ↗

Accurate volatility modelling is paramount for optimal risk management practices. One stylized feature of financial volatility that impacts the modelling process is long memory explored in this paper for alternative risk measures, observed absolute and squared returns for high frequency intraday UK futures. Volatility …

2011-03-29abs ↗pdf ↗

This note develops a stochastic model of asset volatility. The volatility obeys a continuous-time autoregressive equation. Conditions under which the process is asymptotically stationary and possesses long memory are characterised. Connections with the class of ARCH(\infty) processes are sketched.

2012-02-24abs ↗pdf ↗

We propose a stochastic process driven by the memory effect with novel distributions which include both exponential and leptokurtic heavy-tailed distributions. A class of the distributions is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation. The moment …

2012-03-26abs ↗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 ↗

Enhanced financial trading system using multi-agent LLMs with layered memory.

problem Inefficient prioritization of tasks in LLMs due to their memory processing.
method Introducing a multi-agent framework with layered memories and inter-agent debate.
result Superior automated trading accuracy and decision robustness.

For the London Stock Exchange we demonstrate that the signs of orders obey a long-memory process. The autocorrelation function decays roughly as τατ^{-α} with α0.6α\approx 0.6, corresponding to a Hurst exponent H0.7H \approx 0.7. This implies that the signs of future orders are quite predictable from the signs of past orde…

2003-11-04abs ↗pdf ↗

The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as no…

2011-07-12abs ↗pdf ↗

NeuroMemFPP uses LSTM to estimate FPP parameters with high accuracy.

problem Estimating parameters of fractional Poisson process with memory and long-range dependence.
method Recurrent Neural Network (RNN), specifically Long Short-Term Memory (LSTM), for parameter estimation.
result The LSTM-based approach reduces MSE by about 55.3% compared to traditional MOM method.

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-efficient sign language translation model reduces weight usage.

problem Memory constraints in real-time sign language translation.
method Variational Bayesian sequence-to-sequence network with Gaussian posterior and Indian Buffet Process prior.
result The proposed model achieves substantial weight compression without compromising performance.

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.

Earlier we proposed the stochastic point process model, which reproduces a variety of self-affine time series exhibiting power spectral density S(f) scaling as power of the frequency f and derived a stochastic differential equation with the same long range memory properties. Here we present a stochastic differential eq…

2006-06-14abs ↗pdf ↗

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 ↗

Optimal linear contracts are possible even with memory in Gaussian settings.

problem Can optimal dynamic contracts be linear when agents control memory processes?
method Developed a methodology for non-Markovian and non-semimartingale settings, showed linear contracts are optimal for one-dimensional models.
result Linear contracts are optimal for one-dimensional models with memory, and for radial effort cost functions in higher dimensions.

Automated process discovery is a class of process mining methods that allow analysts to extract business process models from event logs. Traditional process discovery methods extract process models from a snapshot of an event log stored in its entirety. In some scenarios, however, events keep coming with a high arrival…

2018-04-08abs ↗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.

A new method learns from multi-modal sequences with external memory.

problem Learning new modes in a dynamic environment without prior knowledge.
method Maintains a neural episodic memory with a Dirichlet Process prior to store mode descriptors and transfers knowledge through retrieval.
result Performs continual learning favorably compared to mainstream approaches.

Matrix Factorization (MF) on large scale matrices is computationally as well as memory intensive task. Alternative convergence techniques are needed when the size of the input matrix is higher than the available memory on a Central Processing Unit (CPU) and Graphical Processing Unit (GPU). While alternating least squar…

2019-01-02abs ↗pdf ↗

In the domain of machine learning, Neural Memory Networks (NMNs) have recently achieved impressive results in a variety of application areas including visual question answering, trajectory prediction, object tracking, and language modelling. However, we observe that the attention based knowledge retrieval mechanisms us…

2019-10-12abs ↗pdf ↗

PySAD offers a unified Python framework for efficient streaming anomaly detection.

problem Efficient anomaly detection in streaming data with strict constraints.
method Unified architecture with 17+ streaming algorithms, specialized components, and support for multiple learning paradigms.
result PySAD enables real-time processing with bounded memory and is compatible with other Python frameworks.

The properties of statistical tests for hypotheses concerning the parameters of the multifractal model of asset returns (MMAR) are investigated, using Monte Carlo techniques. We show that, in the presence of multifractality, conventional tests of long memory tend to over-reject the null hypothesis of no long memory. Ou…

2016-01-05abs ↗pdf ↗

Researchers develop a neural network that learns like humans, overcoming forgetting and structure issues.

problem Catastrophic forgetting and structure limitations in neural networks.
method Memory playback strategy and dynamic structure extension using conditional variational autoencoder (CVAE).
result The method effectively prevents forgetting and allows for dynamic network growth.

One stylized feature of financial volatility impacting the modeling process is long memory. This paper examines long memory for alternative risk measures, observed absolute and squared returns for Daily REITs and compares the findings for a non- REIT equity index. The paper utilizes a variety of tests for long memory f…

2011-03-28abs ↗pdf ↗

Gravitational wave memory increases faster than Brownian motion in early universe and astrophysical sources.

problem Detecting gravitational wave memory from early universe and astrophysical sources.
method Investigated gravitational wave sources in early universe and astrophysical settings, showing memory increases faster than Brownian motion.
result Gravitational wave memory increases following a power law, faster than the t\sqrt{t} scaling law of Brownian motion.