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.

169,051 papers · 148 categories

Trend · papers per month

169338506675 · Jun 202019922001200920182026
48 results for Memory Time Span

FinMem enhances LLM trading agents with layered memory and character design.

problem Developing purpose-driven LLM agents for financial decision-making.
method Integrates layered memory and character design modules into an LLM framework.
result Significantly enhanced trading performance in financial markets.

The extension of deep learning towards temporal data processing is gaining an increasing research interest. In this paper we investigate the properties of state dynamics developed in successive levels of deep recurrent neural networks (RNNs) in terms of short-term memory abilities. Our results reveal interesting insigh…

2018-02-02abs ↗pdf ↗

We introduce the "NoBackTrack" algorithm to train the parameters of dynamical systems such as recurrent neural networks. This algorithm works in an online, memoryless setting, thus requiring no backpropagation through time, and is scalable, avoiding the large computational and memory cost of maintaining the full gradie…

2015-07-28abs ↗pdf ↗

We study the long memory of order flow for each of three liquid currency pairs on a large electronic trading platform in the foreign exchange (FX) spot market. Due to the extremely high levels of market activity on the platform, and in contrast to existing empirical studies of other markets, our data enables us to perf…

2015-04-16abs ↗pdf ↗

AnEn uses past analogs for weather forecasting, but this work replaces the dataset with deep generative models.

problem Memory and computational costs for storing and searching historical data.
method Deep generative models to replace historical data and analogs search.
result Generative models reduce memory and computational costs significantly.

A novel memory network improves interpretability and training for EHR analysis.

problem Limited interpretability and training difficulty in traditional memory networks for EHR analysis.
method Proposes a hybrid memory architecture with explicit and blurred memory blocks for improved interpretability and training efficiency.
result The model performs comparably to state-of-the-art methods and enables ready interpretation of results.

We propose a new model for the level I of a Limit Order Book (LOB), which incorporates the information about the standing orders at the opposite side of the book after each price change and the arrivals of new orders within the spread. Our main result gives a diffusion approximation for the mid-price process. To illust…

2014-07-21abs ↗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.

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 ↗

New model forecasts long-memory series with time-varying parameters.

problem Forecasting long-memory series with dynamic parameters.
method Proposes a new long-memory model with a time-varying fractional parameter, driven by predictive likelihood score.
result Validated through Monte Carlo experiment and real data applications.

Neural network tackles continual learning with neuromodulation and local error signals.

problem Catastrophic forgetting in continuous learning.
method Biologically-inspired neural architecture with local learning and neuromodulation, combined with transfer metalearning.
result Superior performance in continual learning tasks compared to other approaches.

Non-spanning identification of scheduled event risk in option pricing.

problem Separating continuous surface from scheduled jump in option pricing.
method Modeling FOMC decisions, CPI releases, and NFP reports as deterministic-time jumps in risk-neutral option pricing.
result Improves held-out event-spanning pricing with Gaussian and two-component mixture jumps.

A new hierarchical clustering method selects representative points from sub-minimum-spanning-trees.

problem Selecting representative points for hierarchical clustering to improve robustness and reliability.
method Identify representative points using reciprocal nearest data points in sub-minimum-spanning-trees.
result The proposed algorithm outperforms other methods in accuracy and efficiency.

This study examines memory effects in S&P500 market correlations using Langevin models.

problem The neglect of memory effects in market correlations for optimal portfolio selection.
method Fit a generalised Langevin equation (GLE) to S&P500 market correlation data.
result Memory effects in market correlations significantly improve forecasting accuracy and suggest a hidden slow time scale.

New method embeds time span into self-attention for better temporal pattern recognition.

problem Capturing temporal patterns in event sequences without recurrent networks.
method Functional time representation learning with Bochner's and Mercer's Theorems.
result Proposed methods outperform baseline models in various continuous-time event sequence prediction tasks.

This research predicts stock market movements using Vision-Language models.

problem Predicting future stock market direction using historical data.
method Utilizing image and byte-based representations of stock data processed with Vision-Language models.
result The proposed approach significantly outperforms deep learning baselines.

Correlation matrices of foreign exchange rate time series are investigated for 60 world currencies. Minimal Spanning Tree (MST) graphs for the gold, silver and platinum are presented. Inverse power like scaling is discussed for these graphs as well as for four distinct currency groups (major, liquid, less liquid and no…

2008-09-02abs ↗pdf ↗

A new model MTNet uses memory networks for better time series forecasting.

problem Challenges in modeling complex patterns and dependencies in multivariate time series data.
method Memory Time-series network (MTNet) with a large memory component, three encoders, and an autoregressive component.
result MTNet effectively captures long-term patterns and incorporates information from other variables.

STanHop predicts multivariate time series with memory-enhanced capabilities.

problem Predicting multivariate time series with memory-enhanced capabilities.
method Sparse Tandem Hopfield Network (STanHop) with two external memory modules.
result STanHop outperforms dense Hopfield models in memory retrieval error.

The paper develops efficient algorithms for sampling from random spanning trees and determinantal point processes.

problem Sampling from strongly Rayleigh distributions efficiently.
method Optimal sublinear sampling algorithms for random spanning trees and determinantal point processes.
result Achieves optimal sublinear sampling for strongly Rayleigh distributions.

We study the problem of recovering the subspace spanned by the first kk principal components of dd-dimensional data under the streaming setting, with a memory bound of O(kd)O(kd). Two families of algorithms are known for this problem. The first family is based on the framework of stochastic gradient descent. Nevertheles…

2015-06-04abs ↗pdf ↗

Delay-SDE-net models time series with memory and uncertainty, outperforming other models.

problem Accurately modeling time series with memory and uncertainty.
method Stochastic delay differential equations (SDDEs) neural network model with aleatoric and epistemic uncertainty.
result The Delay-SDE-net consistently outperforms other models in predicting time series values and uncertainties.

Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism group of Y has an infinite orbit. We prove that there is no automorphism-invariant measure on the set of spanning trees in the direct product X times Y. This implies that the minimal spanning forest corresponding …

2004-04-05abs ↗pdf ↗

SAGE improves memory efficiency by selectively adding, merging, or ignoring new facts.

problem Efficiently managing new facts in agentic LLMs to avoid costly write-time reasoning.
method SAGE uses a von Mises-Fisher-based density estimator to score and route candidate facts.
result SAGE achieves the best average token-F1 on LoCoMo and reduces add-phase API cost by 3.4x on GPT-4o-mini.

This work extends SVM error bounds to weighted SVM and introduces hyperparameter selection methods.

problem Improving SVM performance through effective hyperparameter selection.
method Extending span error bound theory to weighted SVM and introducing hyperparameter selection methods.
result The span rule is the most effective method for weighted SVM hyperparameter selection and provides the best predictor of test error.

We apply the Zipf power law to financial time series of WIG20 index daily changes (open-close). Thanks to the mapping of time series signal into the sequence of 2k+1 'spin-like' states, where k=0, 1/2, 1, 3/2, ..., we are able to describe any time series increments, with almost arbitrary accuracy, as the one of such 's…

2011-07-17abs ↗pdf ↗

PMI-Masking improves MLM pretraining by masking correlated spans efficiently.

problem Uniform token masking leads to inefficient and suboptimal performance in MLMs.
method PMI-Masking uses Pointwise Mutual Information to mask n-grams with high collocation.
result PMI-Masking reaches half the training time and improves performance.

Paper presents forecasting models for platelet demand.

problem Managing platelet demand and supply is challenging due to variability and short shelf life.
method Utilized ARIMA, Prophet, lasso regression, and LSTM networks on a clinical dataset.
result Multivariate approaches generally have higher accuracy, but simpler ARIMA can suffice with sufficient data.