arXiv Machine Learning June 8, 2026 By Franziska Weindel, Michael Girsch, Reinhard Heckel

Trace Reconstruction with Language Models

Read the original on arXiv Machine Learning →

arXiv:2507. 12927v2 Announce Type: replace Abstract: The general trace reconstruction problem seeks to recover an original sequence from its noisy copies independently corrupted by insertions, deletions, and substitutions.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Aug 3

PTP: Previous-Token Prediction based LLM Inversion for Near-Exact Prompt Reconstruction

arXiv:2607. 29378v1 Announce Type: cross Abstract: Large language models (LLMs) generate text by auto-regressively sampling the next token.

By Pirzada Suhail, Nagasai Saketh Naidu, Atanu R Sinha, Amit Sethi

llms fine-tuning

arXiv AI

3d ago

TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models

TraceQuery proposes a new approach for efficient inference in diffusion large language models (dLLMs) by guiding computation using the full-denoising trajectory. Instead of broadly repairing representation errors, it predicts a small set of near-future trajectory-relevant positions, queries only those, and lets the backbone choose the best prediction. This lightweight sparse decoding framework achieves a superior quality‑computation trade‑off across tasks, model variants, and families.

By Yukai Jin, Zhankai Ye, Jiayue Yang, Fangyi Li, Shuoqiu Li, Xu Gao, Shibo Li, Xin Liu, Shangqian Gao

llms diffusion

arXiv AI

Jul 7

Separating Representation from Reconstruction Enables Scalable Text Encoders

arXiv:2607. 04011v1 Announce Type: cross Abstract: While decoders have rapidly scaled, encoders have remained largely unchanged since BERT.

By Megi Dervishi, Mathurin Videau, Yann LeCun

efficiency benchmarks

arXiv Machine Learning

Sep 16

LoopSpec: Pipelined Self-Speculative Decoding for Looped Transformers

arXiv:2609.17184v1 Announce Type: new Abstract: Looped Transformers achieve strong performance with compact parameter sizes by repeatedly applying a shared stack of Transformer blocks across recurren...

By SangLyul Cho, Langqing Cui, Sehoon Kim, Dongsu Han, Insu Han

llms benchmarks

arXiv Machine Learning

Aug 18

RecurrentGPT: Expressive Depth through Recurrent Modulation in Transformers

arXiv:2608. 15062v1 Announce Type: cross Abstract: Scaling transformer language models creates an inherent tension between expressivity and memory efficiency.

By Amr Hegazy, Amr Alanwar, Mostafa Elhoushi

llms efficiency

arXiv Computation and Language

Sep 24

Distilling Sequential Computation in Transformer Language Models

arXiv:2609.27233v1 Announce Type: new Abstract: Transformer language models process sequences token by token in an autoregressive manner, making growing contexts increasingly expensive. Yet many adja...

By Zixuan Lan, Jessica Yang, Yanhong Li, Karen Livescu, Jiawei Zhou

llms rag nlp efficiency

One email a morning, machine-written

Related stories

PTP: Previous-Token Prediction based LLM Inversion for Near-Exact Prompt Reconstruction

TraceQuery: learning what to recompute from full-denoising trajectory in diffusion language models

Separating Representation from Reconstruction Enables Scalable Text Encoders

LoopSpec: Pipelined Self-Speculative Decoding for Looped Transformers

RecurrentGPT: Expressive Depth through Recurrent Modulation in Transformers

Distilling Sequential Computation in Transformer Language Models