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

144289433577 · Jun 202019922001200920172026
48 results for token efficiency

This research improves capital efficiency and impermanent loss in cryptocurrency markets using multi-token trading pools.

problem Poor impermanent loss and capital efficiency in automated market makers.
method Analysis and construction of a multi-token token proactive market maker (MPMM).
result MPMM shows better impermanent loss and capital efficiency than comparable market makers.

DOS improves language model generation by considering inter-token dependencies.

problem Lack of sequence-level information and inter-token dependencies in existing decoding strategies.
method Dependency-Oriented Sampler (DOS) that uses attention matrices to approximate inter-token dependencies.
result DOS consistently achieves superior performance on code generation and mathematical reasoning tasks.

This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.

problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.

xVal tokenizes numbers continuously for better scientific model training.

problem Lack of continuous numerical tokenization for scientific datasets in LLMs.
method xVal: Continuous numerical tokenization strategy.
result xVal outperforms other numerical tokenization methods on scientific datasets.

LLM-as-a-service prices vary arbitrarily due to tokenization multiplicity.

problem Arbitrary price variation in LLM-as-a-service due to multiple tokenizations of the same output.
method Introduce canonical generation to restrict LLMs to unique tokenizations and develop an efficient sampling algorithm.
result Our sampling algorithm for canonical generation solves tokenization multiplicity and maintains comparable performance and runtime to standard sampling.

Study reveals risks of investing in new crypto-tokens in decentralized exchanges.

problem Risks associated with investing in newly created tokens in decentralized exchanges.
method Analysis of financial impact, market dynamics, profitability, and liquidity manipulations.
result Significant market liquidity trapped in honeypots, reducing market efficiency and misleading investors.

Currently, engineers at substation service providers match customer data with the corresponding internally used signal names manually. This paper proposes a machine learning method to automate this process based on substation signal mapping data from a repository of executed projects. To this end, a bagged token classi…

2018-02-13abs ↗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.

Shampoo achieves higher token efficiency than Muon in language models.

problem Understanding the relationship and relative data efficiency of Shampoo and Muon compared to Adam and Signum.
method Extensive experiments on language models, demonstrating Shampoo's higher efficiency and decomposing its updates.
result Shampoo's benefits are attributed to its application to weight matrices, challenging interpretations based on variance adaptation and whitening.

Attention mechanism learns to focus on sparse tokens efficiently.

problem Detecting weak, rare, and sparsely located features in long sequences.
method Theoretical analysis and training of a single-layer attention classifier in a sparse-token classification model.
result A single-layer attention classifier can achieve vanishing test error with logarithmic signal strength growth, unlike linear classifiers requiring linear growth.

Recurrent Neural Networks (RNNs) are among the most popular models in sequential data analysis. Yet, in the foundational PAC learning language, what concept class can it learn? Moreover, how can the same recurrent unit simultaneously learn functions from different input tokens to different output tokens, without affect…

2019-02-04abs ↗pdf ↗

Improved weather forecasting with gridded pseudo-token TNPs.

problem Handling large-scale, unstructured spatio-temporal data in weather forecasting.
method Introducing gridded pseudo-token transformer neural processes (TNPs) with efficient attention mechanisms.
result Consistently outperforms baselines on various synthetic and real-world regression tasks involving large-scale data.

New method improves combinatorial optimization by capturing dependencies among solution variables.

problem Performance limitations in solving combinatorial optimization problems using independent solution variables.
method Subgraph tokenization and variational annealing to capture dependencies and improve learning efficiency.
result Empirical evidence shows superior performance of autoregressive methods with tokenization and annealed entropy regularization.

Fractured Sampling improves LLM reasoning efficiency by truncating CoT trajectories.

problem Efficiently scaling reasoning in large language models with limited tokens.
method Integrating truncated Chain-of-Thought (CoT) with Fractured Sampling across multiple dimensions.
result Fractured Sampling achieves superior accuracy-cost trade-offs compared to full CoT.

Reinforcement learning after next-token prediction aids in learning from diverse sequence lengths.

problem Learning from sequences of varying lengths and complexity.
method Introducing a framework to study reinforcement learning with autoregressive transformers, focusing on next-token prediction and mixture distributions of short and long sequences.
result Reinforcement learning after next-token prediction enables autoregressive transformers to generalize from long sequences, even when they are rare.

Generative model predicts financial market order flow with high accuracy.

problem Creating realistic order flow models for financial markets.
method Token-level autoregressive generative model using deep state space layers.
result Model generates high-quality order flow data with low perplexity.

Neural sequence generation is typically performed token-by-token and left-to-right. Whenever a token is generated only previously produced tokens are taken into consideration. In contrast, for problems such as sequence classification, bidirectional attention, which takes both past and future tokens into consideration, …

2019-08-16abs ↗pdf ↗

This study categorizes RWA tokenization challenges and solutions.

problem Navigating the gap between on-chain deterministic code and off-chain probabilistic reality.
method Taxonomy and comparative analysis of RWA protocols, legal and technical standards.
result RWA tokenization requires overcoming legal and technical interoperability issues.

Mathematical framework for language models processes text and predicts next tokens.

problem Understanding and optimizing the performance of large language models.
method Describes encoding, prediction models, learning from data, and deployment of LLMs.
result Demonstrates remarkable empirical successes and provides a platform for further research.

This study examines whether tokenized assets improve liquidity and finds significant differences across categories.

problem Improving liquidity for real-world assets through tokenization.
method Examined tokenized real-world assets using Ethereum-based data, measuring liquidity through turnover, active addresses, and active-month indicator.
result Gold-backed tokens show more persistent on-chain activity than Treasury and private-credit-related products, but asset value alone does not reliably predict liquidity.

SSMs combined with neural networks match Transformers in dynamic token selection.

problem Understanding the capabilities of SSMs in dynamic token selection.
method Exploring SSMs combined with fully connected neural networks.
result SSMs combined with nonlinear layers can efficiently solve challenging tasks and estimate functions.

Enhances CMS with Bayesian nonparametrics for better low-frequency token estimation.

problem Improving frequency estimation of low-frequency tokens in data streams.
method Integrates Bayesian nonparametrics (Pitman-Yor process) into CMS for more accurate frequency estimation.
result CMS-PYP outperforms CMS and CMS-DP in estimating low-frequency tokens.

Paper introduces a method to assess liquidity risk in meme tokens using entity-linked address analysis.

problem High market volatility and vulnerability to manipulation in meme tokens.
method Multi-dimensional approach integrating fund flow analysis, behavioral similarity, and anomalous transaction detection.
result Significant disparities between apparent and actual liquidity in meme token markets.

Transformer models waste resources on long-context tasks.

problem Redundant attention computations in Transformer models for long-context tasks.
method Reformulate sequence modeling as supervised learning, analyze attention sparsity, formulate attention optimization as linear coding problem, propose Dynamic Group Attention.
result DGA reduces computational costs while maintaining performance.

Proving that next-token prediction makes language models generate coherent long documents.

problem Understanding why language models generate coherent documents despite focusing on next-token prediction.
method Proving the power of next-token prediction in learning longer-range structure using Recurrent Neural Networks (RNN).
result Optimizing next-token prediction in RNNs yields a model that closely approximates the training distribution, even for long-range coherence.

CoT improves transformer sample efficiency by reducing input token dependencies and attention sparsity.

problem Transformer sample inefficiency in simple tasks.
method Demonstrated through parity-learning setup, showing CoT reduces required samples from exponential to polynomial.
result Transformer learns function within polynomial samples with CoT, requiring exponential samples without CoT.

A new method uses a frozen language model to improve sample efficiency in reinforcement learning.

problem Improving sample efficiency in reinforcement learning with partially observable environments.
method FROZEN Hopfield network and HELM (History Embedding Language Model) method.
result HELM achieves new state-of-the-art results on Minigrid and Procgen environments.

QA-Token improves tokenization for noisy data, boosting model performance.

problem Tokenization ignores data quality, limiting model effectiveness on noisy corpora.
method QA-Token combines signal quality with vocabulary construction through bilevel optimization and reinforcement learning.
result QA-Token achieves state-of-the-art performance on genomic and financial datasets.

Minimal token perturbations reveal how Transformer models process information.

problem Understanding information propagation in Transformer models for interpretability.
method Study of minimal token perturbations on embedding space.
result Rare tokens cause larger shifts, and input information mixes deeper.

New insights show stochastic initialization prevents token clustering in deep Transformers.

problem Understanding token dynamics in deep stochastic Transformers.
method Analysis of deep Transformers with random initialization noise, proving convergence to an interacting-particle system on the sphere.
result Initialization noise prevents token clustering, leading to antipodal formations.