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

56113169225 · Jun 202019922001200920172026
48 results for Global Memory

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.

Memory-Augmented Meta-Optimization improves cold-start recommendation.

problem Cold-start problem in recommender systems for new users or items.
method Memory-Augmented Meta-Optimization approach with personalized and task-specific memories.
result Significant improvement in cold-start recommendation performance on multiple datasets.

A new L-BFGS method tackles large-scale optimization with fewer evaluations.

problem Efficiently solving large-scale unconstrained optimization problems.
method Proposes a regularized L-BFGS method with line search techniques.
result Shows global convergence and robust performance in numerical tests.

HawkesLLM models text generation with temporal influence, improving semantic alignment under limited memory.

problem Path-dependent uncertainty in agentic text-simulation systems.
method HawkesLLM framework separates temporal influence modeling from text generation, using a multivariate Hawkes process and a language model.
result HawkesLLM improves late-stage semantic alignment under a compact prompt-memory budget.

Global convergence of an online (stochastic) limited memory version of the Broyden-Fletcher- Goldfarb-Shanno (BFGS) quasi-Newton method for solving optimization problems with stochastic objectives that arise in large scale machine learning is established. Lower and upper bounds on the Hessian eigenvalues of the sample …

2014-09-06abs ↗pdf ↗

CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.

problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.

KineticSim accelerates financial market simulations 3406x over CPU.

problem Simulating financial markets at scale with multi-agent models is bottlenecked by sequential processing and GPU kernel overhead.
method Formalized and implemented a reusable parallel design pattern for iterative multi-agent reductions in thread-block shared memory.
result Achieved a peak throughput of over 54.7 billion agent-events per second, delivering 3406x speedup over CPU.

KineticSim: A lightweight, high-performance execution engine for real-time market simulators

problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))

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 ↗

ECPv2 optimizes Lipschitz functions efficiently and scalably.

problem Global optimization of Lipschitz-continuous functions with unknown Lipschitz constants.
method Adapting the Every Call is Precious (ECP) framework, ECPv2 introduces adaptive lower bounds, Worst-m memory, and random projections to reduce computational cost and improve acceptance regions.
result ECPv2 retains ECP's no-regret guarantees with optimal finite-time bounds and expands the acceptance region with high probability.

Large language models based on transformers have achieved great empirical successes. However, as they are deployed more widely, there is a growing need to better understand their internal mechanisms in order to make them more reliable. These models appear to store vast amounts of knowledge from their training data, and…

2023-06-01abs ↗pdf ↗

Hydra boosts efficiency for long-context reasoning in resource-constrained settings.

problem Quadratic complexity of transformers limits long-context reasoning in resource-constrained systems.
method Hydra uses a modular architecture with adaptive routing between sparse global attention, mixture-of-experts, and dual memories.
result Hydra achieves significant throughput and accuracy improvements for long-context reasoning.

New cooperative dynamics enhances retrieval performance in neural networks.

problem Understanding emergent computational capabilities in disordered systems.
method Leveraging statistical mechanics, extended neural network architecture for hetero-associative memory.
result Layers trained with less informative datasets develop retrieval regions of the same amplitude, leading to optimal performance.

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.

A federated model learns shared archetypes from heterogeneous clients in continual learning.

problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.

The paper examines how long-memory dynamics, rough-volatility, and persistence affect equity volatility forecasting.

problem The study investigates how long-memory dynamics, rough-volatility, and persistence impact equity volatility forecasting.
method The paper combines semiparametric long-memory estimation, rough-volatility diagnostics, and structured forecasting regressions.
result Persistence measures improve out-of-sample volatility forecasts, particularly during periods of elevated market volatility and in volatility-managed portfolio applications.

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.

We introduce "TriMap"; a dimensionality reduction technique based on triplet constraints, which preserves the global structure of the data better than the other commonly used methods such as t-SNE, LargeVis, and UMAP. To quantify the global accuracy of the embedding, we introduce a score that roughly reflects the relat…

2019-10-01abs ↗pdf ↗

LSTMs outperform DFM in nowcasting COVID-19 economic variables.

problem Timely estimation of macroeconomic variables during the pandemic.
method Comparison of LSTM and DFM performance on three variables (export values, volumes, and services exports).
result LSTMs outperformed DFM in two-thirds of variable/quarter combinations.

The paper connects PSO and CBO methods using stochastic modeling and mean-field limits.

problem Global optimization problems with particle swarm optimization and consensus based optimization.
method Stochastic differential equations and mean-field approximation to derive macroscopic hydrodynamic equations.
result Derives mean-field approximation for PSO and links it to CBO methods.

This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.

problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.

DeepPPMNet forecasts EMS demand and performs causal analyses for policy-making.

problem Accurate prediction and causal analysis of EMS demand for effective policy-making.
method DeepPPMNet, a LSTM-based framework, globally forecasts and analyzes causal relationships using Granger causality.
result DeepPPMNet outperforms traditional methods in forecasting EMS demand and policy-making.

Global methods outperform local in forecasting groups of time series, even in heterogeneous datasets.

problem Forecasting groups of time series, especially in heterogeneous datasets.
method Local methods consider each series separately, global methods fit a single model to all series.
result Global methods can outperform local methods in forecasting groups of time series, even in heterogeneous datasets.

A bridge between continuous signals and discrete Ising spins for associative memory.

problem Associative memory in continuous-signal-driven Ising spin systems.
method Multilayer Ising framework with PCA whitening and SimHash projection, coupled to pseudo-inverse memory couplings.
result Finite-size scaling of operational storage capacity with αc(N)=αc()cN1/2α_c(N)=α_c(\infty)-c\,N^{-1/2}, approaching αc()0.50α_c(\infty)\approx 0.50.

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 ↗

Research uses SWT and BDLSTM to forecast stock and oil prices amid COVID-19.

problem Impact of COVID-19 on stock and oil prices forecasting.
method Integrates Stationary Wavelet Transform and Bidirectional Long Short-Term Memory networks.
result BDLSTM+WT-ADA achieved satisfactory results in Crude Oil price forecasting.

SogCLR uses small batch sizes for global contrastive learning, achieving similar performance to SimCLR.

problem Existing contrastive learning methods require large batch sizes or large feature dictionaries.
method SogCLR, a memory-efficient Stochastic Optimization algorithm for global contrastive learning.
result SogCLR with small batch sizes (e.g., 256) achieves similar performance to SimCLR with large batch sizes (e.g., 8192).

Proposes a novel model for healthcare and SME credit risk prediction.

problem Lack of guidance from global view in sequence representation learning for time series modeling.
method Hierarchical Global View-guided (HGV) sequence representation learning framework with GGE and ββ-Attn modules.
result Competitive prediction performance compared with other known baselines.