arXiv:2610.02817v1 Announce Type: cross
Abstract: Large Language Model (LLM) watermarking provides a lightweight mechanism for identifying text generated by a specific model, but its robustness remai...
By Yi Wang, Baicheng Chen, Yu Wang, Jian Zhao, Yilei Chen, Tianxing He
arXiv:2610.02765v1 Announce Type: cross
Abstract: Monitoring planned driving trajectories requires accurately estimating the collision likelihood with actors whose motion is itself impacted by the eg...
By Lu\'is Marques, Rong Fang, Disha Kamale, Dmitry Berenson
arXiv:2610.03480v1 Announce Type: new
Abstract: Post-training a large language model (LLM) often requires exploring trade-offs between multiple rewards, but retraining for each trade-off is expensive...
By Alexey Kurennoy, Ramil Yarullin, Fergal Reid
arXiv:2610.02549v1 Announce Type: new
Abstract: Time and event expression extraction are fundamental temporal reasoning tasks, but the problem remains difficult due to annotation ambiguity, domain se...
By Fahmid Shahriar Iqbal, Ritam Dutt, Soumitra Das, Arnav Verma, Sagnik Ray Choudhury
arXiv:2610.03448v1 Announce Type: cross
Abstract: LLM agents increasingly screen tool outputs with small prompt-injection detectors, and teams choose among detectors by their scores on public benchma...
By Zhuowen Liu
arXiv:2610.02388v1 Announce Type: new
Abstract: Existing 3D large language models (LLMs) compromise on two fronts: they compress shapes into latent codebook indices or coordinate text, which removes...
By Ran Dan, Si-Tong Wei, Pengfei Xiong, Wei Zhang, Yadong Mu, Peng-Shuai Wang
arXiv:2510.22276v4 Announce Type: replace-cross
Abstract: Contrastive vision-language models have achieved remarkable progress through large-scale pretraining. Recent work has shown that removing Eng...
By Issa Sugiura, Shuhei Kurita, Yusuke Oda, Daisuke Kawahara, Yasuo Okabe, Naoaki Okazaki
arXiv:2609.33212v2 Announce Type: replace
Abstract: Speaker verification systems achieve high accuracy but provide little account of the acoustic evidence behind their judgments. Making these systems...
By Massa Baali, Sarthak Bisht, Ziyue Qiu, Joseph Konan, Rita Singh, Bhiksha Raj
arXiv:2607.29168v3 Announce Type: replace
Abstract: Authorship Verification (AV) represents an important subfield of digital text forensics and addresses the fundamental question of whether two texts...
By Oren Halvani, Sophie Titze
arXiv:2610.02270v1 Announce Type: cross
Abstract: Medical vision-language model (VLM) evaluation is sensitive to workflow design, prompting strategy, and benchmark construction, yet most studies trea...
By Xinye Yang, Zhusi Zhong, Scott Collins, Grayson Baird, Xuyu Wang, Zhicheng Jiao
arXiv:2610.03370v1 Announce Type: new
Abstract: CLIP's visual encoder produces only global image representations, limiting its use in region-level tasks. Existing adaptations rely on visual prompting...
By Anh-Khoa Dinh-Duc, Duc-Tai Dinh, Tam V. Nguyen, Minh-Triet Tran
arXiv:2610.03252v1 Announce Type: new
Abstract: Generative models of human-object interaction are bounded by the data that exists: everyday activities involve several objects, but most captured datas...
By Daniel Eskandar, Ilya A. Petrov, Gerard Pons-Moll
The paper introduces MECo, a large language model–driven multi‑task evolutionary framework that enables zero‑shot cross‑problem generalization for combinatorial optimization. MECo maintains task‑conditioned heuristic populations, uses a transfer gap based on cross‑task performance to guide interactions, and selects a compact heuristic set that covers source combinations. Experiments on 32 variants of vehicle routing and flexible job‑shop scheduling demonstrate that MECo achieves lower mean costs than eight automated heuristic design baselines and improves both in‑domain and out‑of‑domain performance when integrated with other methods.
By Zhouliang Xie, Changliang Zhou, Genghui Li, Zhenkun Wang
Research: Qwen3.8 27B addition in words
Colin Frasier posted on Bluesky about an experiment he ran over two years ago using GPT-4o to see how well it could "compute the sum but return the answ...
The article explains that a language model can remember a fact only in the direction it was trained, leading it to fail when asked to reverse that fact. It uses a toy example to illustrate how this limitation arises. The piece highlights the asymmetry in how models learn and recall relationships.
By Utkarsh Mangal
Simon Willison has released the September edition of his sponsors‑only monthly newsletter. The issue covers new Fable class models, a pricing war, 3D graphics with Blender and pixel art, LLMs applied to mathematics, accidental cyberattacks, the vulnapocalypse affecting Datasette, his current tools, and software releases for 2026. Sponsors can access the full newsletter for $10/month, with an August preview available for free.
The article explores whether large language model (LLM) agents can discover new ideas by examining their creative potential. It frames this inquiry through the lens of creativity, aiming to assess how LLM agents might generate novel insights or solutions. The discussion is presented as a post on Towards Data Science.
By Shitanshu Bhushan
The paper introduces format‑aware fusion, a method that co‑designs quantization producers with their scale domains and consumer layouts to fully exploit four‑bit floating‑point (FP4) Tensor Cores. Using this approach, the authors pretrain the Llama‑3‑family 8B model on 160 billion tokens, achieving up to 37.9 K tokens/s/GPU—significantly higher than standard bfloat16 or Transformer Engine FP4 baselines. The study demonstrates that FP4 performance depends on the interplay of scaling, operand packing, layout, and execution path, with downstream task rankings diverging from training‑loss rankings.
By Robert Hu
arXiv:2610. 00009v1 Announce Type: new Abstract: Frequency-collapse attention [Zeris, 2026e] achieves large gains over standard dot-product attention by replacing the Q/K dot product with a bandpass-filtered inner product at a learned frequency.
By Athanasios Zeris
The paper introduces a small DeltaNet variant that uses a fixed-size recurrent memory to store 32 key‑value pairings per sequence. With only 32 KiB of matrix state, the model attains 99.95 % mean accuracy across three training seeds when selecting the correct value, and this performance persists even when the pre‑query context is extended to 1,798 tokens. Zeroing the first memory block eliminates recall, and exploratory tests with 48 pairs show near‑chance performance after a quarter of the training budget, indicating no clear capacity limit. Baseline models matched in parameters, including a Transformer, remain near chance, preventing a direct memory‑efficiency comparison.
By Samuel Larson