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

201403604805 · Jun 202019922001200920172026
48 results for Token Optimization

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.

Gradient descent biases linear models in next-token prediction towards data entropy.

problem Optimization bias in next-token prediction models.
method Analysis of gradient descent on linear models with sparse conditional distributions.
result Gradient descent selects parameters that equate token logits differences to log-odds in the data subspace.

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.

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.

Fan tokens surged before World Cup matches, but declined during them, revealing cognitive biases.

problem Analyzing the impact of FIFA World Cup matches on fan tokens.
method Event study and intraday analysis of blockchain-based fan tokens.
result Fan tokens experienced a surge in returns six months before the World Cup, followed by a decline during the matches, revealing asymmetries in performance.

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.

This paper examines how different decoding algorithms for LLMs align with various goals.

problem Consistency of decoding algorithms with different goals in LLMs.
method Analysis of greedy, lookahead, random sampling, and temperature-scaled random sampling algorithms.
result Random sampling is consistent with the true probability distribution, but other goals require optimal algorithms for specific probability distributions.

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.

New approach predicts tokens in context, explaining how ICL emerges.

problem Limited understanding of in-context learning emergence.
method Auto-regressive next-token prediction (AR-NTP) with prompt token-dependency and a two-level expectation.
result ICL emerges from the generalization of sequences and topics.

We formulate statistical watermarking as hypothesis testing and establish near-optimal bounds.

problem Statistical watermarking in the context of hypothesis testing.
method Formulated as a hypothesis testing problem, using coupling of output tokens and rejection regions.
result Established nearly matching upper and lower bounds on the number of i.i.d. tokens required for small Type I and Type II errors.

Transformer models align words through attention weights, closely approximating Optimal Transport.

problem Understanding the internal mechanism of transformer models in language processing.
method Empirical evidence and theoretical analysis of attention weights and their relation to Optimal Transport.
result Transformer models can simulate gradient descent on the dual of entropy-regularized OT problem, providing a theoretical foundation for token alignment.

Dynamic Vocabulary Pruning stabilizes LLM training by removing low-probability tokens.

problem Training Large Language Models (LLMs) with Reinforcement Learning (RL) causes numerical divergence between inference and training.
method Dynamic Vocabulary Pruning (DVP) constrains the RL objective to a safe vocabulary that excludes low-probability tokens.
result DVP stabilizes training by reducing systematic bias introduced by the extreme tail of the token distribution.

This study explains RL training dynamics in LLMs, focusing on token-level optimization and reasoning pattern reshaping.

problem Understanding the training dynamics of RL in LLMs to improve their reasoning capabilities.
method Empirical analysis and theoretical modeling of RL training process, focusing on reasoning patterns and token optimization.
result RL primarily optimizes a sparse subset of critical tokens, reshaping reasoning pattern distributions and affecting model performance.

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 ↗

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.

In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "…

2018-09-27abs ↗pdf ↗

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.

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.

LLMs show surprising confidence in their answers, beyond just tokens.

problem LLMs lack meaningful confidence estimates for their responses.
method Semantic calibration test based on local loss optimality and equivalence classes.
result Base LLMs are semantically calibrated across tasks, contrary to expectations.

Transformer attention layers solve single-location regression tasks.

problem Understanding token-wise sparsity and internal linear representations in attention-based models.
method Introduce single-location regression task and a simplified predictor based on self-attention layers.
result Transformer attention layers are asymptotically Bayes optimal and can learn underlying structures effectively.

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.

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.

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.

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.

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.

The paper analyzes risk spillovers between AI ETFs, AI tokens, and green markets.

problem Risk spillovers among AI ETFs, AI tokens, and green markets.
method R2 decomposition method
result AI ETFs and clean energy act as risk transmitters, while AI tokens and green assets act as receivers.

Tokenized RWAs face liquidity issues despite promising markets.

problem Low trading volumes and limited investor participation in tokenized assets.
method Empirical analysis of tokenized real estate, private credit, and treasury funds.
result Most tokenized assets exhibit low transfer activity and limited secondary trading.

In distributed function computation, each node has an initial value and the goal is to compute a function of these values in a distributed manner. In this paper, we propose a novel token-based approach to compute a wide class of target functions to which we refer as "Token-based function Computation with Memory" (TCM) …

2017-03-26abs ↗pdf ↗

Decoding strategies often exclude human-like tokens, creating a detectable gap in generated text.

problem Decoding strategies exclude contextually appropriate but statistically rare tokens, creating a detectable gap in generated text.
method Analysis of 1.8 million texts across 8 language models, 5 decoding strategies, and 53 hyperparameter configurations.
result 8-18% of human-selected tokens fall outside typical truncation boundaries, indicating a detectable gap.

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.