xoult

New Computation and Language (cs.CL) papers, Tuesday 20 October 2026

285 papers announced on arXiv. Get them ranked for you, free →

  1. Transfer Learning for Power Outage Detection Task with Limited Training Data

    Olukunle Owolabi · arXiv:2305.17817

    Early detection of power outages is crucial for maintaining a reliable power distribution system. This research investigates the use of transfer learning and language models in detecting outages with limited labeled data. By leveraging pretraining and transfer learning, models…

  2. Multi-LLM Systems Exhibit Robust Semantic Collapse

    Weiyi Kong, Shiyang Lai, Jinghua Piao et al. · arXiv:2605.17193

    AI summaryMulti‑LLM systems converge to the same semantic representation over many generations without retraining, a phenomenon called semantic collapse. Despite varied decoding, prompting, agent design, and RL interventions, the collapse persists across model families and long runs.

  3. Transformer-based segmentation of prosodic boundaries in Brazilian Portuguese

    Rodrigo de Freitas Lima, Julio Cesar Galdino, Marcos Vinicius Treviso · arXiv:2607.07408

    AI summarySAMPA fine‑tunes Whisper on BP speech to insert prosodic boundary markers, achieving F1 = 0.731 on in‑distribution data and 0.796 out‑of‑distribution. The model leverages morphosyntactic, semantic, and acoustic cues for boundary detection.

  4. I$^2$-Med: Interpretable Medical Inference through Visual-Guided Dynamic Logits Calibration

    Md Sajid, Shreeyut Maheshwari, Akshat Mishra et al. · arXiv:2610.23858

    AI summaryI$^2$-Med adds a visual‑guidance module that re‑scores generated tokens during inference, favoring words that are visually grounded and contextually consistent, without retraining the model. On OmniMedVQA, it yields clinically relevant, visually faithful VQA outputs and cuts hallucinations.

  5. Modeling Human Behavior in the Prisoner's Dilemma with Large Language Models

    Raina Gao, Tristan Raffo · arXiv:2610.23860

    AI summaryThe study tests open‑source LLMs in repeated Prisoner’s Dilemma, comparing fixed‑partner and shuffled‑partner settings to human data. All models over‑cooperate, with Qwen‑2.5‑7B hitting >80% in shuffled trials versus humans’ 28.5%, showing limited realism.

  6. GardenBench: A lightweight, daily evaluation of LLM capabilities

    Benedict Cummins-Mburu, Mariana Garcia Mejia, Oscar Heath et al. · arXiv:2610.23866

    AI summaryGardenBench offers a lightweight, daily LLM benchmark with 11 test suites that track daily accuracy, cost, and latency for consumer-facing tasks, enabling public comparison of model versions and providers through a live dashboard.

  7. Composable Parametric Demographic Injection for Values Survey Simulation

    Xinyuan Cao, Qingyi Pan, Bangde Du et al. · arXiv:2610.23867

    AI summaryPARADE injects demographic shifts into LLMs via reusable LoRA modules for each attribute, separating task knowledge from demographic effects. In simulations of World Values Survey and SocioBench, it reduces population KL divergence by up to 52.8% while preserving predictive accuracy.

  8. Translating in style: An open-weight alternative to GPT-4 for culturally aligned machine translation

    Thomas Rietman, Hadi Mohammadi, Robert A. Bagheri · arXiv:2610.23868

    AI summaryOpen-weight Hunyuan-MT-7B variants (base, LoRA, GRPO) are evaluated for stylistic alignment in 12 language pairs across formality, politeness, intimacy. Fine‑tuning offers no significant improvement; overall performance lags GPT‑4 mainly on formality but matches or exceeds it for intimacy and Chinese.

  9. Latent Multimodal Memory Reasoning

    Cai Ke, Xinghao Chen, Yuanchen Bei et al. · arXiv:2610.23890

    AI summaryThe paper introduces Latent Multimodal Memory Reasoning (LMMR), a neuro-symbolic framework that maps heterogeneous visual and textual memories into a shared sparse concept space to construct a dynamic memory graph. Experiments show that LMMR significantly outperforms existing methods in long-term multimodal reasoning and response grounding.

  10. TeleTwin: A Calibrated Digital Twin of Telegram Crisis Discourse as a Ground-Truth Testbed for Detecting LLM-Powered Information Operations

    Despoina Antonakaki, Sotiris Ioannidis · arXiv:2610.23944

    Large language models make it cheap to run influence operations whose messages never repeat, yet real platforms offer almost no ground truth for testing whether coordination detectors can find them. The problem is sharpest on Telegram, which moderates little and spreads content…

  11. How Data Scales in Agentic Reinforcement Learning: Laws and Synthesis Strategies

    Bowei He, Yankai Chen, Xiaokun Zhang et al. · arXiv:2610.23946

    AI summaryThe paper decomposes agentic RL data into task, environment, and trajectory axes, finds scaling exponents ordering environment > task > trajectory, and uses these laws to optimize budget allocation, achieving up to 1.7× compute efficiency over naïve scaling.

  12. UltraData-Code: From Raw Repositories to Algorithmically Dense and Task-Oriented Code Data

    Chengying Tu, Hengyu Zhao, Shuaikang Xue et al. · arXiv:2610.23960

    AI summaryUltraData‑Code introduces a tiered data pipeline (L0‑L3) that filters, normalizes, selects algorithmically relevant code, and turns it into structured exercises, yielding ~400B L2 tokens and 150B L3 tokens. Using L2 improves EvalPlus pass@1 by 7.8pp, and adding L3 boosts it by another ~8pp.

  13. LLM Evolutionary Search Strategies Should be Compared by Tokens

    Tal Oved, Roi Pony, Oshri Naparstek et al. · arXiv:2610.23977

    AI summaryLLM evolutionary search is usually benchmarked by proposal counts, but this obscures real compute cost; using token counts shows that evolution’s apparent advantage disappears—evolution only outperforms independent sampling by ~5% in most cases, with a 23–28% margin on only one task.

  14. LLM Evolution in a Simple Simulated Market

    Charlie Pilgrim, Christopher Krupenye, Dora Biro et al. · arXiv:2610.24033

    Arguments that AI systems will evolve in harmful ways are largely made in the abstract. We provide a concrete empirical example. We simulate simple markets consisting of populations of twenty Large Language Model agents tasked with solving arithmetic problems. Agents differ only…

  15. The Window Is in the Reasoning: When LLM Agents Decide to Follow Prompt Injections

    Haoxuan Jia, Yang Liu, Bin Chong et al. · arXiv:2610.24048

    AI summaryThe paper shows that prompt‑injection decisions in LLM agents are largely determined when the injection is read, but reasoning reduces this “read‑time” variance. It finds that multi‑run evaluations are necessary, as single‑run labels can disagree up to 35 %.

  16. Discuss More, Comment Less: Boosting Automated Research via Multi-Perspective Collaborative Review

    Junkai Zhou, Jiajia Wu, Zhaoyi Zhang et al. · arXiv:2610.24050

    As automated research is increasingly adopted for writing papers, automated review has become a critical link between paper generation and quality control. However, existing methods largely rely on single-model feedback or simple review aggregation, failing to explicitly model…

  17. LogicVal:A Logic-Formalized Benchmark for Constraint Satisfaction in Text-to-Image Generation

    Savitha Sam Abraham, Marjan Alirezaie, Hossein Rahnama · arXiv:2610.24051

    AI summaryLogicVal formalizes text‑to‑image evaluation as a constraint‑satisfaction problem, combining neural detection with logical reasoning. It shows a large drop from 98% success on single-object constraints to 53% on multi‑object logical relations, highlighting T2I models’ limited compositional reasoning.

  18. World of SWECraft: Agent Collaboration at Scale via Simulated Software Worlds

    Shannon Zejiang Shen, Yapei Chang, Qiyao Liang et al. · arXiv:2610.24061

    AI summaryThe paper introduces Software World, a simulation framework that creates realistic software ecosystems for multi‑agent collaboration. Experiments show that scaling inference‑time compute yields up to 31% efficiency gains, with most agents finding useful tasks while some high‑performance models stop searching early.

  19. Location, Location, Generation: Where You Ask Matters for Generative Engine Optimization

    Mahe Chen, Nick Koudas · arXiv:2610.24081

    AI summaryGenerative engines tailor cited sources to the user’s declared location rather than network IP. ChatGPT localizes results to the city it is told, while Gemini uses the network country, altering recommended businesses and sources accordingly.

  20. Coopshift: Post-Training Amplifies The Memory Curse In LLM Cooperation

    Jiayuan Liu, Shiyi Du, Tianqin Li et al. · arXiv:2610.24086

    How does post-training change cooperation during repeated interaction? Within each of seven released model lineages, we compare pretrained (Base), supervised fine-tuned (SFT), and subsequent preference- or reward-optimized (Aligned) checkpoints across seven social dilemmas.…

  21. OR-License: Evaluating LLM Agents as Real-World Operations Research Practitioners

    Peisong Wang, Feixue Liu, Yize Meng et al. · arXiv:2610.24087

    AI summaryLarge language model agents can solve real‑world operations research problems directly from client materials, but they rarely match expert solutions. In a benchmark of 31 industrial cases, the best LLM achieved 88% feasibility and 0.87 DAQ, below expert level.

  22. Cache2LoRA: Understanding and Improving Context Internalization

    Yi Fang, Gaurav Srivastava, Zhenyu Bi et al. · arXiv:2610.24107

    AI summaryCache2LoRA generates low-rank parameter updates from a reusable document cache guided by the query. It matches full-context in-context learning performance across 17 tasks while delivering nearly six times the decoding throughput.

  23. Joint, Decoupled, or Agent: When Each Multimodal Alignment Paradigm Wins

    Yi Fang, Gaurav Srivastava, Sirui Ding et al. · arXiv:2610.24108

    AI summaryThe paper compares joint, decoupled, and agent multimodal alignment paradigms across 16 datasets, finding no single winner but that selection depends on supervision budget, task format, and unimodal 5‑NN accuracy, with a diagnostic cascade choosing the best paradigm 71.4% of the time.

  24. Do LMs Know What Variables Do? Interpreting Code Representations via Variable Roles

    Célian Vasson, Daniil Ognev, Kentaro Inui et al. · arXiv:2610.24118

    AI summaryThis paper investigates whether language models and sparse autoencoders capture programming variable roles, introducing a multilingual corpus with static annotations. The results show that models recover these roles successfully, but causal interventions often degrade code correctness.

  25. Prefix-Tuning for Arbitrary Output Sequences on Pretrained Transformers

    Peter Cho-Ho Lam, Ziyi Wang, Zirui Zhou · arXiv:2610.24123

    AI summaryThe paper shows that for any pretrained autoregressive Transformer and any target output within the model’s range, a prefix can be constructed by solving linear systems to force the model to generate that output; it also proves this condition is necessary.

  26. Inside the Loop: A Mechanistic Study of Weight-Tied Transformers on Depth-Bound Algorithmic Tasks

    Magnus Sesodia, Juil Sock, Philip Torr et al. · arXiv:2610.24135

    AI summaryThis paper investigates how weight-tied looped transformers solve multi-step algorithmic tasks by reusing layers across iterations. It finds that looped models act as iterative program learners that outperform identically-trained untied transformers of the same effective depth.

  27. Continual Test-Time Learning with Evolution Strategies

    Guangya Hao, Yiting Duan, Longyan Tan et al. · arXiv:2610.24137

    AI summaryThis paper introduces Evolution Strategy Reinforcement Learning, a framework that uses a population of perturbed policies to generate stable, label-free supervision for continual test-time adaptation in language models. The method improves average accuracy by up to 31.7% and significantly reduces catastrophic forgetting during continual learning across diverse domains.

  28. Preservation and loss of algorithmic structure in experimental diffusion of joint-action norms

    Dhara Yu, Bill D. Thompson · arXiv:2610.24150

    AI summaryThe study tracks how new social norms diffuse across populations, finding that early diffusion favors simpler algorithms, causing complexity loss. However, interactive repair mechanisms preserve complex procedures despite misalignment, showing that collaborative reasoning buffers structural erosion in cultural evolution.

  29. CoDA: A Human-LM Collaborative Codebook Development Assistant for Domain-Specific Text Annotation

    Jaspreet Ranjit, Swaminathan Chellappa, Augusto Rivas Costante et al. · arXiv:2610.24157

    AI summaryCoDA is a human‑LM collaborative tool that speeds domain‑specific codebook creation by iteratively refining guidelines through feedback on model errors. It matched expert codebooks’ accuracy while cutting development time to 2 hours and annotations by fivefold.

  30. Pronouncing Hard Words: Phoneme Adaptation of a Pretrained Conversational Text to Speech Model

    Yashish M. Siriwardena, Dinesh K. Gnanasekaran, Tanmay Laud et al. · arXiv:2610.24164

    AI summaryThis paper adds phoneme controllability to a pretrained conversational text-to-speech model using vocabulary extension, fine-tuning, and inference-time biasing. The method raises out-of-domain pronunciation accuracy for rare drug names from 54.6 percent to 90.7 percent.

  31. Prosodic Structure as a Critical Component in Phonemic Language Modelling at BabyLM Scale

    Bill K. S. Ku, Janet B. Pierrehumbert · arXiv:2610.24172

    AI summaryThe paper adds prosodic annotations to phoneme‑level BabyLM training and shows that a prosodically structured phoneme stream yields the best semantic taxonomic organization at 10M and 100M word scales, outperforming orthographic baselines and matching performance with phonemic models that include boundary cues.

  32. Multi-author style detection with stylistic embeddings

    Man-Ling Sung, Chak Fai Li, Damianos Karakos et al. · arXiv:2610.24184

    AI summaryThe paper fine‑tunes Mistral‑7B embeddings for authorship verification, shows it outperforms DeBERTa on certain user‑generated text types, and combines both embeddings to improve multi‑author style change detection.

  33. Reasoning with Context Management and External Memory

    Man-Ling Sung, William Hartmann, Jiangying Zhou · arXiv:2610.24187

    AI summaryRCMEM adds an external memory to in‑context reasoning, allowing models to retain useful intermediate facts without enlarging the context window. It cuts computation time and improves accuracy on complex math tasks across 0.4–25M‑parameter models and GPT‑2.

  34. Language Models are Lazy Poets: Creative Mode Collapse at Scale

    Jacob A. Matthews, Sil Hamilton · arXiv:2610.24223

    While aligned large language models (LLMs) can successfully complete many creative tasks, their outputs tend to be highly self-similar. Though solutions to this problem of "mode collapse" have been proposed, comprehensive large-scale surveys of the phenomenon in specific textual…

  35. Analyzing Repetition and Interference Effects in Memory-Constrained User Simulators

    Cara Su-Yi Leong, Nicholas Tomlin, Tal Linzen · arXiv:2610.24232

    AI summaryUser simulators are evaluated for behavioral parity with humans by testing memory constraints, repetition, and interference effects. While some simulators match overall human accuracy and replicate repetition/interference magnitudes, they differ on specific errors, revealing distinct forgetting patterns.

  36. Preserving Reasoning Diversity in Reinforcement Learning with Verifiable Rewards via Adaptive Replay

    Wen-Zhi Li, Sainyam Galhotra, Claire Cardie · arXiv:2610.24236

    AI summaryThe paper analyzes how limited on‑policy rollouts in RLVR suppress semantically distinct reasoning modes and introduces TAR, a Targeted Adaptive Replay that stores diverse base-model solutions and replays them only when their usage drops, improving both performance and diversity.

  37. Encoder-Free Multimodal LLMs Learn Implicit Encoders

    David Harwath, Desh Raj, Xavier Velez et al. · arXiv:2610.24239

    AI summaryEncoder‑free multimodal LLMs (Gemma‑4 12B, Inkling‑Small) learn “implicit encoders” in their early layers that transform audio and visual inputs into representations largely independent of cross‑modal context. Layer probing shows these implicit encoders match the behavior of standard dedicated encoders, and early‑modality encoding alone matches joint‑encoding accuracy.

  38. Probing Ambiguity: Adversarial Intent Resolution for Robust Text-to-SQL

    Youbing Yin, Xujun Peng, Muhammad S. Uddin et al. · arXiv:2610.24248

    AI summaryAIR probes ambiguous text‑to‑SQL queries by generating multiple SQL interpretations, executing them, and asking data‑driven clarification questions; it outperforms prior methods on AMBROSIA and AmbiQT, achieving higher F1 with only ~7% loss without full database access.

  39. Can This LLM Annotate My Data? Estimating Zero-Shot LLM Performance

    Tong Lin, Grant Schoenebeck, Sabina Tomkins · arXiv:2610.24250

    AI summaryThe paper constructs 461 synthetic text classification datasets and shows that zero‑shot LLM accuracy can be predicted from dataset features; internal log‑probabilities outperform confidence verbalizations for predicting performance.

  40. SLA-LENS: From Classroom Transcripts to CSLA-Informed and Evidence-Linked L2 Interaction Analytics

    Nemika Tyagi, Olga Kellert, Phanos Kareen et al. · arXiv:2610.24259

    AI summarySLA‑LENS automatically annotates classroom transcripts with SLA‑based tags for learner errors, pedagogical functions, and uptake, using LLMs and QLoRA adaptation. It produces reproducible, evidence‑linked analytics on 21k+ Spanish L2 interactions, aiding research and curriculum design.

  41. Best of Both Worlds: Fine-Tuned Small Models Complement LLMs for Cost and Performance Benefits

    Shivam Mathur, Sri Harish Popuri, Priya Krishnan Sundararajan et al. · arXiv:2610.24260

    AI summaryFine‑tuned RoBERTa outperforms GPT‑3.5 for 16‑class survey classification (F1 96% vs 83%) and is 10× faster. An ensemble of RoBERTa and GPT‑3.5 reaches F1 97.5% at only 4.4% of GPT‑3.5’s inference cost.

  42. Desirability Confirmation: Relational Sycophancy in AI Intimate Roleplay

    Huiqian Lai, Runze Ding · arXiv:2610.24265

    Research on LLM sycophancy has largely focused on propositional agreement, in which models echo users' beliefs, preferences, or judgments. Adult intimate roleplay presents a different case because what the user seeks may be preservation of a preferred relational position within…

  43. Modeling bilingual naming performance through laterally-connected SOMs

    Divya Prabhakaran, Uli Grasemann, Erie Shivers et al. · arXiv:2610.24275

    AI summaryBiLex, a laterally‑connected self‑organizing map model of bilingual lexical access, reproduces Spanish‑English naming accuracy, response times, and semantic‑based error patterns from the Boston Naming Test, showing it captures individual semantic‑cognition dynamics.

  44. BanglaShield: A Script-Robust Safety Classifier and Benchmark for Bangla Native, Romanized, and Code-Mixed Prompts

    Mohsinul Kabir, Md. Tariquzzaman, Mohammad Rashidujjaman Rifat et al. · arXiv:2610.24288

    AI summaryBanglaShield provides a graded safety classifier for Bangla prompts in native, romanized, and code‑mixed forms, achieving 87.8 % macro‑F1 on native script and 84.4 % on romanized, outpacing large LLMs by over 40 points while using ~130× fewer parameters.

  45. Beyond Clean Accuracy: The Practical Challenges and Benefits of Pixel-Based Language Models

    Haowen Tang, Wei Xia, Raoyuan Zhao et al. · arXiv:2610.24290

    AI summaryPixel-based language models learn from rendered text, improving robustness to typographical noise and cross‑lingual transfer. However, they need longer fine‑tuning, more labeled data, and careful learning‑rate scheduling, making adaptation less reliable than token‑based models.

  46. Not Every User Says It All: Training Tool-Using Agents Beyond Ideal Simulated Users

    Han Bao, Zheyuan Zhang, Kaiwen Shi et al. · arXiv:2610.24294

    AI summaryTraining with weak, masked users hurts performance; existing policies trained on strong users do not improve for weak users. StaGPO, a state‑grouped policy optimizer, lets agents document missing info and assign step‑level credit, boosting weak‑user success by 4.8 points on ToolWOZ and improving generalization.

  47. The Judge Can Debias Itself: Awareness and Self-Debiasing for Reliable LLM-as-a-Judge

    Youbing Yin, Jingyu Wu, Anoop Kumar et al. · arXiv:2610.24320

    AI summaryThis paper introduces prompt-based strategies where large language models explicitly recognize and critique their own systematic biases during evaluation. These lightweight methods consistently improve evaluation reliability across diverse bias types without requiring external training.

  48. What Matters for NVFP4 Training? A Comparative Study of Low-Precision Pretraining Recipes

    Anjulie Agrusa, Andrei Panferov, Elizabeth Wei et al. · arXiv:2610.24343

    AI summaryNVFP4 training of 8B and 30B MoE language models to 1T tokens is studied, showing a recipe that combines unbiased gradient estimation, selective high‑precision layers, and partial tensor de‑biasing. The final method achieves the smallest loss gap to BF16 at this scale.

  49. FlashMap: Flow Map Speculative Decoding

    Jeff Shen, Zhejian Zhou, Ryan Lee et al. · arXiv:2610.24365

    AI summaryFlashMap uses a flow‑based drafter conditioned on target hidden states to generate token blocks in one pass while modeling inter‑token dependencies. It outperforms DFlash on Qwen3‑8B, achieving 7% higher average speedup and up to 6.1× lossless acceleration.

  50. Defending Against Dormant Poisoning Attacks Across Language and Multimodal Agents

    Wonjun Lee, Vaidehi Patil, Zaid Khan et al. · arXiv:2610.24379

    Recent work shows that attackers can implant dormant malicious behaviors that remain hidden at release but emerge after benign fine-tuning. As foundation models are used as agents, whether dormant poisoning extends to harmful agent actions and multimodal settings remains…

  51. Long Listening Thoughts: Eliciting Open Auditory Reasoning with Deliberative Perception and Cognitive Refinement

    Jaeyeon Kim, Chao-Han Huck Yang, Luoyi Zhang et al. · arXiv:2610.24409

    We introduce Long Listening Thoughts (LLT), a framework for constructing post-training datasets that improves audio reasoning by pairing deliberate perceptual grounding with explicit cognitive behaviors. On audio understanding and reasoning benchmarks, large audio-language…

  52. Ask Less, Ask Better: Allocating User Attention in Proactive LLM Agents with Interruption Budgets

    Xuanming Zhang, Amir H. Rezaeian, Miguel Ballesteros et al. · arXiv:2610.24411

    AI summaryThis paper introduces a user‑attention cost metric that penalizes difficult or unnecessary clarifying questions, and shows that limiting proactive LLM agents to a small interruption budget (1–3 questions) cuts cost by 36‑73% while retaining 86‑94% of task reward.

  53. Toward a Universal Local Speech Feature Extractor Through Distillation

    Jessica Yang, Marcelo Beramendi Caballero, Ju-Chieh Chou et al. · arXiv:2610.24424

    AI summaryA two‑layer universal feature extractor is distilled from large SSL teachers; it matches teacher performance on SUPERB tasks while using only 3% of the CNN MACs, reducing overall inference time by over 20%.

  54. When Opposite Premises Translate Identically: A Source-Conditioned Diagnostic for Multilingual Commonsense Items

    Shuai Wang, Rui Hu · arXiv:2610.24428

    AI summaryThe paper introduces a source‑conditioned diagnostic that flips the polarity of English premises, translates both sides, and counts identical target outputs to detect unfaithful translations in multilingual commonsense QA. The method finds dozens of collisions in Swahili and LaBSE, proving translation errors but not pinpointing the faulty arm.

  55. Which Long Documents Matter? A Controlled Study of Data Selection for Context Extension

    Junlong Jia, Jiang Zhou, Xing Wu et al. · arXiv:2610.24469

    Natural long documents are widely used for context extension, but which selection pipelines are effective remains unclear. We conduct a controlled comparison on Qwen2.5-3B at 128K under matched 6B-token continued-training budgets. Random sampling of natural long documents…

  56. Pluralistic Alignment in Language Models: Objectives, Human References, and Preference Representations

    Meng-Chen Wu, Umesh Bodhwani · arXiv:2610.24471

    AI summaryThe paper proposes a two‑layer taxonomy for pluralistic alignment—categorizing objectives (Overton, Steerable, Distributional) and human references (aggregate, regional, subgroup)—and reviews 70 studies, showing most work focuses on Steerable and Distributional pluralism with limited evidence for true preference variation.

  57. Ben-Misandry: A Bengali Dataset and Late-Fusion Transformer Framework for Detecting Anti-Male Gender Hate

    Md Mehedi Hasan Nipu, Chinmoy Mitra, Tarannum Ahmed Nowshin et al. · arXiv:2610.24474

    AI summaryThis paper introduces Ben-Misandry, the first Bengali misandry detection dataset, containing 5,000 synthetic comments across six taxonomy classes. A late-fusion transformer ensemble combining BanglaBERT and XLM-RoBERTa achieves 96.6% accuracy on the benchmark.

  58. Beyond Recall Saturation: Scaling Hard-Negative Reranker Training for Industrial Legal Retrieval

    Yunhan Li, Mingjie Xie, Zeyang Shi et al. · arXiv:2610.24478

    AI summaryThe paper shows that after a large candidate pool, improving reranker quality yields the biggest gains. An embedding‑to‑self‑mined hard‑negative training pipeline scales to 4B parameters and outperforms the baseline on legal benchmarks, preferred in 72.4% of industrial queries.

  59. Write Once, Check Many: Reusable Ledgers for Post-Hoc Policy Compliance Auditing of Agent Trajectories

    Ashwin Nagarajan, Gursimran Panesar, Alicia Yang et al. · arXiv:2610.24483

    AI summaryThe paper introduces a write‑once, check‑many ledger system that records agent trajectories in a policy‑independent format, enabling efficient post‑hoc compliance checks. Experiments show ledger readers outperform trajectory readers, achieving higher AUC with far fewer tokens.

  60. Modeling Discourse Profiles in Climate Misinformation Discourse

    Ge Gao, Zhengyang Shan, Bryan A. Plummer et al. · arXiv:2610.24489

    AI summaryThis paper builds discourse profiles by clustering TikTok climate comments into recurring rhetorical patterns and uses them in late‑fusion classifiers, boosting macro‑F1 over text‑only baselines for several representations. It also shows that discourse profiles influence misinformation reception and spread.

  61. Vocal-Tract Acoustics, Aerodynamics, and Overlap-and-Add Synthesis in DYNARTmo

    Bernd J. Kröger · arXiv:2610.24490

    This paper presents the acoustic and aerodynamic extension of DYNARTmo, a dynamic articulatory model for visualizing and synthesizing speech production. Gestural control trajectories determine vocal-tract geometry, which is converted into an acoustic tube with nasal branching…

  62. Backend-Frontend Converter: Component-Based Conversion of .NET Computational Models to TypeScript

    Petr Ivankov (Independent researcher), Max Shestov (Georgia Institute of Technology) · arXiv:2610.24492

    AI summaryThis paper introduces an architecture that converts component-based .NET computational models into TypeScript for browser execution. The evaluation demonstrates that the generated TypeScript implementations achieve near-identical numerical precision compared to the original C models across orbital and trading scenarios.

  63. ProbePO: Sparse Probes, Redistributed Credit for Critic-Free LLM Reinforcement Learning

    Diyi Hu, Ruizhong Qiu, Lin Qiu et al. · arXiv:2610.24515

    Reinforcement learning from verifiable rewards assigns one terminal reward to an entire reasoning trajectory, obscuring how individual reasoning steps contributed to the outcome. GRPO broadcasts a group-normalized advantage to every response token, while finer-grained approaches…

  64. Axiomatic World Modeling for Physics Reasoning

    Xinye Yang, Zhenyang Liu, Yuxuan Wang et al. · arXiv:2610.24519

    AI summaryRLAWM trains LLMs to penalize differences between their internal axiomatic world model and the true physics, using two hierarchical rewards for modeling and solving. The method boosts PhysReason by 12.2 points and PHYSICS by 5.2, with strong zero‑shot generalization.

  65. EGIP: An Evidence-Grounded Interaction Protocol for Clinical Agents

    Zecheng Ren, Ruichen Cong, Yi Min Chen et al. · arXiv:2610.24539

    Interactive clinical agents acquire evidence through patient dialogue and diagnostic examinations, yet their performance also depends on how the interaction environment exposes information, available actions, and examination results. When these conditions are implicit or…

  66. From Stories to Features: Scaling Concept Vectors for AI Alignment & Interpretability

    Dmitry Scherbakov, Oleg Chernikov, Victoria Khamash et al. · arXiv:2610.24556

    AI summaryThe authors propose generating feature vectors for language model safety and alignment by taking the mean activation difference between synthetic concept-antagonist story pairs. Scaling this approach to 1,036 concepts across multiple models, they show these vectors generalize to detect concepts, reveal shared geometric properties, and causally steer model behavior.

  67. ASR Personalization in Pathological Voice: Accuracy, Efficiency, and Duration Effects

    Giuseppe Giaimis, Sergei Katkov, Muhammad Azfar Yaqub et al. · arXiv:2610.24572

    Automatic Speech recognition (ASR) struggles with Pathological speech due to persistent speaker-specific mismatch. In clinical and accessibility scenarios, only limited target-speaker data is typically available, making full model retraining impractical. We present a…

  68. Training with Ciphers to Enhance In-Context Terminology Learning For Translation from Rare Languages

    Deevyanshu Malu, Deeptanshu Malu, Sunita Sarawagi · arXiv:2610.24593

    AI summaryThis paper introduces RareCipherFT, a fine-tuning method that replaces rare translation terms with ciphers during training to force LLMs to copy from context. The approach improves in-context terminology translation by 5 to 15 points across multiple rare language pairs without degrading overall translation quality.

  69. Safety Kernel: Mechanistic Alignment for Cross-Lingual Defense in LLMs

    Chengyu Xie, Fei Shen, Shuyi Miao et al. · arXiv:2610.24614

    The safety capabilities of large language models (LLMs) are highly uneven across different languages, often allowing cross-lingual attacks to bypass safety guardrails. Existing alignment methods predominantly rely on external alignment signals and provide limited insight into…

  70. Muse Glimmer 30B: An On-Device Agentic Model

    Arash Ebrahim Abtahizadeh, Muna Aghamelu, Adil Ahmed et al. · arXiv:2610.24628

    We introduce Muse Glimmer, an open-source 30B parameter causal language model with perception encoder, purpose-built for autonomous agentic tasks on consumer hardware. Muse Glimmer integrates multi-step reasoning, reliable tool use and failure recovery into a single model that…

  71. What RL Brings to Reasoning: A Few Decisions the Base Model Would Not Make

    Siyu Zhang, Yuquan Lu, Yoshua Y. Li et al. · arXiv:2610.24663

    AI summaryThe authors investigate what reinforcement learning adds to reasoning base models by swapping tokens between them during generation. They find that borrowing the RL model's choices at just four percent of token positions recovers over ninety percent of its reasoning performance gains.

  72. Do Conversational Agents Need Explicit Memory? A Controlled Comparison with Raw-History Retrieval

    Yongjie Zhou, Shuai Wang, Bevan Koopman et al. · arXiv:2610.24671

    Explicit memory systems transform conversation history into persistent representations intended to improve future access, often at substantial construction cost. Yet it remains unclear whether this added complexity yields better answer accuracy than retrieving directly from raw…

  73. Verifying Human-Written Reasoning References

    Ali Ansari, Farhana Ferdousi Liza · arXiv:2610.24690

    AI summaryThe paper introduces a method to verify each step of human‑written reasoning chains by checking entailment against cited premises, re‑checking against full premises, and attributing failures. On P‑FOLIO, only 52.3% of 386 derivations passed all checks; most “failures” were due to missing or mismatched premises, with 21 human errors, 11 translation errors, and 7 annotation errors identified.

  74. When Do Repetition Loops Lock? Truncation Sampling, Bounded Penalties, and a Blind Spot in DRY

    Yichuan Chen, Xin Wang · arXiv:2610.24715

    Language models sometimes repeat verbatim until the generation limit. We study the exit rather than the entrance: given that a span has already been repeated $n$ times, when is escape still possible? Along the loop the context is deterministic, so loop survival under any sampler…

  75. DiffuPlan: Editable Planning State for Diffusion Language Model Agents

    Qisheng Zhou, Zhen Xiong, Qiaoyu Tan · arXiv:2610.24717

    Diffusion language models (dLLMs) are emerging as an alternative to autoregressive (AR) language models, yet dLLM agents largely inherit an interaction protocol designed for AR generation: once intermediate state is written, later observations can only be incorporated by…

  76. Neuro-Inspired Inhibitory Message Passing for Accurate and Token-Efficient Multi-Agent Reasoning

    Nima H. Siboni, Magdalena Springer, Vahid Rostami · arXiv:2610.24718

    AI summaryInhibitory message passing routes each evidence sentence only to agents that lack it, suppressing redundant information without training. Across seven models and multiple multi‑agent architectures, the method boosts accuracy by 39–77 points and reduces tokens per run by 10–46 %.

  77. PV-Decoding: Progressive Verification Decoding with Decode Gating for Diffusion Language Models

    Renxi Liu, Yiming Li, Shengyin Sun et al. · arXiv:2610.24722

    AI summaryThis paper introduces PV-Decoding, a speculative decoding framework for diffusion language models that uses confidence-driven partitioning and progressive verification. It reduces sequential forward passes by up to 37% while largely preserving generation accuracy.

  78. GLOSS-MT: Controllable Low-Resource Machine Translation with an Editable Dictionary

    Mich-Seth Owusu, Stephen E. Moore, Akwasi Asare et al. · arXiv:2610.24730

    AI summaryGLOSS-MT injects an editable offline dictionary into pretrained machine translation models via a single round of fine-tuning on mixed-language inputs. This approach improves translation quality on low-resource English-to-Asante Twi benchmarks by up to 5.48 chrF2 while enabling precise, retraining-free terminology control.

  79. BanglaBBQ: A Bias Benchmark for Question Answering in the Bangladeshi Context

    Sumit Anthony Gomes, Yasin Rahman, Taeeba Tasnia et al. · arXiv:2610.24764

    AI summaryBanglaBBQ adapts the BBQ bias benchmark to the Bangladeshi context, adding 140 templates and 372 new stereotypes in Bangla and English. Models tested (Qwen3‑4B/8B, GPT‑4.1‑mini, Gemini 2.5 Flash) all show bias toward stereotyped groups, with closed models following counter‑stereotypes only on new templates.

  80. ECHO: Efficient Causal Self-Recursion Beyond Auxiliary Multi-Token Prediction

    Yuxuan Zhou, Junyuan Shang, Tianyu Wang et al. · arXiv:2610.24766

    AI summaryECHO replaces auxiliary multi-token predictors with a single backbone that predicts all horizons via self-recursion. Dynamic Depth Sampling trains deeper horizons efficiently, improving downstream accuracy and open-ended generation at roughly half the cost of traditional MTP methods.

  81. Information Theory of Random Composition Trees

    Doron Sivan, Weishun Zhong, Tankut Can et al. · arXiv:2610.24788

    Random composition trees model the hierarchical semantic structures of meaningful texts as a statistical ensemble generated by recursively splitting texts into coherent chunks. A recent study shows that different text types can be described by random composition trees with…

  82. Who Gets Unmasked? Sampler-Induced Bias in Diffusion Language Models

    Xujun Che, Farsheed Haque, Depeng Xu et al. · arXiv:2610.24795

    AI summaryDiffusion language models exhibit a sampler-induced bias where confidence-based token commitment rules amplify stereotypes and distort distributions. The authors propose Fork-First Sampling to resolve this bias by deciding critical choices before text generation.

  83. Table Serialization Determines Which Relations Language Models Preserve

    Junwei Ma, Arun Kumar Chithanar, Palash Goyal et al. · arXiv:2610.24798

    AI summaryExamines how row‑major vs column‑major text serialization of tables affects instruction‑tuned models’ lookup accuracy. Finds that serialization format, not table shape alone, determines which column–row relation is preserved, with row‑major favoring rows and column‑major favoring columns.

  84. Medical Fine-Tuning Reshapes, Not Reduces, Patient-Facing AI Risk: A Rubric-Based, LLM-Judge Evaluation Framework

    Savan Doshi · arXiv:2610.24807

    AI summaryThe paper proposes a risk‑aware evaluation rubric scoring medical LLM answers for six harmful language categories, using a three‑judge LLM ensemble. It finds medical fine‑tuning does not lower overall risk but reshapes it, reducing high‑alert mentions while increasing overconfident statements.

  85. Ask, Don't Guess: Targeted Clarification for Speech Recognition Errors

    Sankalp Parashar, Preethi Jyothi, Sunita Sarawagi · arXiv:2610.24809

    AI summaryThe paper introduces a framework to identify speech recognition errors in real time and prompt users to repeat only the affected spans. This targeted repetition improves word error rates by up to 24 percent while minimizing unnecessary interruptions.

  86. Efficiency Measured in English: Tokeniser Coverage Bounds Small Language Models on Indic Scripts

    Anna Pramod · arXiv:2610.24818

    Small Language Models with quantisation and parameter-efficient adaptation are widely offered as the route to multilingual AI under compute constraints, and their efficiency is almost always reported as a single memory figure. We show that this figure is measured in English and…

  87. MisleadQA: Diagnosing LLM Failures under Misleading Context

    Hui Wang, Bohao Chu, Qianli Wang et al. · arXiv:2610.24851

    Large language models (LLMs) are widely used to answer questions from retrieved or user-provided context. However, provided context can be factually true yet out-of-scope, describing a different entity, time, or location from the one the question targets, and still lead models…

  88. Learning to Program Retrievals: Composing Search Primitives via Reinforcement Learning

    Kyuyoung Kim, Zilin Xiao, Zhiyuan Wang et al. · arXiv:2610.24854

    AI summaryRetrieval Program Learning lets a policy compose search primitives into programs with state and control flow, and program mutation generates local variants for better exploration. On QA and corpus reasoning, it outperforms larger baselines, especially on multi‑hop tasks, while reducing context and retrieval steps.

  89. Dual Task Vector Merging: Leveraging Emotion and ASR Knowledge for Low-Resource Alzheimer's Disease Detection

    Yuan-Chao Li, Yin-Long Liu, Liu He et al. · arXiv:2610.24870

    Alzheimer's Disease (AD) detection from speech benefits from both paralinguistic and linguistic cues, yet model training is frequently constrained by limited data. Fine-tuning a large pretrained speech encoder can easily overfit, while a frozen probe leaves the encoder's…

  90. Bellman Language Models: Solving the Recurring Decisions of LLM Agents

    Adarsh Vatsa, William Eiers · arXiv:2610.24871

    AI summaryBellman Language Models (BLMs) discretize an LLM agent’s conversation into states, estimate transition probabilities and costs, solve the resulting MDP once, and reuse the optimal policy, reducing model calls by up to 98% and raising task success from 29% to 96% on telecom benchmarks.

  91. The Missing Compliance Class: LLM Graders That Collapse Jailbreak Success, and a Free Check

    Ruqiya Bin Safi · arXiv:2610.24872

    Jailbreak papers report an attack success rate, the share of responses that deliver the harmful request, and read it as a property of the target model. We hold the target model, the prompts and the responses fixed and change only the grader. Three dense graders of 8B and 9B…

  92. The One-Pixel of Reasoning: One Truthful Relation Is Enough to Mislead LLM Agents

    Jinwei Hu, Youcheng Sun, Yi Dong et al. · arXiv:2610.24873

    AI summaryThe paper introduces the one-relation attack (ORA), which flips LLM beliefs by inserting a single, source‑grounded sentence targeting an implicit inferential warrant. ORA succeeds on 54.9% of proprietary and 80% of open‑weight biomedical models, transfers without feedback, and evades detection.

  93. Measuring Data Diversity with Embeddings: A Taxonomy and Benchmark for Diversity Measures

    Cantao Su, Anna Wegmann, Esther Ploeger et al. · arXiv:2610.24888

    Diversity is a critical property of text corpora, with direct implications for training data curation, test set design, and model generalization. However, its measurement remains fragmented and poorly understood. Existing embedding-based diversity measures vary widely in how…

  94. LastWords: Boring Problems Revisited

    Huayang Li, Richard Sproat · arXiv:2610.24894

    AI summaryThe paper shows that modern frontier models (e.g., GPT‑4) have practically solved the number name reading subproblem of text normalization, but it argues that smaller, resource‑efficient methods could still address remaining edge cases without requiring massive models.

  95. Peer Pressure: Execution-Verified Co-Evolution of Attacker and Defender Populations for Code Security

    Khushbu Pahwa, Yubin Ge, Daniele Bonadiman et al. · arXiv:2610.24896

    LLM code agents increasingly ship code with little oversight, yet defenders trained on static vulnerability datasets fall behind adapting adversaries. We co-train attacker and defender instead, and let execution decide every reward: an attacker (Red) edits a real repository and…

  96. HybridResearcher: Bridging the Structured-Unstructured Boundary for Deep Research Agents

    Soyoung Yoon, Peiran Xu, Han Wang et al. · arXiv:2610.24899

    AI summaryHybridResearcher is a 4B parameter agent trained via synthesized trajectories and reinforcement learning to reason across structured databases and unstructured web sources. It outperforms much larger models on hybrid research benchmarks without sacrificing single-source performance.

  97. Compositional Activation Steering Across Languages and Behaviors with Contextual Gates

    Daniil Gurgurov, Akansh Maurya, Josef van Genabith et al. · arXiv:2610.24906

    AI summaryContextual gates learn to adjust fixed steering vectors per hidden state, enabling simultaneous control of multiple behaviours in multilingual language models. The method outperforms constant-strength steering and prompting while preserving knowledge and keeping internal computation closer to the prompted model.

  98. A Cross-Domain Evaluation of Prompting Techniques for Large Language Models

    Kevin Krazius, Tim Schlippe, Paul Libbrecht · arXiv:2610.24913

    AI summaryThe study benchmarks Zero-Shot, Few-Shot, Retrieval-Augmented Generation, and automatic prompt optimization across six reasoning tasks using a single LLM. RAG tops the overall average (78.33 %) but no method outperforms all others; selection should depend on task characteristics.

  99. Arctic-SWE: Revisiting the Long Horizon Agent Training by Modeling-System Co-Design

    Boyi Liu, Yite Wang, Xinyu Lian et al. · arXiv:2610.24914

    AI summaryArctic-SWE introduces an asynchronous reinforcement learning framework for long-horizon software engineering agents through model-system co-design. Using optimized infrastructure and curated data, it enables a 4B model to achieve 65.0% on SWE-bench Verified.

  100. How Well Can LLMs Verbalize Mathematical Formulas? A Multi-Domain Evaluation

    Peter Volbach, Tim Schlippe · arXiv:2610.24917

    AI summaryLarge‑language models can generate reasonably accurate verbalizations of LaTeX formulas, with GPT‑5.2 scoring highest on simple transcriptions (≈76 % BLEU) and Claude Sonnet 4.5 excelling on extended transcriptions (≈36 % BLEU). Accuracy drops for longer, more complex formulas and depends on context and domain.

  101. CARTA: Self-Supervised Reusable Transaction Embeddings via Heterogeneous Tokenization and Cross-Attention

    Shreyas K. Chandrahas, Jose Munoz, Satish Babu Bellapu · arXiv:2610.24920

    AI summaryCARTA learns a 16‑dim, label‑free embedding of payment transactions using heterogeneous tokenization and InfoNCE. The frozen embedding boosts fraud detection, outperforming raw features at 1% labels and beating frequency encoding on large tabular data, while remaining reusable for downstream tasks.

  102. Stable Signer V3: 4D Deformable Primitive Splatting Is All You Need for Sign Language Production

    Sen Fang, Liwei Che, Dimitris N. Metaxas · arXiv:2610.24926

    AI summaryStable Signer V3 uses 4D Deformable Primitive Splatting with face, body, and tunneling super‑resolution modules optimized once per signer, reducing facial error 71.4 %, body error 35.1 %, and RGB error 24.2 % while enabling interactive high‑resolution sign language avatars.

  103. What Can't Jev Decide? Probing the Limits of One-Pass Decision Models

    Wang Yang, Xinpeng Li, Yanyan Zhang et al. · arXiv:2610.24929

    AI summaryJev makes one-pass decisions efficiently but cannot match LLMs that write intermediate steps; its accuracy drops when multiple updates are needed and it fails to detect errors from stale state. It succeeds on 97.5% of one-pass solvable items but only 74% of more complex ones.

  104. Epi: Towards a Persistent, Self-Improving Agent for Autonomous Research

    Yue Huang, Zhangchen Xu, Xiaonan Luo et al. · arXiv:2610.24944

    AI summaryÉpi is a self‑improving research agent that persists across model sessions, learns from experiments, and produces 120 record‑setting results—including an 84‑fold tighter $n$‑queens bound and a 3.6‑million‑fold Feigenbaum interval—while also proving new combinatorial conjectures. Its lightweight Épi‑turbo variant outperforms Codex on 30 routing/scheduling benchmarks with only 64 % model cost.

  105. Over-Defense in Coding Agents Begins at Silent Forks

    Hanjun Luo, Xuecheng Liu, Xiucheng Zhang et al. · arXiv:2610.24949

    AI summaryCoded language models over‑defend by taking unnecessary protective actions at silent forks—points where any action yields the same outcome. ForkDPO uses these forks as a learning signal to reduce such disproportionate behavior, cutting it from 70.3% to 58.9% on a 4B model.

  106. CasePlay: Self-Play Reinforcement Learning from Case Reports for Medical Reasoning

    Hao Wang, Zihan Wang, Kai Wu et al. · arXiv:2610.24952

    AI summaryCasePlay uses document-grounded self‑play on medical case reports, generating questions from knowledge points and evaluating answers with rubric‑based quality feedback. It improves LLM medical reasoning by 3.1 overall points (6.3 on LiveClin) over prior self‑play baselines.

  107. Revealing what benchmark scores hide: Jointly measuring the breadth and reliability of LLM capabilities using accessibility profiles

    Kazem Faghih, Yize Cheng, Shoumik Saha et al. · arXiv:2610.24957

    AI summaryThe paper defines “accessibility” as the probability a model succeeds across equivalent formulations of a question. It shows that many model pairs have similar average accuracy but diverge on Access@5 vs. Reliable@5, revealing a tradeoff between breadth and consistency of performance.

  108. CoworkEnv: Synthesizing Training Environments for Long-Horizon Cowork Agents

    Zhongwei Xie, Yiming Du, Jiaxin Bai et al. · arXiv:2610.24960

    AI summaryCoworkEnv synthesizes training environments guided by workflow constraints, generating requests, tools, and validation checks for AI coworkers. Training with these environments raises Qwen3‑VL‑8B‑Instruct SFT scores from 46.6 to 64.1 on Claw‑Eval, especially improving multi‑turn performance.

  109. DeGMatch: Target-Aware Reasoning Data Selection via Deconfounded Gradient Matching

    Changho Lee, Janghoon Han, Rajdeep Mukherjee et al. · arXiv:2610.24963

    AI summaryDeGMatch selects reasoning data by deconfounding candidate gradients: it gates for target relevance, centers gradients on the population mean, and removes dominant principal components before matching. This improves target discrimination and outperforms baseline methods across math, science, and code tasks.

  110. Rubrics Carry the Standard: Shapley Attribution for Checklist-Based LLM Judges

    Saeid Asgari, Rui Ying, Sara Malvar et al. · arXiv:2610.24971

    AI summaryChecklist rubrics dominate LLM judging, but changing the rubric content can change pass rates from 2% to 100% while altering the judge model has little effect. The paper introduces a Shapley-based attribution that detects rubric drift from self-review and proposes a change-control gate to maintain quality.

  111. A Measurement Perspective on Benchmarking LLM-Generated Text Detectors using Item Response Theory

    Yanbin Zhao, Zhipeng Chen, Guangsheng Bao et al. · arXiv:2610.24972

    AI summaryThe paper introduces an item-response-theory framework that models benchmark texts as items and detectors as respondents, estimating text difficulty/discrimination and detector ability across multiple dimensions. Using this, they find domain and length drive benchmark heterogeneity, and a 2,088‑text subset preserves full‑benchmark detector rankings.

  112. The World as Viewed by 136 Countries: An Open, Curated, Annotated, and Multilingual Dataset of 118 Million State Media Articles

    Bryan Li, Samar Haider, Grace Kim et al. · arXiv:2610.24990

    AI summaryWorldStateMedia compiles 118 million state‑controlled news articles from 136 countries, annotating outlet control levels. It shows a surge of state media in training corpora and demonstrates that retrieving such sources biases language models toward the originating country’s narratives.

  113. Certified Sparse Attention via Perturbed Retrieval

    Runguo Li · arXiv:2610.24991

    AI summaryAdds independent Exp(1) perturbations to KV scores, turning sparse key retrieval into probabilistic sampling that gives a Horvitz–Thompson estimate and simultaneous confidence bounds. The method reads only \(O(\varepsilon^{-2}\log(1/\delta))\) keys, achieves 4–8× lower 90th‑percentile error than baselines, and matches dense attention on benchmarks while speeding up decoding.

  114. When Does Better Acceptance Pay? A Controlled Study of Speculative Decoding

    Yongchao Long, Chunrui Zheng, Yuxuan Zhou et al. · arXiv:2610.24993

    AI summaryThis paper evaluates speculative decoding trade-offs under controlled training and inference conditions. The authors find that performance gaps between drafters shrink, and low-cost drafting improvements often outperform expensive ones depending on task uncertainty and serving conditions.

  115. SoK: PIAtlas: Decomposing the Unbounded Prompt Injection Attack Space

    Stavros Damianakis, Konstantinos Psounis · arXiv:2610.24999

    Prompt injection is the dominant security risk for large-language-model (LLM) applications and agents, yet the field still lacks a coherent map of how these attacks are constructed. More than twenty public datasets describe prompt injection using incompatible vocabularies, often…

  116. One Head Away from Language Confusion: Single Attention Heads Across Model Families

    Jiwon Jeong, Anjelo Jann Laroza, Chaewoon Yoon et al. · arXiv:2610.25026

    Large language models sometimes reply in an unexpected language, a failure known as language confusion. We ablate individual attention heads in 12 model checkpoints spanning seven model series, using FLORES-200 continuations in five languages and Language Confusion Benchmark…

  117. Beyond the Teacher: Understanding and Preserving Distillation Overshoot in Agentic On-Policy Distillation

    Jike Zhong, Ming Li, Yuxiang Lai et al. · arXiv:2610.25034

    AI summaryThis paper identifies distillation overshoot, where student agents temporarily outperform their teacher before regressing. To prevent this, the proposed method masks conflicting teacher supervision on successful student actions, improving final performance by up to 15 percentage points.

  118. Policy Is Not Capability: Some Safety Benchmarks Measure Which Definition of "Unsafe" You Trained On

    Vahid Jebraeeli, Jonathon Romero, Yijin Wang et al. · arXiv:2610.25060

    AI summaryThe paper shows that safety benchmark scores largely depend on the labeling policy used, not model capability. It demonstrates that minor changes in policy or a few parameters can shift scores across the full range, calling for explicit reporting of contamination and policy definitions.

  119. P2N: Reusing Deep Representations for Greater Effective Depth

    Yiqin Hao, Boyi Zeng, Zitong Wang et al. · arXiv:2610.25076

    AI summaryP2N reuses the deep representation of the previous token to extend effective depth during generation with only a vector addition per step. At 1.5B, it boosts GSM8K accuracy by ~10 points in zero‑shot/few‑shot settings without added latency.

  120. CoEvo-RSI: When Harnesses Evolve, Which Models Should Follow?

    Jiaqi Su, Guibin Zhang, Jie-Jing Shao et al. · arXiv:2610.25078

    AI summaryCoEvo‑RSI uses a meta‑agent to inherit both harness designs and model checkpoints from a shared archive, aligning evolving execution scaffolds with learned behaviors to mitigate brain–body mismatch. This approach lets Qwen3.5‑9B, trained only with supervised fine‑tuning, outperform larger models on multi‑agent attribution, role‑aware text‑to‑SQL, and smart‑home tasks.

  121. Dual-Slot: From Serial Loops to Parallel Slots in Language Models

    Yiqin Hao, Zitong Wang, Boyi Zeng et al. · arXiv:2610.25086

    AI summaryDual‑Slot reorganizes looped language model computation into parallel latent and prediction slots, reducing autoregressive latency by replacing two sequential layers with one paired invocation. It improves 1B dense Pile perplexity from 7.25 to 7.00, boosts downstream accuracy, and preserves ~95 % decoding throughput.

  122. Beyond Factual Accuracy: A Benchmark for Evaluating Perspective Alignment in LLMs

    Sunghoon Kim, Sangyeop Kim · arXiv:2610.25087

    AI summaryThis paper introduces PerspectiveBench, a benchmark that measures whether LLMs adhere to a requested perspective rather than just being factually correct. The new Perspective Alignment Score shows that current models keep target content but still mix in unrequested viewpoints, even with RAG.

  123. Deep Fusion Memory: A Chunk-Level Parametric Memory for Large Language Models

    Rubin Wei, Siyuan Sun, Hao Sun et al. · arXiv:2610.25100

    AI summaryDeep Fusion Memory (DFM) trains a parametric memory predictor to generate chunk‑level embeddings from context, fusing them into hidden states via gated cross‑attention; this reduces training data needs by 32× and yields up to 12.71% QA gains over baselines.

  124. Generation-Heavy Hybrid Machine Translation

    Nizar Yahya Habash · arXiv:2610.25107

    AI summaryGHMT uses only a source parser and small dictionary, overgenerates target syntactic structures with rich target resources, then statistically selects the best translation. It achieves comparable MT quality while requiring far fewer source–target symmetric resources.

  125. Behave Like Experts: Fusing Data with Semantic Knowledge for Effective and Efficient Semantic Map Construction

    Zhu Liu, Zhen Hu, Yuxuan Liu et al. · arXiv:2610.25122

    AI summaryFuses language model representations with data-driven graph construction to guide candidate selection, achieving more accurate and efficient semantic maps. The method outperforms prior approaches across 10 datasets on both effectiveness and speed.

  126. Memories That Outlive Their Reasons: Dependency-Tethered Memory for Tool-Using LLM Agents

    Yiqi Wang, Jinqian Ju, Jiaqi Zhang et al. · arXiv:2610.25123

    AI summaryDependency‑tethered memory records the exact version each verdict depends on and discards any verdict whose support fails, reducing unsafe publications to 0.3% and verification calls by 37% compared to fact memory.

  127. Trackable Skill Library Lifecycle Management for Agentic Reinforcement Learning

    Xi Zhu, Yuanlin Duan, Changyi Yang et al. · arXiv:2610.25126

    AI summaryTrackRL uses online randomized controlled experiments within group-based policy optimization to isolate individual skill contributions in agentic reinforcement learning. This evidence-driven approach enables the principled lifecycle management of skill libraries, outperforming existing baselines in downstream evaluations.

  128. MemBubble: Benchmarking How Agent Memory Shapes LLM Response Diversity

    Jiajun Tan, Fei Sun, Xinyu Ma et al. · arXiv:2610.25127

    AI summaryMemBubble benchmarks how agent memory affects response diversity using 1,000 real conversation-derived preference instances. Across LLMs and memory designs, entropy drops 34.7 % versus full history, revealing significant diversity loss that user interventions fail to mitigate.

  129. TIRE: Top-Down Formula Instantiation with Reliable Execution for Physics Problem Synthesis

    Xiaoyu Wu, Zhaoxin Yu, Xinglin Xiao et al. · arXiv:2610.25134

    AI summaryTIRE generates physics problems by instantiating reusable formulas and conditions, creating reference solutions before generation for reliable supervision. The resulting TIRE‑19k dataset improves fine‑tuned and RL‑trained LLMs by ~3 pp over comparable datasets.

  130. PLANE: Plug-and-Play Fine-Grained Visual Experts for Hallucination Mitigation in Large Vision-Language Models

    Jianghao Yin, Lang Yu, Qianxi Yu et al. · arXiv:2610.25146

    AI summaryPLANE introduces fine‑grained LoRA visual experts and an instruction‑aware gate to enrich CLIP features, reducing hallucinations in large vision‑language models. On new GPT4‑free GIFT benchmark and existing tests, it cuts hallucinations with negligible latency, outperforming state‑of‑the‑art methods.

  131. Morpheus: a fully local, defense-in-depth de-identification engine for Greek clinical text - a benchmark evaluation

    Filippos-Paschalis Rorris (Onassis Hospital, Athens, Greece et al. · arXiv:2610.25155

    AI summaryMorpheus removes 98.5 % of direct patient identifiers from synthetic Greek clinical notes with under 3 % over‑redaction, while most remaining leaks are institutional. It is the first benchmark for Greek clinical de‑identification, including an independent egress‑guard evaluation.

  132. Do LLMs Reproduce the Age Gap in Loneliness? Evaluating Survey Simulation against European Survey Data

    Yuliya Li, Achim Rettinger, Dominik Beyer · arXiv:2610.25158

    AI summaryThis paper evaluates whether large language models can accurately simulate the age gap in loneliness across European countries using actual survey data. The results show that LLMs frequently fail to reproduce these demographic differences, often reversing the actual age patterns or systematically misestimating group means.

  133. Legal Guidance in the Wild: How Users Seek Legal Help in Real-World LLM Conversations

    Amirreza Mohseni, Gerasimos Spanakis · arXiv:2610.25159

    AI summaryThe paper builds a taxonomy to detect legal guidance requests in real‑world LLM chats, annotates 2,122 WildChat‑1M conversations, and releases a 200‑conversation gold set. It finds 71% of legal content seeks guidance, with rights‑and‑options advice most common.

  134. Indistinguishable Agents: Training Agent Privacy as Twin-World Indistinguishability

    Jiaming He, Guanyu Hou, Yi Yu et al. · arXiv:2610.25161

    AI summaryIndistinguishable Agents trains agents to act the same in twin worlds differing only by a private fact, minimizing a distinguisher’s log-likelihood ratio; this guarantees Bayes-level privacy while preserving task performance on shopping and messaging tasks.

  135. Memory, Know Your PLACE: Governing Lifecycle State and Query-Time Eligibility in Persistent-Memory Agents

    Chen-Fang Hu, Hong-Han Shuai, Woan-Shiuan Chien · arXiv:2610.25179

    AI summaryPLACE adds write‑side state certification and read‑side authorization to persistent memory, improving lifecycle correctness and preventing causal leakage. Evaluation on Mem0 with Qwen2.5 models shows combined governance yields best performance while preserving relevant support.

  136. Dialogue Generation for Conversational Recommendation Using User Search Interactions and Knowledge Graphs

    Minsung Hwang, Donggyu Yoon, Gowoon Hwang et al. · arXiv:2610.25182

    AI summarySearCl automatically generates 3,538 recommendation dialogues from search and click logs, using a probabilistic state machine and LLM agents guided by knowledge graphs. The generated conversations score higher than benchmark dialogues under an LLM-as-a-judge protocol.

  137. Concept Representations in Vector Space: Toward an Interdisciplinary Study of Meaning Variation

    Simon Josef Durstewitz · arXiv:2610.25184

    AI summaryThe paper introduces a framework that uses transformer embeddings of standardized text responses to map individuals’ concept representations into a shared vector space, enabling measurement of inter‑individual variation. In a proof‑of‑concept study, the method quantifies concept sharedness, identifies correlates of variation, and detects subpopulation deviations.

  138. Reranking Answers of Large Language Models with Knowledge Graphs

    Mikhail Salnikov, Hai Le, Olga Tsymboi et al. · arXiv:2610.25185

    AI summaryThe paper extracts subgraphs around entity candidates by computing shortest paths in Wikidata, then uses features from these subgraphs to rerank LLM-generated answers. Experiments show the reranker improves answer accuracy over baseline LLM outputs.

  139. Acharya 2.0: An AI Tutor for Self-Learning Subjects in Hindi

    Shantipriya Parida, Debasish Dhal, Sonal Khosla et al. · arXiv:2610.25192

    AI summaryAcharya 2.0 is a retrieval‑augmented LLM‑powered web tutor for Hindi students, providing on‑demand academic help by combining a Hindi knowledge base with a large language model. It demonstrates that RAG can efficiently adapt LLMs to low‑resource Indian languages.

  140. A Thousand Faces: A Persuasion Benchmark with Experience-Grounded Persuadees Informed by Psychology and Pragmatics

    Ziqing Zhuang, Dingyi Zhang, Deyu Zhou · arXiv:2610.25206

    AI summaryA Thousand Faces creates a persuasion benchmark with 1,000 detailed personas linking personal experiences to beliefs, desires, and revision grounds. Models scored lower than simpler benchmarks but showed higher faithfulness and use of personal reasons.

  141. Calibration-Free Early Stopping for Chain-of-Thought Reasoning via E-processes

    Dong-Jae Lee, Gyojin Han, Junmo Kim · arXiv:2610.25212

    AI summaryCalibration-free early stopping for chain‑of‑thought LLM reasoning uses two e‑processes to sequentially accumulate evidence, guaranteeing a user‑specified false‑alarm rate without calibration. The method matches or outperforms calibration‑based policies across models and datasets.

  142. Hidden Cartographer: Hidden State Guided Data Selection for Dual Budgeted Instruction Tuning

    Zixuan Qin, Qi Qin, Erbo Li et al. · arXiv:2610.25215

    AI summaryHidden Cartographer selects data for instruction tuning by iteratively expanding candidates using hidden states and then pruning with exact training dynamics, achieving the best accuracy on medical, legal, and financial tasks while annotating only 20–30 % of data and fine‑tuning 10–15 %.

  143. Assessing the Empirical Evidence for Loss of Control from Agentic General-Purpose AI

    Risto Uuk, Santeri Koivula, Lorenzo Pacchiardi et al. · arXiv:2610.25241

    Theoretical literature warns that advanced generalist agentic systems might pursue instrumental goals that are misaligned with human preferences, thus posing risks of irreversible loss of human control. The EU's Code of Practice for General-Purpose AI lists loss of control as a…

  144. SPARC: Spoken Profile Authorship Recognition Corpus

    Efthymios Tsaprazlis, Bowen Yi, Tiantian Feng et al. · arXiv:2610.25265

    Speech anonymization has focused on the acoustic signal, leaving open how much speaker information the transcribed words themselves retain. In this work, we study pairwise speaker and demographic-attribute verification from transcribed speech. We introduce SPARC (Spoken Profile…

  145. Aligning Language Models with Indigenous Community Cosmovision through Constitutional AI

    Silvia Fernández-Sabido, Jorge Reyes-Magaña, Jesús Adrián Chay Tun et al. · arXiv:2610.25298

    Large language models (LLMs) are predominantly trained on corpora that reflect Western, anglophone worldviews. This asymmetry is not neutral: when a model answers questions about territory, community authority, or the relationship with nature, it does so from assumptions that…

  146. Learning When to Abort in Transformer Planning: A Mechanistic Study

    Shi Feng, Qimin Zhong, Siwei Wang et al. · arXiv:2610.25300

    Planning does not by itself imply the ability to recognise errors, but recognising errors can improve planning capacity. In this paper, we study this phenomenon in Transformer planning. To analyze the inner mechanism, we follow the approach of Wang et al. (2024) and abstract…

  147. Atoms, Not Knowledge: What Production-Scale Addressed-Memory Writes Deposit

    Wei Gao, Cheng Tian, Duan Yang et al. · arXiv:2610.25317

    Deterministic hash-addressed conditional memory permits local post-hoc knowledge injection. Extending arXiv:2610.21553's bounded-feasibility audit rejecting under-specified generality claims with repaired probes and training-dose/capacity axes, we give, to our knowledge, the…

  148. Where and Why Search-Augmented LLMs Fail When Reasoning over Rapidly Evolving Knowledge

    Tianyi Hu, Bhavyajeet Singh, Niket Tandon et al. · arXiv:2610.25323

    AI summaryTREK is a framework and benchmark that diagnoses why large language models struggle to reason about fast‑changing facts. It shows that the main failure lies in post‑retrieval reasoning, where models get misled by conflicting evidence rather than retrieval errors.

  149. CHSM8: A Chess Transformer that Follows Natural-Language Style Prompts

    Ilia Badanin · arXiv:2610.25356

    We present CHSM8, a 210M-parameter chess transformer that plays moves conditioned on a free-text description of a playing style, e.g. "go for the Sicilian Defense", "solid, safe, risk-free chess" or "You are Magnus Carlsen in his prime". The model is pretrained without search on…

  150. Aligning Cultural Behaviors in Arabic Language Models via Preferences

    Junhong Liang, Daniil Orel, Saeed Almheiri et al. · arXiv:2610.25362

    Arabic LLMs have improved rapidly, but aligning them with country-specific cultural behavioral preferences remains underexplored. Previous work has focused primarily on instruction-tuning for factual knowledge, overlooking nuanced cultural behaviors. We propose ArabPref, which…

  151. MemDerive: A Diagnostic Benchmark for Agent Memory over Evolving Data

    Sen Gao, Yongan Li, Han Chen et al. · arXiv:2610.25373

    AI summaryMemDerive is a diagnostic benchmark that records exact derivation DAGs for agent memory over evolving data, enabling error tracing at intermediate states. It shows that existing memory systems lag simple retrieval baselines and rarely propagate implicit changes, highlighting the need for gathering, versioned rules, and dependency maintenance.

  152. Outcome-Anchored Credit Reallocation for Agentic Knowledge Graph Question Answering

    Mingyuan Li, Yucheng Li, Xiaxia Wang et al. · arXiv:2610.25384

    AI summaryThe paper introduces Outcome-Anchored Credit Reallocation (OACR) to assign fine-grained operation credits from final answer rewards in agentic knowledge graph question answering. OACR improves multi-turn reasoning performance across three benchmarks while reducing inference-time LLM calls and token usage.

  153. From Unverifiable Domain Text to Cross-Lingual RLVR via Code-Switched Task Synthesis

    Cheonbok Park, Jihwan Kim, Shinyoung Joo et al. · arXiv:2610.25399

    Reinforcement Learning with Verifiable Rewards (RLVR) can improve reasoning in large language models, but specialized non-English domains expose a data mismatch. Raw English domain text is often available, while target-language RLVR tasks with verifiable rewards are scarce. We…

  154. Towards Figurative Language Understanding in Moroccan Darija: An Evaluation of Large Language Models

    Jihad R'baiti, Youssef Hmamouche, Emmanuele Chersoni et al. · arXiv:2610.25406

    Figurative language remains a major challenge for Machine Translation (MT) systems, as the intended meaning of such expressions often goes beyond literal translation. Although recent advances in Large Language Models (LLMs) improved the translation of Arabic dialects, benchmark…

  155. Mixture-of-Memories: Low-Overhead Language Modeling with Modular Knowledge Injection

    Yifan Lu, Rubin Wei, Ziyun Zou et al. · arXiv:2610.25425

    AI summaryMixture-of-Memories augments a frozen language model with two neural memory experts—latent and lexical—controlled by a budget router that mixes their outputs per token. The model gains better accuracy, updateability, and low inference overhead across language modeling and factual QA.

  156. RARE: Reinforcement Learning with Adaptive Rubric Evolution for Open-Ended Generation

    Xueyun Tian, Bingbing Xu, Chuyue Li et al. · arXiv:2610.25434

    Verifiable rewards have advanced reinforcement learning in mathematics and code. However, many valuable open-ended tasks share three properties: no automatic verifier of overall quality, multiple requirements to satisfy jointly, and multiple valid responses to each query.…

  157. Design Considerations in Low-Resource Archival OCR: A Case Study in Lakota

    Téa Wright, Laura X. Ma, Claudia Iron Hawk et al. · arXiv:2610.25440

    Building and expanding access to digital archives supports language reclamation and creates lasting resources for community revitalization. Designing effective tools to support these efforts requires taking into account the community-, language-, and document-specific context.…

  158. Enhanced Masked Diffusion Unlearning

    Tomer Garber, Tom Tirer · arXiv:2610.25447

    Masked diffusion language models (MDLMs) generate text by iteratively unmasking tokens with bidirectional context. As these models reach real-world deployment, machine unlearning becomes essential. This process aims to remove the influence of a designated "forget set" without…

  159. System X: An LLM Decision Model That Replies from Its Own KV Cache

    Syed Usama Khalid Bukhari, Syed Safwan Khalid, Muhammad Aamir · arXiv:2610.25456

    Decision models return probabilities over supplied options, but a deployed agent may also need to reply in words. The present study introduces System X, a large language model (LLM) decision model that adds a text-reply option to the LLM-as-Jev readout. When this option wins, or…

  160. Quality-Controlled Reply and Summary Data for Post-Training Small Language Models in AI Call-Screening Agents

    Jiaqi Gan, Tsang Ng, Ankit Raj et al. · arXiv:2610.25458

    AI summaryThe paper creates a privacy‑respecting call‑screening dataset with 3,395 synthetic calls and 15,102 reply/summary targets, training a single LoRA adapter. Adaptation boosts reply accuracy to ~95% and summary quality to 43–72% on held‑out calls.

  161. DiaLong: Benchmarking Reminiscence in Long-Context Dialogues

    Owen Bianchi, Samer Aslan, Ryunosuke Saito · arXiv:2610.25463

    AI summaryDiaLong is a benchmark dataset of 100 long‑context dialogues with a fact‑recall task, where models must classify 40 candidate facts as true or false. Results show current LLMs still forget long‑range information, indicating room for memory‑enhancing methods.

  162. A failure of Imagination: VLMs fail to use visual representations for text, but self-distillation can help

    Shashwat Singh, He He, Tal Linzen · arXiv:2610.25470

    Vision-language (VL) models are typically built by fine-tuning a language model to attend to visual features in service of a Visual Question-Answering objective. We ask whether this alignment changes how language models represent text---especially on tasks where visualization…

  163. Self-Distillation for Supervised Fine-Tuning

    Wenxuan Zhu, Bang An, Shuming Liu et al. · arXiv:2610.25497

    Supervised fine-tuning treats the expert demonstration or gold response as a one-hot target, suppressing valid alternative continuations that the model would otherwise assign probability to. We propose Gold-Conditioned Distillation (GCD), a method that turns expert…

  164. From Seeing to Reporting: A Theory of Reliable Visual Set Generation in Vision-Language Models

    Junzhe Shi, Yuan Gan, Shida Jiang · arXiv:2610.25503

    Vision-language models (VLMs) are asked to report what they see: to count objects, box them, parse a screen or pick a click target (GUI grounding). We argue that reporting is part of the visual task, not merely its formatting. In a dense scene with 173 shapes, GPT-6.1 lists 173…

  165. Where Are Language-Specific Features Represented in Multilingual LLMs? Everywhere

    Mikaela Martins, Jonathan Dunn · arXiv:2610.25505

    Previous work has argued that multilingual LLMs encode language-specific features most strongly in their initial and final layers, implying that intermediate layers support language-agnostic representations. This paper reconsiders this finding by performing four different…

  166. ATEST: Adaptive Resource-Aware Test-Time Scaling for LLM Inference

    Mobina Kashaniyan, Ali Jannesari · arXiv:2610.25519

    Test-time scaling (TTS) improves large language model (LLM) reasoning by sampling multiple answers, but fixed sampling budgets ignore both query difficulty and the changing energy cost of inference under GPU contention. We measure up to a 4.1-fold increase in energy for the same…

  167. Auditing Tool Traces in Agentic LLMs: Source Localization and Counterfactual Dependence Testing

    Junhao Liu, Tianxiao Li, Yongxian Wu et al. · arXiv:2610.25540

    AI summaryThis paper introduces a two-stage auditing framework to detect hidden label shortcuts in tool-augmented LLM agent traces. Applying the audit to TCR-pMHC binding reveals that apparent scientific reasoning was actually driven by dataset identifiers rather than genuine evidence utilization.

  168. EmotiQ: A Quantum Residual Specialist Framework for Text Emotion Classification

    Carlton Kigonya, Tanaka Chirara, Yunting Yin · arXiv:2610.25549

    Emotion classification from text is challenging because many affective states are distinguished by subtle linguistic signals and semantically overlapping boundaries. We investigate whether compact quantum modules can serve as targeted residual specialists that assist traditional…

  169. Narrow Decision Models: A System-1 Architecture for Calibrated, Typed Decisions

    Carlos André Antunes, Aldry Albuquerque, Gabriel de Melo Schmith et al. · arXiv:2610.25553

    System One models, introduced with TypeSafe's Jev, answer typed questions about a state with calibrated probabilities instead of generated text: choosing among options described in natural language (Choice), placing the state on an ordered scale (Score), or judging a yes/no…

  170. Flattening Fantasies: Analyzing Stereotypes in Pornographic Discourse

    Sarmad Chandio, Osama Khalid, Sharaf Zia et al. · arXiv:2610.25566

    This study presents a large-scale quantitative analysis of 5.4 million video titles from xHamster, the world's fourth most visited pornography platform, to examine linguistic patterns used to describe different dimensions of identities (e.g., race and gender). Specifically, we…

  171. Representations in Motion: Layer-wise Rotation and Trajectory Divergence in LLMs

    Zhuonan Yang, Yik Siu Chan, Wannan Yang et al. · arXiv:2610.25574

    AI summaryThe paper tracks how language model representations change layer‑by‑layer and across trials, showing that factuality directions rotate apart when the model is told to lie vs. be honest, and that such rotation also appears in other conceptual tasks. It demonstrates that trajectories alone predict behavior, and that divergent points align with the onset of rotation, even in naturalistic, non‑explicitly‑lying settings.

  172. Assertion and Belief: Moore's Paradox in Language Models

    Anshun Asher Zheng, Weili Cao, Fangcong Yin et al. · arXiv:2610.25586

    Moore's paradox \citep{moore1942} concerns sentences such as ``It is raining, but I don't believe that it is,'' which may well be true yet cannot be sensibly asserted. The absurdity lies not in the content but in the act, since to assert is to vouch for one's own belief. This…

  173. Cognitive Map in Large Language Models

    Albert Qin, Jonathan Cohen, Gautam Reddy · arXiv:2610.25596

    AI summaryLarge language models build abstract relational structures that act as cognitive maps, inferring unseen relations and generalizing to synthetic entities. The study shows models store pairwise links, bind entities via sparse key–value pairs, and can be manipulated to implant false memories.

  174. Text Dominance in Paralinguistic Conflict: Tracing Suppression Through Audio LLM Circuits

    Ankur Banerjee, Vishnu Guntakala, Danity Pike et al. · arXiv:2610.25599

    Audio LLMs deployed in settings such as crisis hotlines and customer support are only useful beyond speech-to-text pipelines if they use acoustic cues rather than the transcript alone. We test whether they prioritise transcript content over paralinguistic cues (emotion, speaker…

  175. Curriculum Learning Teaches LLMs Long-Horizon Implicit Reasoning, Up To A Limit

    Jimson Huang, Maxwell Nickell, Ruowang Zhang et al. · arXiv:2610.25612

    LLMs "reason" by externalizing intermediate steps as tokens through chain-of-thought (CoT), yet even frontier reasoning models hit abrupt performance cliffs on long-horizon tasks. Implicit reasoning (reasoning within a single forward pass) is useful during CoT generation, as the…

  176. MapSteal: Map-based Autonomous Knowledge Stealing Attack Against Large Language Models

    Zhengao Li, Chuxu Zhang, Yushun Dong · arXiv:2610.25626

    Knowledge acquisition from black-box large language models (LLMs) offers a practical approach to adapting smaller student models. However, many existing methods rely on predefined queries or student feedback to guide acquisition, leaving autonomous expansion of knowledge targets…

  177. Consistency Training Suppresses Cue Following Without Teaching Cue Selectivity

    Prakhar Gupta, Terry Jingchen Zhang, Zhijing Jin · arXiv:2610.25650

    Language models often change answers because of a cue, a hint such as "I believe the answer is B" that gives no valid evidence. Consistency training (CT) trains a model to answer the same with and without the cue. Four CT methods apply this idea to output tokens (BCT), residual…

  178. Cross-Pollination Retrieval: Finding Transferable Ideas Across Fields in Scientific Literature

    Seokwon Jung, Yerang Kim, Yejin Kim et al. · arXiv:2610.25678

    Many scientific advances come from cross-pollination, carrying an idea from one field over to a problem in another. Yet retrieving papers across fields remains underexplored, with existing benchmarks confined to a narrow range of fields. We study cross-pollination retrieval, the…

  179. Whose Credential Is It? How Owner Attribution in Agent MemoryShapes Cross-User Account Misuse

    Hau-Sing So, Daixian Liu, Carl Hou et al. · arXiv:2610.25707

    Shared long-term memory lets an LLM agent serving one user inadvertently retrieve another user's credentials, but it is unclear when such exposure leads to actual harm. We introduce a three-stage audit that separates three events: a foreign credential reaches the prompt…

  180. Inside the Scorer: Mechanistic Evidence on Rubric Control in LLM-Based Automated Essay Scoring from 25 Base Models

    Chungche Huang, Po-Ya Angela Wang, Shu-Kai Hsieh · arXiv:2610.25724

    Automated essay scoring (AES) using large language models (LLMs) offers promising use cases for language assessment, yet high-stakes testing requires scores that are both controllable and verifiable, which current LLM-based scorers lack. Given that, we investigate whether…

  181. No Matter Who You Are: Addressivity and Sycophancy in Large Language Models

    Seungjong Sun, Hyunmin Jun, Minsik Yoon et al. · arXiv:2610.25728

    AI summaryThe paper identifies a link between “addressivity” (the model’s tendency to direct outputs toward an addressee) and sycophancy, showing that post‑training strengthens this connection and that any recognized addressee triggers the effect.

  182. Does Unlearning Survive Collaboration? Robust Unlearning for Shared-Model LLM Teams

    Hengsong Liu, Liangyu Teng, Jingnan Cai et al. · arXiv:2610.25731

    AI summaryA method for collaborative LLM teams called ACU reduces the recoverability of sensitive data from the full conversation trajectory, lowering recovery from 41.8% to 19.3% while maintaining task performance. The approach uses message-level reconstruction feedback and replacement-based credit to prevent joint data leakage.

  183. A Calibrated Instrument for Detecting Disposition Drift in Language Models

    Jerry Kaplan · arXiv:2610.25735

    Before language models are released, they are tested for harmful traits such as willingness to carry out dangerous requests, deception, power seeking, and sycophancy. The safe behavior these tests certify may degrade as models are modified, by topical fine-tuning, new training…

  184. Computation, Not Memory: Chain-of-Thought and State Tracking in LLM Agents

    Pedram Mouseli, Massieh Moayedi · arXiv:2610.25760

    Language-model agents often reason before they act, and the value of monitoring that reasoning depends on how it relates to their actions. We ask how an agent's actions depend on its reasoning when the correct action depends on a changing state. In a small file-system task,…

  185. Truncated Reasoning Under a Budget: Evaluating System-1 Models as Decision-makers

    Zhongyin Wang, Zhaoqian Xue, Junting Mu et al. · arXiv:2610.25768

    Large language models (LLMs) often generate more reasoning tokens than needed. Limiting the reasoning budget reduces cost, but forcing an answer from an incomplete trace can hurt accuracy. System-1 decision models select among candidate options without producing a reasoning…

  186. Standing on the Shoulders of Giants: Enhancing LLM Agents for Automated Fact-Checking with Human Expert Skills

    Xinwen Chen, Haorui He, Yupeng Li · arXiv:2610.25777

    AI summaryWe distill AFP fact‑checking guidelines into a modular “Professional Fact‑Checking Skill” and give LLM agents dynamic access to it at inference. SkillCheck improves accuracy by 2.2–4.8 pp and Macro‑F1 by 1.5–6.3 pp on AVeriTeC, and with GPT‑4o‑Mini surpasses GPT‑4o while cutting inference cost by ~61 %.

  187. CoMem: Learning to Anticipate Failures from Retrieved Experience

    Yun Shen, Ming Shen, Tianjun Yao · arXiv:2610.25790

    AI summaryCoMem teaches LLMs to anticipate failures by treating retrieved past experiences as inputs to their learned memory. It achieves strong performance on math, code, and QA tasks, generalizes to out‑of‑distribution problems, and lets small models guide stronger solvers.

  188. Modal Sense Disambiguation in Language Models: The Role of Context, Training Domain, and Input Frequency

    Ezgi Başar, Yevgen Matusevych, Annemarie van Dooren et al. · arXiv:2610.25816

    Modals such as may and must can take on different senses depending on discourse context, alternating between root interpretations (e.g., permission, obligation) and epistemic interpretations (e.g., knowledge, belief). While modals are known to be notoriously difficult for…

  189. When Retrieval Partially Conflicts with Skills: Understanding Procedural Hallucination in Language Models

    Guanqun Jiang, Pengfei Cao, Kang Liu et al. · arXiv:2610.25827

    Language models increasingly use skills that provide reusable instructions and procedures for task execution. After a relevant skill has been selected, the model may need to apply its governing procedure together with retrieved task context. When the retrieved context is useful…

  190. Diffusion Language Models Change Speed Across Tasks and Languages

    Mohsen Fayyaz, Ali Modarressi, Daniel Israel et al. · arXiv:2610.25835

    AI summaryDiffusion language models vary decoding cost across tasks and languages; generating new, rare content requires many forward passes while copying or repeating existing reasoning is cheap. Cost correlates with correctness and can guide efficient inference.

  191. Where RL Breaks: Localizing and Repairing Failures via Targeted Continued Pretraining

    Xinyi Wang, Danqi Chen · arXiv:2610.25836

    AI summaryThe paper shows that RL failures in language models are localized to a few characteristic n‑grams. By retrieving and continued pretraining on just 35M tokens of failure‑related text, it consistently improves reasoning accuracy, outperforming random pretraining data across multiple models and tasks.

  192. Measurement Validity and Representation Dynamics of Confidence Signals in Large Language Models

    Debojeet Ghosh, Shreyansh Kumar, Ayushman Garg · arXiv:2610.25846

    AI summaryThe paper audits Qwen2.5 models’ confidence signals (verbal, probe-based, sampling agreement) on retrieval and reasoning tasks, finding probes signal agreement earlier for retrieval, verbal confidence unstable across prompts, and sampling agreement offers higher resolution despite higher ECE.

  193. Arabic Financial NLP

    Mo El-Haj · arXiv:2610.25854

    Financial communication connects numerical accounts of economic activity with explanations of performance, responsibility and future expectations. Arabic financial natural language processing offers methods for studying these connections across corporate reports, market…

  194. Learning to Reason Efficiently with Interventional Step Credit

    Guanda Li, Xuefeng Bai, Yulong Chen et al. · arXiv:2610.25876

    Large reasoning models often produce lengthy chain-of-thought (CoT) traces mixing useful intermediate steps with unnecessary ones. Recent methods explore step-level signals such as attention mass and step entropy to identify and suppress unnecessary steps. Despite their…

  195. Budgeted Attack Scheduling for LLM Red-Teaming: The Roles of Static Priors, Semantic Guidance, and Online Feedback

    Zhicheng Fang, Han Sun, Jiachen Lei et al. · arXiv:2610.25897

    As jailbreak attacks against large language models (LLMs) become increasingly diverse, red-teaming has come to rely on large libraries of jailbreak prompts and attack strategies to evaluate the robustness of victim models and their defense settings. However, attack effectiveness…

  196. SWE-Residual: Evaluating Starting-State Robustness of Coding Agents

    Jinze Li, Weijie Liu, Jinfeng Xu et al. · arXiv:2610.25899

    Software engineering (SWE) benchmarks are the primary way to measure the capabilities of coding agents: an agent is placed in a code repository or machine environment, given a request, and judged by hidden tests. These benchmarks almost always start the agent from a clean state…

  197. CALM: Consistency-Aware Logit Masking in Decoding Space for Mitigating Overthinking of Large Reasoning Models

    Shengjing Liu, Feiyang Li, Yuxuan Yang et al. · arXiv:2610.25908

    Large reasoning models (LRMs) have achieved strong performance on challenging mathematical and scientific tasks through long chain-of-thought reasoning, but they often suffer from overthinking with unnecessary reasoning steps. Existing truncation-based methods typically detect…

  198. FisherEdit: Fisher Information Guided Knowledge Editing for Large Language Models

    Yizhou Yang, Jiahong Fu, Zhiwu Wang et al. · arXiv:2610.25914

    Sequential knowledge editing in Large Language Models (LLMs) often leads to a degradation of general capabilities due to cumulative parameter interference. In this paper, we revisit prominent projection-based methods like AlphaEdit and reveal a surprising mismatch: their…

  199. LEAPS: Long-context Evaluation of Adaptive Pattern Learning and State Tracking

    Howard Yen, Nitya Mani, Alex Renda et al. · arXiv:2610.25919

    Long-context language models (LCLMs) power agents that act over long trajectories, from improving a codebase to running research experiments to forecasters that condition on lengthy histories. These applications draw on three distinct long-context capabilities: recall, where the…

  200. EvoSkill v2: Fully Agentic Skill Evolution from Benchmark Adaptation to a Stateful Evolver

    Dastin Huang, Baran Nama, Salaheddin Alzubi · arXiv:2610.25931

    EvoSkill v2 is a three-agent system that edits the instructions (skills) an agent is given, leaving its model and harness intact. The user starts a run by describing a benchmark and supplying a grader, which a benchmark adaptor turns into a benchmark-specific plugin. A solver…

  201. Keep the Lineages Alive: Diversity-Preserving SMC for Diffusion LLM Decoding

    Minoo Ahmadi, Seyedarmin Azizi, Mehdi Kamal et al. · arXiv:2610.25932

    Inference-time sequential Monte Carlo (SMC) decoding can improve the reasoning accuracy of masked diffusion language models (diffusion LLMs) without post-training by resampling a population of partial generations according to a reward. Its effectiveness therefore depends on the…

  202. MITRA-lexicon: Lexica of attested translations from Sanskrit into English, Tibetan and Chinese

    Sebastian Nehrdich, Kengo Harimoto, Sven Sellmer et al. · arXiv:2610.25934

    AI summaryMITRA‑lexicon provides 2.18 million Sanskrit headword entries with attested translations into English, Tibetan, and Chinese, each linked to digitized source sentences and aligned at the span level using a fine‑tuned annotation pipeline. The resource outperforms existing dictionaries on benchmark evaluations.

  203. Speech LLMs That Breathe: Modeling Non-Verbal Vocalizations in Dialogue

    Heyang Liu, Lixin Zhang, Jiayi Huang et al. · arXiv:2610.25942

    AI summaryThe paper builds a dialogue dataset with 13 non‑verbal vocalization types and uses multi‑stage fine‑tuning plus NVV‑aware GRPO to train models, boosting expressive NVV generation in VocalNet and VITA‑Qinyu for empathetic and role‑play dialogues.

  204. AdaExploreBench: Benchmarking LLM Agents for Proactive Exploration and Test-time Adaptation in Evolving Environments

    Rui Wang, Zishen Lai, Jiayu Liu et al. · arXiv:2610.25950

    AI summaryAdaExploreBench evaluates LLM agents on proactive exploration and test‑time adaptation in environments with hidden, drifting rules. GPT‑6 Sol attains only 61.9% accuracy, and performance improves by ~10% when agents receive evidence or detect rule drift, highlighting active evidence acquisition as a bottleneck.

  205. Token-Set Choice Confounds POPE: A Systematic Audit of Yes/No Extraction in VLM Hallucination Evaluation

    Kesav Kumar Jayakumar, Karthigeyan Thilak · arXiv:2610.25964

    We set out to reproduce a recent hallucination-mitigation result on the POPE benchmark. The LLaVA-1.5-7B baseline we measured, 82.21 F1 on the adversarial split, sat 1.21 to 8.67 points above the adversarial baselines we planned to compare against (81.00, 79.30, and 73.54). We…

  206. GLOBE: Geometry-Led Online Behavioral Early Exit via Unit-Sphere Trajectories

    Xinyue Peng, Zhenlin Liang, Meng Cai et al. · arXiv:2610.25970

    AI summaryGLOBE stops chain-of-thought reasoning early by embedding reasoning segments on a unit sphere and monitoring trajectory shape; it cuts tokens by ~50 % and latency by ~51 % while retaining 80.6 % of full‑CoT accuracy across five tasks.

  207. Correctness-Dependent Asymmetric Target Distributions for Self-Distillation Policy Optimization

    Suwan Yoon, Seongryong Jung, Changhee Lee · arXiv:2610.25973

    AI summaryAPSD mixes student and self‑teacher distributions based on rollout correctness, preserving good behavior on correct rollouts and sharpening corrections on incorrect ones. It matches or exceeds SDPO performance while reducing training steps by 2.6× on Qwen3 models.

  208. TempoMoE: Identifying and Steering Fast-Slow Thinking Experts for Efficient Multimodal Reasoning

    Xiyue Zhang, Keru Zhou, Ziyi Wang et al. · arXiv:2610.25999

    Multimodal Mixture-of-Experts (MoE) reasoning models rely on long chain-of-thought (CoT) for complex tasks, yet often overthink easy inputs, increasing token cost and latency, and sometimes degrading accuracy. Existing methods optimize reasoning length during training or impose…

  209. Scaling Synthetic Pre-training Data and Evaluation for Indic LLMs

    Abhinav Khattar (NVIDIA), Aishwarya Chhabra (NVIDIA), Ameya Velingker (NVIDIA) et al. · arXiv:2610.26006

    Building capable language models for India requires scalable multilingual data and robust evaluation. We introduce Nemotron-Pretraining-Indic-v1, a synthetic pretraining corpus of approximately 2.83 trillion tokens covering all 22 scheduled Indian languages in native script and…

  210. Accelerated Drift of Scientific Prose in the LLM Era: Evidence from an Interrupted Time-Series Analysis

    Hanna Hubarava, Benjamin V. Ineichen · arXiv:2610.26008

    Every scientific text is embedded in the writing norms of its time: it reflects earlier publications while also shaping the texts that follow. The growing use of LLM-based writing tools introduces a new factor in this evolving system, but the linguistic changes coinciding with…

  211. Understanding When Reflective Prompt and Skill Optimization Helps on Locally Served Reasoning Models: A Two-Model Study of GEPA and SkillOpt

    Andrea Giummarra, Carmelo Baglieri, Antonio Di Maria et al. · arXiv:2610.26020

    Reflective text-space optimizers such as GEPA and SkillOpt have reported large gains on frontier and mid-size models. We test replication across two reasoning-native target-serving configurations: DeepSeek V4 Flash through DwarfStar and Qwen3.8-27B through LM Studio. For each…

  212. Decision4Rec: A Jev-Inspired Framework of Decision Models on Knowledge and Active Graphs for Multi-Agent Recommender Systems

    Marco Polignano, Het Darshan Mehta, Pasquale Lops et al. · arXiv:2610.26035

    Decision models, such as the commercial Jev, are language models that return one probability for each option of a question instead of generating text. We present Decision4Rec, an open and modular framework that makes decision models useful for recommendation. A knowledge graph…

  213. Balance-Aware Pivot Selection for Parallel Diffusion LLM Decoding

    Yejin Lee, Hyundong Jin, Yo-Sub Han · arXiv:2610.26040

    AI summaryThis paper introduces Balance-Aware Pivot Decoding to accelerate parallel diffusion LLM generation by selecting central positions within masked intervals. This approach achieves logarithmic decoding depth while maintaining generation quality across multiple reasoning and coding benchmarks.

  214. Honeyed Words, Hidden Daggers: Benchmarking and Training LLMs to See Through Mock Politeness

    Caixin Kang, Sitong Gong, Tianyu Yan et al. · arXiv:2610.26059

    The Chinese idiom "kou mi fu jian" ("honeyed words, hidden daggers") names speech that is polite in form but hostile in function. We present ZhenhuanBench, a 1,592-item benchmark built from expert commentary on Empresses in the Palace, covering speaker intent, emotion-language…

  215. DeepSEA: A Multilingual Evaluation Benchmark for Southeast Asia

    Jiuzhou Han, Abhishek Bijay Mishra, Trevor Cohn et al. · arXiv:2610.26155

    While language models have demonstrated remarkable capabilities, their performance remains disproportionately skewed towards high-resource languages. This disparity is particularly acute for the 700 million inhabitants of Southeast Asia, where vast linguistic diversity remains…

  216. VISAGENT: An Agent-Based End-to-End Voice Interaction System

    Xiang Wang, Zhaoxiang Liu, Xiang Chen et al. · arXiv:2610.26168

    Voice-based public services have evolved from manual switchboards to intelligent platforms to meet modern user needs. However, current systems remain constrained by rigid menu-driven interaction, fragmented vertical services, and limited extensibility. To address these issues,…

  217. Conditional information Retrieval for Longitudinal Survey Harmonisation

    Wing Yan Li, Zeqiang Wang, Michelle Lin et al. · arXiv:2610.26173

    Identifying conceptually equivalent questions across different surveys is a challenging information retrieval task where surface-level textual similarity is insufficient. Two questions may be lexically similar yet assess entirely different sociological sub-concepts, or lexically…

  218. Reading Time Modeling with Pixel-Based Language Models

    Junlin Li, Sara Alhajeri, Tatsuki Kuribayashi · arXiv:2610.26181

    Tokenization-free, pixel-based language models (PLMs) have recently been proposed as an alternative to conventional token-based language models (TLMs), typically motivated by practical considerations, e.g., the flexibility to support new languages or vocabularies. Nevertheless,…

  219. VEILED-SH: Vulnerability Expression through Indirect Language Evaluation Dataset (Self-Harm)

    Leanne Tan, Keith Chua, Shaun Khoo et al. · arXiv:2610.26190

    AI systems may miss indirect, culturally situated distress or provide support mismatched to the application context. Existing benchmarks do not jointly address cultural variation, application context, and practitioner disagreement. We introduce VEILED-SH, a benchmark and…

  220. Rethinking BPE: Merge Selection as Model Selection

    Vijini Liyanage, François Yvon · arXiv:2610.26225

    Subword tokenization methods such as Byte-Pair Encoding (BPE) are a core component of modern language models; yet, tokenizer capacity remains typically determined by a fixed merge budget, chosen heuristically. Since larger vocabularies increase memory usage and computational…

  221. Heartbeat Thinking: Speculative Reasoning and Tool Execution While Listening in Realtime Voice Agents

    Zhenyu Zhang, Kewei Fu, Yongqi Tong et al. · arXiv:2610.26233

    Tool-using voice agents often leave users waiting after speech ends, even when actionable information arrives earlier in the request. Speculative approaches begin work during speech, but chunk-bounded or interrupt-on-update generation can truncate a tool call before its…

  222. Shaping the Document, Not the Model: Optimized Suffixes for Context Following

    Gia-Bao Dinh Ho, Sekh Mainul Islam, Masahiro Kaneko et al. · arXiv:2610.26236

    When a user supplies a document and wants the answer drawn from it, a language model is expected to follow it even when it contradicts its parametric knowledge. Prior work has focused on making the model rely on context by steering activations, contrasting logits during…

  223. Machina Pauliana: A neuro-symbolic approach to the actio pauliana in Dutch insolvency law

    Daan Boven, Gregor Behnke, David Graus · arXiv:2610.26241

    Applying a legal provision frequently requires both structured rule-based reasoning and sensitivity to open-textured terms developed in case law. The actio pauliana of Article 42 of the Dutch Bankruptcy Act (Faillissementswet, Fw), which allows an insolvency practitioner to…

  224. AudioScorer: Learning Question-Aware Token Relevance for Large Audio Language Models

    Marwan Farag, Bin Yang · arXiv:2610.26258

    AI summaryAudioScorer learns to rank audio tokens by question relevance, distilling answer-gradient saliency from a frozen LALM. It retains only 10% of tokens yet outperforms or matches other pruning methods on 7 of 10 semantic and acoustic tasks.

  225. Answering While You Type: Optimizing Time-to-Answer with Streaming Generation

    Nikita Dragunov, Matvey Mikhalchuk, Anton Razzhigaev · arXiv:2610.26296

    Work on efficient large-language-model inference has concentrated almost entirely on reducing the cost of decoding once a request is complete. The quantity a user experiences, however, is the interval between submitting a request and receiving a usable response, and that…

  226. The Scheduler Is a Hidden Retriever: How Asynchrony Shapes Evidence Acquisition in Search Agents

    Ruiyang Ren, Yuhao Wang, Yinan Zhang et al. · arXiv:2610.26310

    Language-model agents increasingly solve complex tasks through parallel reasoning and asynchronous information gathering. Controlled replay across two model families and three benchmarks shows that delivery timing redirects search decisions made before all results arrive,…

  227. Typed Decision Models under Prevalence Shift: Decision Training, Calibration, and Implicit Priors

    Abdul Rahman Iqbal, Muhammad Fawad Nasim, Amir Saleem · arXiv:2610.26325

    Typed decision models (TDMs) return a probability over caller-defined options, and Jev is described by its vendor as calibrated. But in deployment class frequencies change, so calibration measured on a fixed test set need not hold where thresholds are applied. Existing…

  228. Large-Scale Biomedical RAG: Corpus Scaling, Document Representation, and Efficiency Trade-offs

    Adrián Sánchez-Freire, Gonzalo Pérez-Gómez, Aitziber Atutxa et al. · arXiv:2610.26339

    We present a controlled, large-scale evaluation of how corpus scale, document representation, and reranking affect the effectiveness and efficiency of biomedical Retrieval-Augmented Generation (RAG) systems. Retrieval collections were progressively expanded while retaining the…

  229. VibeTraining-Bench: Data-Trainer-Harness Co-Design for Iterative System Improvement

    Ruotian Peng, Yuanyi Ren, Shuaiqi Liu et al. · arXiv:2610.26342

    AI summaryVibeTraining-Bench evaluates agents’ ability to jointly refine training data, trainer, and inference harness through iterative feedback, across diverse tasks. GPT‑6‑Astra lifts a base system from 32.9 % to 53.7 % on SWE‑bench Verified, approaching a human‑crafted 55.4 % benchmark.

  230. An Empirical Study of Parameter-Efficient Fine-Tuning for Mixture-of-Experts LLMs

    Minglei Li, Peng Ye, Haonan He et al. · arXiv:2610.26370

    Parameter-efficient fine-tuning (PEFT) methods are critical for adapting large models under resource-constrained settings. However, as mixture-of-experts (MoE) architectures, which offer efficient inference at massive parameter scales, gain increasing prevalence in the…

  231. Bridged Self-Distillation for On-Policy Learning

    Runsheng Chen (Technical University of Munich, Germany), Yihong Liu (LMU Munich et al. · arXiv:2610.26397

    On-policy distillation can transfer the reasoning capabilities of a strong teacher to a smaller student. However, distillation from a stronger teacher model faces two mismatches: its solutions may be difficult for a smaller student to imitate, and its token-level probabilities…

  232. How Benchmark Graph Construction Shapes Multi-Hop KG Navigation: A Controlled Audit of PathQuestion and PathQuestion-Large

    Eduin E. Hernandez, Sergio A. Diaz, Luis F. Garcia et al. · arXiv:2610.26399

    Multi-hop knowledge-graph question answering (KGQA) benchmarks are often treated as fixed language-and-reasoning tasks, but for navigation-based methods, difficulty also depends on the graph in which those tasks are instantiated. This makes graph construction a consequential but…

  233. LaMER: Language-Conditioned Multi-Expert Routing for Weakly Supervised Referring Expression Comprehension

    Yu Yu Chang, Tzu-Hsuan Weng, Youssef Mohamed Amin et al. · arXiv:2610.26404

    Referring Expression Comprehension (REC) localizes the image region described by a natural language expression, underpinning applications such as autonomous navigation, human-robot interaction, and medical image analysis. Under weak supervision, REC is challenged by the…

  234. Expert L2 English Speech Evaluation on a Gaming PC: Accuracy, Fluency, and Prosody with XLS-R, XEUS, and PhoneticXeus

    Richard Rose (Hankuk University of Foreign Studies) · arXiv:2610.26406

    oollim is a locally executable system for evaluating L2 English pronunciation accuracy, fluency, and prosody on a consumer computer. The system combines pretrained XLS-R, XEUS, and PhoneticXeus representations with reference-text features and ridge regressions trained on…

  235. Where Does Rhetorical Distortion Live? A Multi-Platform, Multi-Language Measurement of Influencer Content

    Xucheng Yu, Jiangping Chen, Haohan Wang · arXiv:2610.26412

    Much of the manipulation in online influencer content is not false but disproportionate: an accurate fact is framed as historic, urgent, or catastrophic. Fact-checking and clickbait detection are not designed to capture such framing, and little is known about where it…

  236. Co-Evolving Policy and Reward for Code Generation: A Mechanistic Study of Single-Adapter Drift

    Amarsaikhan Batjargal, Noriko Tomuro · arXiv:2610.26416

    Reinforcement learning with verifiable rewards (RLVR) is particularly well suited to code generation because generated programs can be objectively evaluated through execution. Execution also provides behavioral information that can be reused as additional supervision. The…

  237. Self-Consistency of Entity Sets and Citations in a Deep Research System under Repeated Prompting

    Lauri Pykälä, Kimmo K. Kaski · arXiv:2610.26421

    AI summaryThe study evaluates a deep research agent’s consistency by repeatedly prompting it on a cybersecurity task and measuring overlap of named entities and citations. Median entity Jaccard is 0.12, citation Jaccard <0.02, indicating low self‑consistency that varies across entity classes.

  238. Governing the Rule Space. Ruliology, Computational Irreducibility and Anticipatory Governance of Quantum Technologies

    Antonio Felice Uricchio, Francesco Scagliola · arXiv:2610.26423

    AI summaryThe paper introduces a Ruliological Framework that treats regulation as exploratory mapping of rule transformations and trajectories, using computational irreducibility as a conditional tool; it applies this approach to the Quantum Europe Strategy, showing how anticipatory governance can adapt rules to evolving quantum tech.

  239. SNO-PI: Label-Scarce SNOMED CT Entity Linking with Pre-trained Encoders and Curated Terminology Knowledge

    Piyawoot Songsiritat · arXiv:2610.26425

    We present SNO-PI, the top-performing submission on SNOMED International's SNOMED CT Entity Linking Benchmark as of 18 October 2026. SNO-PI achieves a macro character IoU of 0.5387, outperforming the organisers' reference system (0.4582; based on the 2024 challenge winner's…

  240. HarnessRL: Co-Evolving Policies with a Just-in-Time Training Harness for Open-Ended RL

    Xiaoqiang Wang, Ting-En Lin, Yuchuan Wu et al. · arXiv:2610.26426

    Rubric-based reinforcement learning (RL) trains policies for open-ended generation with natural-language criteria as rewards, but these rewards can become ineffective as training progresses. We identify two failure modes. Under non-discriminative rewards, scores collapse to…

  241. The Geometry of Agent Memory: Forecasting Retrieval-Bound Memory Failures, and Characterizing Its Limits

    Iliya Zhechev, Radoslav Ralev, Chris Coleman et al. · arXiv:2610.26433

    AI summaryThe paper builds a shared embedding space for conversation turns, memories, and queries and trains a logistic classifier to predict answer correctness from 25 geometric features. It achieves an AUROC of 0.640 (vs. 0.655 baseline), adding negligible improvement beyond question difficulty and system identity.

  242. WenSight-Decision-1 for Direct Decisions under E-commerce Rules

    Mingwen Liu (WenSight AI Lab), Jun Sun (TooChuang), Sichen Wang (WenSight AI Lab) · arXiv:2610.26444

    E-commerce decisions require applying natural-language rules to the available case evidence. We introduce WenSight-Decision-1, a shared model that scores supplied options directly from rules and case information for six operational tasks, with examples spanning six languages. We…

  243. Label Authority in Speech Emotion Recognition: Intended and Perceived Ground Truth in Emozionalmente

    Marco Giordano, Stefano Giacomelli, Claudia Rinaldi et al. · arXiv:2610.26446

    Ground truth in Speech Emotion Recognition (SER) is often presented as a single categorical fact, yet an acted emotion and the emotion heard by listeners describe different aspects of the same recording. We examine this distinction in Emozionalmente, an acted Italian corpus that…

  244. TeleASR-Amharic: A Benchmark for Robust Amharic ASR in Realistic Telecommunication Conditions

    Dagnachew Mekonnen Marilign, Enrique Molero, Abrham Haile et al. · arXiv:2610.26448

    The real-world usability of ASR models remains challenging, particularly for low-resource languages, where existing speech resources are often collected in clean studio environments. In this work, we introduce TeleASR-Amharic, a benchmark for evaluating Amharic ASR under various…

  245. Training Negatives Still Matter After Calibrating Answerability Readouts

    Jinchen Zhang, Zheyuan Liu, Yihan Zhu et al. · arXiv:2610.26461

    Answerability readouts predict whether a passage supplies an answer, but whether calibration can compensate for removing negative passages during training remains unclear. We present a controlled study of how training-negative construction affects calibrated prediction, ranking,…

  246. AfriGuard: Safety and Robust Refusal For African Languages

    Israel Abebe Azime, Jesujoba O. Alabi, Iffat Maab et al. · arXiv:2610.26474

    Large language models (LLMs) designed to interact with users are typically trained to respond appropriately to harmful or toxic content. However, ensuring appropriate responses becomes more challenging in diverse linguistic and cultural contexts, where safety risks may be…

  247. Strength Controls Change How Interventions Compare Across Sparse Autoencoder Codes

    Jinchen Zhang, Zheyuan Liu, Yihan Zhu et al. · arXiv:2610.26489

    AI summaryThis paper evaluates how different strength controls, such as norm matching and output calibration, affect sparse autoencoder intervention comparisons in language models. It shows that full-output calibration preserves transfer decisions better than total-norm matching.

  248. Mitigating Reward Hacking in Preference Reward Models with Evolving Penalties

    Afonso Baldo, António Farinhas, Marcos Treviso et al. · arXiv:2610.26496

    AI summaryDynalize automatically generates penalties from a language model that identifies reward‑hacking behaviors during policy training, applying them to rollouts. This online intervention lets open‑ended models train longer and improves downstream performance, reducing hacking patterns in tasks like counseling and creative writing.

  249. RouterWorld: Scaling Conversational AI with Latency-Aware LLM Routing

    Jinyang Li, Denis Emelin, Simone Tedeschi et al. · arXiv:2610.26511

    AI summaryRouterWorld benchmarks conversational LLM routing with realistic latency and partial observability, offering 371k responses and 76k agent trajectories. It shows most existing routers prioritize accuracy over latency when only sparse logs or streaming data are available.

  250. A Fisher-Geometric View of Multi-Teacher On-Policy Distillation

    Liu Kaiyuan, Zhuang Ziyuan, Ma Haoxuan et al. · arXiv:2610.26525

    Consolidating specialized foundation models into a unified generalist is a central goal of post-training. Two approaches are in common use: model merging, which is fast but treated as a heuristic, and multi-teacher on-policy distillation, which matches distributions but demands…

  251. ReAnchor: Reusing Rejected Verifier States for Diffusion Drafting

    Sanghyun Lee, Wonjin Nam, Seungho Jang et al. · arXiv:2610.26531

    Block diffusion drafters accelerate speculative decoding by generating multiple draft tokens in a single forward pass. However, each pass produces only a fixed-length block from a single target-generated anchor, limiting how far the draft can extend. Meanwhile, target…

  252. Beyond Attack Success Rate: Cost-Aware Metric for Evaluating Iterative LLM Jailbreaks

    Rohan Menon, Chih-Hong Cheng · arXiv:2610.26589

    Attack success rate (ASR) evaluates jailbreaks against large language models without accounting for repeated calls to the victim model. Yet each additional call gives the deployed system another opportunity to detect the attack and intervene. We introduce…

  253. BERT Is Already a Denoiser: Cheaply Unlocking Iterative Generation in Masked Language Models

    Julio C. Amador Diaz Lopez · arXiv:2610.26601

    Masked language models (MLMs) such as BERT are typically used for representation learning despite their denoising pretraining. We test whether this capability supports conditional generation without diffusion training. Our decoder repeatedly predicts masked tokens and commits…

  254. Conducting Reliable Keyword Estimation with Unreliable ASR in Police Audio Data

    Robert Cole Molloy, Rhiannon N. Miller, Stephen Morgan et al. · arXiv:2610.26614

    Extracting insights from large audio data sets using human transcription is expensive and time-consuming. Off-the-shelf Automatic Speech Recognition (ASR) systems offer an easy-to-use scalable alternative, but systematic transcription errors, especially in domain-specific…

  255. When the harness decides success: state that cannot be re-observed

    Raimondas Lencevicius (Microsoft) · arXiv:2610.26632

    Agent harnesses decide what a language model sees across turns: they drop old turns, summarize them, or replay the model's own earlier reasoning. We ask when these choices change whether an agent succeeds, not only what it costs, and report three findings. First, in a…

  256. From Outcomes to Components: A Counterfactual Evaluation Framework for LLM-Proposed Repairs

    Hengyu Ye, Songhua Hu · arXiv:2610.26650

    An LLM-generated repair action specifies which records to change and by how much. A failed action may still contain a useful target set or numerical update, depending on how the two are paired. We evaluate this problem in traffic networks and databases, where aggregate…

  257. The Development of Sycophancy in Language Models: Tracing Vulnerabilities from Pretraining to Post-Training

    Haonan Huang, Chengkun Cai · arXiv:2610.26655

    Language models can change a committed answer to accommodate a user's opinion or pushback without new evidence. However, when this behaviour develops during training and what a released model inherits from earlier stages remain unclear. We follow 741 checkpoints of 30 open model…

  258. SpatialScout: Can VLM Agents Actively Explore and Map 3D Scenes?

    Zhaoxi Zhang, Hao Liang, Linxuan Wu et al. · arXiv:2610.26659

    Spatial intelligence requires agents to actively acquire visual evidence and integrate observations into a coherent representation of the three-dimensional world. Yet spatial question answering offers limited evidence of whether models can construct accurate metric maps through…

  259. Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows

    Qian Xie, Wenyue Hua, Yueli He et al. · arXiv:2610.26676

    LLM agentic workflows increasingly employ different models for specialized roles. Users may prefer different trade-offs between task quality and deployment cost, sometimes also considering latency. Finding good assignments incurs a separate search cost from evaluating multiple…

  260. Intra-Rubric Reward Divergence: Mitigating Rubric Hacking through Latent Dimension Recovery and Balancing

    Jianqiang Xia, Han Xu, Dianxi Shi · arXiv:2610.26685

    Rubric hacking limits both performance and training robustness in rubric-based reinforcement learning. By decomposing rubrics into sub-dimensions, we reveal the Intra-Rubric Reward Divergence: as the total rubric score increases, certain sub-dimension scores systematically…

  261. Parallel Language Models via Variational Decoding

    Felix Draxler, Robin C. Geyer, Daniel Geyfman et al. · arXiv:2610.26693

    AI summaryParallel Language Models generate multiple tokens per forward pass via latent auxiliary variables, trained with a variational objective that combines autoregressive and parallel decoding losses. On 80 M–3 B models, PLMs match autoregressive quality while achieving 2.3×–5.7× inference speedups.

  262. Hierarchical Token Merging with Recursive Autoencoders for Unsupervised Grammar Induction

    Murat Guney Kemal, Robert Lieck · arXiv:2610.26695

    Hierarchical abstraction is a fundamental principle across many data modalities, enabling complex sequences to be represented compositionally at multiple levels. Learning such hierarchies directly from data, without explicit structural supervision, remains a central challenge in…

  263. HoloCosm: Beyond Single-Metric Benchmark Compression Across Multiple Metrics

    Yupei Lin, Zhongzhan Huang, Junxin Li et al. · arXiv:2610.26714

    Benchmark compression reduces evaluation cost by selecting a small set of samples. Existing methods typically guide selection using a single metric, although benchmarks often assess models along multiple dimensions. We find that model rankings are often weakly correlated across…

  264. Copying Under Repetition: From Prefix Matching to Position Hashing

    Anxin Guo, Tianlong Huang, Chenxiao Yang et al. · arXiv:2610.26722

    Frontier LLMs can copy random text almost flawlessly, yet they often overrun or truncate long blocks of repeated characters. In repeated strings, matching local content no longer reliably identifies where copying should continue or when it should stop. Nevertheless, we show that…

  265. EpiLens: Lightweight RAG for Epidemiological Knowledge Acquisition

    Vincenzo Perri, Ciro Cattuto, Daniela Paolotti · arXiv:2610.26730

    To prepare for future outbreaks, researchers need to know what studies have been done and what data they use. Mapping a large literature by hand is slow, while large language models alone can misstate or conflate sources. We present EpiLens, a lightweight, open-source…

  266. recAMPLIFY: Large-Scale Pretraining of Recursive Protein Language Models

    Saurav Jha, Qianli Liao, Robert Vernon et al. · arXiv:2610.26747

    AI summaryrecAMPLIFY trains a recursive masked protein language model with 155 M unique parameters on 2 T tokens, achieving a 22.5% lift in fold accuracy and better contact recovery while using 56% fewer parameters. Gated Mixture Recurrence (GMR) adds adaptive gating, reducing expected depth by up to 37% with modest accuracy loss.

  267. TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning

    Liana Patel, Rishabh Ranjan, Ion Stoica et al. · arXiv:2610.26754

    AI summaryTokenGate adds a lightweight module to transformers that learns to prune input tokens during prefill, using token‑gated attention to bypass the non‑differentiable top‑K. It yields 1.4–11.3× faster TTFT and 1.5–3.4× lower memory without accuracy loss, outperforming prior token‑pruning methods.

  268. HarnessPro: Recursive Harness Self-Improvement with Pareto Optimization for Performance-Cost Trade-offs

    Zhuoshi Pan, ZhiYuan Feng, Yukuo Cen et al. · arXiv:2610.26770

    Harness development plays a crucial role in building capable AI agents. Recent approaches improve harnesses through recursive self-improvement (RSI), but their performance gains often come with higher execution costs. We introduce HarnessPro, a label-free method for evolving…

  269. Monsoon: Scalable Spontaneous Speech Collection for Low-Resource ASR in 50 Languages

    Shobhit Banga, Manas Dhir, Aaditya Pareek et al. · arXiv:2610.26776

    For most languages, automatic speech recognition (ASR) is limited less by model architecture than by a lack of accurately transcribed spontaneous speech. We present Monsoon, a framework for collecting such data at scale. It elicits unscripted conversations between paired…

  270. Game of Phones: Harnessing Game Theory and LLMs in 'Bot Wars' to Counteract Phone Scams

    Nardine Basta, Robin Carpentier, Benjamin Zi Hao Zhao et al. · arXiv:2610.26781

    Phone scams impose substantial and growing costs on individuals and financial systems worldwide, yet existing countermeasures impose no resource cost on perpetrators. Strategic scam-baiting, in which automated agents engage scammers to deplete their operational capacity, offers…

  271. RESIN: Multi-Chain Reasoning with Entity-Structured Indexing

    Xuanyu Meng, Jash Rajesh Parekh, Jiawei Han · arXiv:2610.26782

    Multi-chain reasoning is a challenging task not only because the multi-chain evidence is dispersed, but also because different parts of reasoning may require distinct, interacting chains of support. Flat retrieval can flood a model with loosely related text, whereas early…

  272. Teacher Supervision, Fixed Representations and Calibration: Exact Risk Calculations for Candidate-Scoring Decision Models

    Agus Sudjianto, Denis Burakov · arXiv:2610.26797

    Candidate-scoring decision models return a probability distribution over a presented set of answers. Public documentation of one such system, Jev, and of an open counterpart, JevAny, describes three training ingredients that determine what these probabilities estimate: soft…

  273. Safety Mid-Training: Internalizing LLM Safety as a Foundational Capability

    Zhengyue Zhao, Liwei Jiang, Yejin Choi et al. · arXiv:2610.26809

    Safety alignment for large language models (LLMs) is primarily performed during post-training, while recent work has also begun incorporating safety data into pre-training. Yet safety can degrade when later training no longer includes safety data, and gains in safety often come…

  274. ASTOR: Benchmarking and Improving Autoformulation for Soft-Constraint Optimization with a Formal Grammar

    Amer Goel, Yeganeh Alimohammadi, Andrew Daw · arXiv:2610.26819

    Real-world decision problems combine two qualitatively different kinds of constraints: requirements that must be satisfied, called hard constraints, and preferences that can be violated, called soft constraints. Because these problems are often posed to decision-makers in…

  275. AfriBED: a Speech Recognition Bias Evaluation Dataset for Low Resource African Languages

    Claytone Sikasote, Hussein Suleman, Jan Buys · arXiv:2610.26821

    AI summaryAfriBED is a 9‑hour Bemba and 18‑hour Nyanja speech dataset designed to evaluate gender and speaker‑type bias in ASR. Baseline experiments show it effectively reveals performance disparities across speaker subgroups in low‑resource African languages.

  276. SpecMRL: Redesign Matryoshka Representation Learning within Parametric Spectrum

    Zhongxin Chen, Songhao Wu, Heng Cui et al. · arXiv:2610.26824

    AI summarySpecMRL reorganizes Matryoshka Representation Learning by learning a spectral basis weighted by feature importance, enabling more effective prefix readout. It achieves higher performance than vanilla MRL across all reduced dimensions and even exceeds full‑dimensional MRL with only half the embeddings.

  277. MemT-1.0: Towards Memory-Native Evolution

    Zhiyu Li, Zeyu Zhang, Linyun Liu et al. · arXiv:2610.26825

    AI summaryMemT-1.0 integrates memory directly into the model, using Gated DeltaNet-2 and Mixture-of-Storage, and is trained on 34B tokens. It outperforms parametric memory baselines, achieving 1.86× faster inference and 66× less storage at 128K token history.

  278. RefCraft: Benchmarking Visual-Reference-Conditioned Agentic Generation through Web Development

    Yuchi Wang, Rongyao Fang, Weihao Yu et al. · arXiv:2610.26826

    AI summaryRefCraft introduces a benchmark of 300 multimodal tasks evaluating AI agents on webpage development using visual references and text instructions. Experiments show that current frontier models struggle with this workflow, with the top system achieving a score of only 52.12 out of 100.

  279. KEEP-Bench: Evaluating Evidence Preservation in Context Compression

    Ziqing Man, Di Wu, Jia-Chen Gu et al. · arXiv:2610.26827

    Context compression improves long-context efficiency but may introduce faithfulness issues through an information bottleneck. Existing evaluations rely on QA metrics, but a reader can still answer correctly from an unfaithful compression, so these metrics underestimate such…

  280. Agent World Model in the Wild: Computer-Use Agent Environment Synthesis

    Zhaoyang Wang, Qianhui Wu, Haorui Wang et al. · arXiv:2610.26828

    AI summaryWildAWM synthesizes 341 long‑horizon computer‑use tasks in controllable, multi‑interface environments using open‑source models, and training Qwen agents in these worlds boosts performance on eight out‑of‑distribution benchmarks.

  281. Competing Learning in Hybrid Architectures

    Xingyu Shen, Yingfa Chen, Ziqing Qiao et al. · arXiv:2610.26830

    AI summaryHybrid models combine fast linear recurrence and softmax attention, but a “Competing Learning” effect causes the recurrence to dominate retrieval tasks, preventing attention from learning. Stopping recurrence updates mid‑training and then training attention improves language modeling and retrieval performance.

  282. LatComm: Reusable Context Compression for Latent Communication between Large Language Models

    Huawei Lin, Jinting Liu, Tan Yu et al. · arXiv:2610.26840

    Systems that combine several large language models (LLMs) often use one context for many questions. When the context is passed between models as text, the receiving model processes all of its tokens again for every question. Avoiding this cost requires a context representation…

  283. WeAct: Dynamic Weight Switching as Agent Actions

    Rui Shi, Xunjian Yin, Jiacheng Sang et al. · arXiv:2610.26847

    Long-horizon agents must learn heterogeneous capabilities from interleaved trajectories. Updating shared parameters to learn new capabilities can degrade previously acquired ones, resulting in catastrophic forgetting. As a trajectory unfolds, different stages may require…

  284. OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory

    Yu Zhou, Cheng-Fu Yang, Rui Sun et al. · arXiv:2610.26860

    AI summaryOpenVLHarness adds a tool‑capability layer and persistent multimodal memory, enabling large language models to fetch, interpret, and store heterogeneous evidence across reasoning steps. It boosts performance on 22 benchmarks by 9.7–12.6 points over no‑tool baselines while reducing token cost.

  285. Can It Actually Work? Synthesizing Functional CAD Mechanisms

    Wenqian Zhang, Yangyi Huang, Zigeng Xu et al. · arXiv:2610.26861

    While LLM agents can generate visually plausible CAD assemblies, these designs often fail to fulfill their intended physical functions. We study functional CAD design, a setting where agents interpret underspecified requests to construct and iteratively revise mechanisms that…