ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “item tokenization”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.IRcs.AIEmpiricalRecentJun 18, 2026

Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation

Ruizhong Qiu, Yinglong Xia, Dongqi Fu, Hanqing Zeng +5 more

This paper proposes G2Rec, a scalable framework for industrial-scale generative recommendation that unifies graph-based user co-engagement modeling and semantic tokenization.

View →
cs.CLcs.LGRecentJun 1, 2026

Machine Learning for Coding Retail Product Names to Consumer-Price Categories: A Rule-plus-Bag-of-Words Pipeline with Reliability-Weighted Human-in-the-Loop Labeling

Vladimir Beskorovainyi

The paper proposes a robust, multi-stage pipeline combining rule-based classification and machine learning to map noisy retail product names to standardized consumption categories, finding that simple…

View →
cs.CLcs.DSRecentMay 29, 2026

Incremental BPE Tokenization

Shenghu Jiang, Ruihao Gong

The paper introduces an efficient, novel algorithm for incremental Byte Pair Encoding (BPE) tokenization that processes input text prefix by prefix, achieving significant speedups and enabling streami…

View →
cs.LGcs.AIcs.CLEmpiricalRecentJul 24, 2026

Cross-Tokenizer On-Policy Distillation via Byte-Prefix Marginalization

Hao Wang, Kun Yuan, Wenlin Zhong, Minglei Zhang +3 more

This paper introduces Byte-Prefix Marginalization (BPM), a method for consolidating open-weight language models through on-policy distillation while preserving teacher probability mass and maintaining…

View →
cs.AIcs.CLRecentMay 28, 2026

Notation Matters: A Benchmark Study of Token-Optimized Formats in Agentic AI Systems

Lorenz Kutschka, Bernhard Geiger

This study benchmarks token-optimized formats (TOON and TRON) against JSON in end-to-end agentic AI systems, finding that TRON significantly reduces token overhead with minimal performance degradation…

View →
cs.CLRecentMay 30, 2026

Chunking Methods on Retrieval-Augmented Generation - Effectiveness Evaluation Against Computational Cost and Limitations

Mateusz Śmigielski, Michał Rajkowski, Mateusz Zbrocki, Michał Bernacki-Janson +4 more

This study systematically evaluates a wide range of chunking methods for Retrieval-Augmented Generation (RAG) to assess their effectiveness and highlight the overlooked challenges associated with chun…

View →
cs.IREmpiricalRecentJul 7, 2026

Learn to Pool: Lightweight Fine-Tuning for Flexible Multi-Vector Compression

Stefan Josef

The paper proposes lightweight fine-tuning as an alternative to pooling-aware training for reducing vector count in late interaction models, achieving broad gains and high compression rates.

View →
cs.AIRecentMay 28, 2026

Accelerating Constrained Decoding with Token Space Compression

Michael Sullivan, Alexander Koller

The paper introduces CFGzip, an offline token space compression technique that significantly reduces the computational overhead of constrained decoding, making complex grammar enforcement feasible at…

View →
cs.SDcs.AIeess.ASRecentMay 28, 2026

HoliTok:A Coutinuous Holistic Tokenization with Robust Dual Capabilities of Speech Generation and Understanding

Bohan Li, Shi Lian, Hankun Wang, Yiwei Guo +5 more

HoliTok introduces a novel continuous holistic tokenization model that provides a unified, high-fidelity latent representation for simultaneously supporting both speech generation and speech understan…

View →
cs.IREmpiricalRecentJun 10, 2026

CompRank: Efficient LLM Reranking via Token-Level Compression and Decoding-Free Scoring

Xuan Lu, Haohang Huang, Yingqi Fan, Junlong Tong +4 more

This paper proposes CompRank, a token-efficient reranking framework for large language models that reduces redundant computation and achieves strong reranking performance.

View →
cs.IRcs.AIcs.CLRecentMay 28, 2026

Latent Terms: Dense Retrievers Contain Trivially Extractable BM25-ready Zipfian Vocabularies

Benjamin Clavié, Sean Lee, Aamir Shakir, Makoto P. Kato

The paper introduces Latent Terms, a method that shows dense retrieval models implicitly learn sparse, Zipfian vocabularies that can be used for classical BM25-style sparse scoring without requiring s…

View →
cs.IREmpiricalRecentJul 11, 2026

SVD-RAG: Efficient Tree-Organized Retrieval-Augmented Generation via Singular Value Decomposition

Zhihui Sun

This paper introduces SVD-RAG, a cost-efficient and content-adaptive summarization method for hierarchical Retrieval-Augmented Generation systems using Singular Value Decomposition on dense sentence e…

View →
cs.CLRecentMay 31, 2026

Peacemaker at ATE-IT: Automatic term extraction from Italian text for waste management data using encoder model

Mahdi Bakhtiyarzadeh, Hadi Bayrami Asl Tekanlou, Jafar Razmara

The paper proposes a low-cost and interpretable fine-tuning extraction strategy for automatic term extraction, demonstrating consistent and balanced performance on the ATE Shared Task.

View →
cs.IRcs.AIcs.CLEmpiricalRecentJul 2, 2026

Evaluating Chunking Strategies for Retrieval-Augmented Generation on Academic Texts

Valentin J. J. Kreileder, Johannes Reisinger, Andreas Fischer

This paper evaluates the effectiveness of cluster-based semantic chunking compared to fixed-size and recursive chunking in Retrieval-Augmented Generation systems using the Retrieval Augmented Generati…

View →
cs.CLEmpiricalRecentJul 24, 2026

grapheme-kit: Grapheme-Level Metrics and Text Processing for Multilingual NLP

Izzath Nisfer, Ashini Kavindya, Ovindu Atukorala, Purushoth Velayuthan +1 more

The paper introduces grapheme-kit, an open-source Python library that extends lexical metrics to operate on grapheme clusters instead of Unicode code points, and provides improved grapheme processing…

View →