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.
New neural networks model complex phenomena with fewer parameters.
We investigate the probability distribution of the volatility return intervals for the Chinese stock market. We rescale both the probability distribution and the volatility return intervals as to obtain a uniform scaling curve for different threshold value . The scali…
Many engineers wish to deploy modern neural networks in memory-limited settings; but the development of flexible methods for reducing memory use is in its infancy, and there is little knowledge of the resulting cost-benefit. We propose structural model distillation for memory reduction using a strategy that produces a …
The memory capacity of linear echo state networks is accurately calculated using new numerical methods.
In this survey we review some results concerning negatively curved exotic strucutres (DIFF and PL) and its (unexpected) implications on the limitations of some analytic methods in geometry. This article is dedicated to the memory of Armand Borel.
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…
Invites geometers to Garside theory for mapping class groups.
We propose a max-pooling based loss function for training Long Short-Term Memory (LSTM) networks for small-footprint keyword spotting (KWS), with low CPU, memory, and latency requirements. The max-pooling loss training can be further guided by initializing with a cross-entropy loss trained network. A posterior smoothin…
The paper introduces a new short rate model with memory components.
LanguaShrink compresses prompts using psycholinguistic principles to reduce costs.
Low-rank metric learning aims to learn better discrimination of data subject to low-rank constraints. It keeps the intrinsic low-rank structure of datasets and reduces the time cost and memory usage in metric learning. However, it is still a challenge for current methods to handle datasets with both high dimensions and…
The possibility of using player engagement predictions to profile high spending video game users is explored. In particular, individual-player survival curves in terms of days after first login, game level reached and accumulated playtime are used to classify players into different groups. Lifetime value predictions fo…
Proposes a novel SAM operator for separate item and relational memories.
In this paper, we propose a dual memory structure for reinforcement learning algorithms with replay memory. The dual memory consists of a main memory that stores various data and a cache memory that manages the data and trains the reinforcement learning agent efficiently. Experimental results show that the dual memory …
Stable Hadamard Memory improves reinforcement learning by efficiently managing memory.
New memory allocation scheme improves image generation performance.
DAM with MRL improves relational reasoning in MANNs.
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…
mGRN improves multivariate time series prediction by managing marginal and joint memories.
Model combines long-term and short-term memory using conceptors.
Single training run learns optimal VAE parameters for various β values.
Learning to remember long sequences remains a challenging task for recurrent neural networks. Register memory and attention mechanisms were both proposed to resolve the issue with either high computational cost to retain memory differentiability, or by discounting the RNN representation learning towards encoding shorte…
In recent years, memory-augmented neural networks(MANNs) have shown promising power to enhance the memory ability of neural networks for sequential processing tasks. However, previous MANNs suffer from complex memory addressing mechanism, making them relatively hard to train and causing computational overheads. Moreove…
Enhanced Hopfield model boosts memory retrieval capacity.
Current generation of memory-augmented neural networks has limited scalability as they cannot efficiently process data that are too large to fit in the external memory storage. One example of this is lifelong learning scenario where the model receives unlimited length of data stream as an input which contains vast majo…
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 …
Memory-constrained algorithms need superlinear memory for efficient convex optimization.
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…
Generative diffusion models mimic biological memory networks, encoding associative dynamics in deep neural weights.
A new model for sequential memory using temporal predictive coding.
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…
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 …
A new memory system handles non-stationary environments by self-sizing and retaining memories.
Paper questions RNN and LSTM's long-term memory and introduces a new definition.
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…
Neural networks powered with external memory simulate computer behaviors. These models, which use the memory to store data for a neural controller, can learn algorithms and other complex tasks. In this paper, we introduce a new memory to store weights for the controller, analogous to the stored-program memory in modern…
Augmenting a neural network with memory that can grow without growing the number of trained parameters is a recent powerful concept with many exciting applications. We propose a design of memory augmented neural networks (MANNs) called Labeled Memory Networks (LMNs) suited for tasks requiring online adaptation in class…
We study the long-term memory in diverse stock market indices and foreign exchange rates using the Detrended Fluctuation Analysis(DFA). For all daily and high-frequency market data studied, no significant long-term memory property is detected in the return series, while a strong long-term memory property is found in th…
New memory effect discovered in gravitational wave behavior.
MEMGAN uses memory to improve anomaly detection by isolating abnormal data.
Memory is increasingly often the bottleneck when training neural network models. Despite this, techniques to lower the overall memory requirements of training have been less widely studied compared to the extensive literature on reducing the memory requirements of inference. In this paper we study a fundamental questio…
Tensor models decode human perception and memory using SPO triples.
Memory-limited learning tackles adversarial bandits with reduced storage.
We consider a novel question answering (QA) task where the machine needs to read from large streaming data (long documents or videos) without knowing when the questions will be given, which is difficult to solve with existing QA methods due to their lack of scalability. To tackle this problem, we propose a novel end-to…
Our research is focused on understanding and applying biological memory transfers to new AI systems that can fundamentally improve their performance, throughout their fielded lifetime experience. We leverage current understanding of biological memory transfer to arrive at AI algorithms for memory consolidation and repl…
A novel memory mechanism for reinforcement learning agents that stores past events in human-readable language.
Unified model explains volatility memory in stocks and forex.
Global Memory Augmentation (GMAT) improves Transformer performance on long documents.