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

20 results for “flexible chunking”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.CVEmpiricalRecentJul 3, 2026

Flex-Forcing: Towards a Unified Autoregressive and Bidirectional Video Diffusion Model

Xinyin Ma, Julius Berner, Chao Liu, Arash Vahdat +2 more

This paper introduces Flex-Forcing, a framework for video generation that enables a model to operate under both bidirectional and autoregressive generation regimes, achieving better video quality and…

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.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.LGcs.AIRecentMay 31, 2026

Soft-NBCE: Entropy-Weighted Chunk Fusion for Long-Context

Shihao Ji, Mingyu Li, Zihui Song

Soft-NBCE introduces soft entropy-weighted chunk fusion to overcome the semantic fragmentation caused by hard chunk selection in long-context LLMs, significantly improving performance on multi-hop ben…

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.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.IREmpiricalRecentJun 26, 2026

Listwise Explanation of Embedding-Based Rankings via Semantic Chunk Grouping

Hyunkyu Kim, Yeeun Yoo, Youngjun Kwak

The paper introduces ChunkGroupSHAP, a listwise Shapley method that clusters semantantly related chunks into shared cross-document features for dense semantic ranking.

View →
cs.LGcs.AIeess.ASRecentMay 31, 2026

MURMUR: An Efficient Inference System for Long-Form ASR

Wei-Tzu Lee, Keisuke Kamahori, Baris Kasikci

Murmur is an efficient inference system for long-form ASR that resolves the accuracy-latency trade-off by optimizing both inter-chunk processing and intra-chunk attention mechanisms.

View →
cs.AIRecentMay 31, 2026

AnyEdit++: Adaptive Long-Form Knowledge Editing via Bayesian Surprise

Bowen Tian, Caixue He, Jiemin Wu, Jingying Wang +3 more

AnyEdit++ introduces a structure-aware framework that uses Bayesian Surprise to adaptively segment long-form knowledge, significantly improving the coherence and accuracy of knowledge editing in LLMs.

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.AIRecentMay 29, 2026

SLAT: Segment-Level Adaptive Trimming for Efficient CoT Reasoning

Jian Yao, Xiongcai Luo, Ran Cheng, Kay Chen Tan

The paper proposes SLAT, a segment-level adaptive trimming framework, which efficiently reduces redundant reasoning in large language model CoT outputs by selectively suppressing segments with low mar…

View →
cs.DSTheoreticalRecentJul 3, 2026

Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)

Michael Kaibel, Petra Mutzel

This paper introduces structured cut sets, a novel preprocessing technique for Maximum k-Cut, and extends existing techniques from Maximum Cut. The rules are optimality-preserving and yield significan…

View →
cs.CLcs.AIRecentJun 1, 2026

From Layers to Submodules: Rethinking Granularity in Replacement-Based LLM Compression

Elia Cunegatti, Marcus Vukojevic, Erik Nielsen, Giovanni Iacca

The paper proposes SubFit, a novel compression technique that achieves superior LLM compression by replacing non-contiguous, submodule-level components (Attention and FeedForward) with lightweight res…

View →
cs.CLRecentJun 1, 2026

What to Format and How: A Benchmark and Workflow Approach for Document Formatting

Shihao Rao, Liang Li, Jiapeng Liu, Tong Lin +5 more

The paper introduces DocFormBench, a new benchmark for content-aware document formatting, and proposes DocFormFlow, a workflow that improves formatting accuracy and efficiency by decoupling target loc…

View →
cs.DCcs.AIcs.CLRecentJun 1, 2026

Self-Conditioned Positional HNSW for Overlap-Aware Retrieval in Chunked-Document RAG Systems: Method and Industrial Evidence-Quality Audit

Nataraj Agaram Sundar, Tejas Morabia

The paper introduces Self-Conditioned Positional HNSW (SCP-HNSW), a method that modifies chunk embeddings and retrieval process to mitigate redundant evidence retrieval from overlapping document chunk…

View →
cs.DCEmpiricalRecentJul 2, 2026

HCMS: Head-Chunked Multi-Stream Pipeline for Communication-Computation Overlap in Long-Sequence Parallel Attention

Chao Yuan, Pan Li, Yingnan Sun, Jing Liu

This paper proposes Head-Chunked Multi-Stream Pipeline (HCMS) to exploit the computational independence of multi-head attention and achieve fine-grained communication-computation overlap, resulting in…

View →
cs.CLEmpiricalRecentJul 9, 2026

DominoTree: Conditional Tree-Structured Drafting with Domino for Speculative Decoding

Saw S. Lin, Jyh-Shing Roger Jang

DominoTree, a new best-first draft tree method for LLM inference, achieves up to 6.6x speedup over autoregressive decoding and the highest mean accept length, using a GPU-native CUDA-graph builder.

View →
cs.CLRecentMay 31, 2026

Efficient RAG with Intent-Aware Retrieval and Semantics-Preserving Chunking

Fachrina Dewi Puspitasari, Chaoning Zhang, Jiaquan Zhang, Zhicheng Wang +5 more

The paper proposes InSemRAG, an enhanced RAG framework that improves retrieval accuracy and knowledge integrity by incorporating intent-aware retrieval and semantics-preserving chunking, achieving sta…

View →
cs.HCEmpiricalRecentJul 22, 2026

A Task Taxonomy for Edge and Trail Bundling

Markus Wallinger, Stephen G. Kobourov

The paper assembles a corpus of 102 papers on edge bundling and derives a task taxonomy for reasoning about bundled visualizations.

View →