Large language models

Model releases, architecture work and prompting research on large language models — from frontier-lab announcements to the arXiv papers behind them.

32,584 stories · RSS feed

arXiv Machine Learning
Sep 16

Crash Narrative-Guided Countermeasure Recommendation Using Large Language Models: A Retrieval-Augmented Generation Framework for Intersection Safety

arXiv:2609.15997v1 Announce Type: cross Abstract: Improving safety at intersections requires identifying crash mechanisms and recommending appropriate countermeasures. However, this process tradition...

By Abu Saif Md Nasim Uddin, Mohamed Abdel-Aty, Zubayer Islam, Parvez Anowar, Chenzhu Wang
arXiv AI
Sep 16

Can LLMs Model Incorrect Student Reasoning? A Case Study on Distractor Generation

The paper investigates how large language models (LLMs) generate distractor answers for multiple‑choice questions (MCQs) by modeling student misconceptions. It introduces a learning‑science‑based taxonomy of reasoning strategies and applies it to LLM‑generated reasoning traces in math and science MCQs. The study finds that in math, LLMs often follow a misconception‑based process that can be diagnostically useful, whereas in science they rely more on semantic similarity, with frequent failures when the model cannot produce a correct solution or discards plausible distractors. Providing the correct solution in the prompt improves alignment with human distractors by 6.4%. "whyItMatters":"The findings show that anchoring distractor generation to the correct solution enhances LLM alignment with human‑authored distractors, underscoring the importance of correct‑answer cues in educational AI."

By Yanick Zengaffinen, Andreas Opedal, Donya Rooein, Kv Aditya Srivatsa, Shashank Sonkar, Mrinmaya Sachan
arXiv Machine Learning
Sep 16

LLM Inference in a Flash!

The paper "LLM Inference in a Flash!" proposes an integer‑only quantization scheme and a dictionary‑based KV cache compression technique to enable large language model inference on compute‑in‑flash (CIF) devices. By eliminating floating‑point operations and reducing KV cache traffic through sparse dictionary coding, the authors achieve minimal accuracy loss while cutting dynamic KV cache traffic by 15× on Llama‑3.1‑8B and Qwen‑2.5‑7B models.

By Sebastian Zhao, Minseo Kim, Coleman Hooper, Luca Manolache, Michael W. Mahoney, Yakun Sophia Shao, Kurt Keutzer, Amir Gholami
arXiv Computer Vision
Sep 16

ViD: Vision-Dominant Gender Bias Mitigation for Large Vision-Language Models

The paper introduces ViD, a vision‑dominant gender bias mitigation framework for large vision‑language models. ViD uses causal analysis of attention patterns and dual mechanisms—backdoor adjustment and refined token selection—to suppress bias while preserving reasoning and generation quality. Experiments show a 14.7% reduction in gender bias on FACET and significant improvements on MS COCO image captioning, all without extra training overhead.

By Zhipeng Zhao, Zhaoqiang Wei, Peishun Liu, Youwei Zhao, Ruichun Tang
arXiv AI
Sep 16

Optimal Pruning for Neural Architectures using Fisher Information Distances

The paper introduces a new parameter pruning scheme based on the Fisher information metric, using the geodesic distance in model space to determine the minimal change when a parameter is set to zero. This approach creates a hierarchy of pruning methods, starting from traditional magnitude pruning and progressing to more sophisticated, effective schemes. Experiments on fully‑connected networks and vision transformers across MNIST and CIFAR‑10 show that the Fisher‑based method outperforms magnitude pruning and local Fisher pruning in accuracy and Matthews correlation coefficient, while intermediate approximations offer computational efficiency with near‑optimal performance.

By David S. Berman, Yen-Yu Fu, Edward Hirst, Thelma Chiwete Obirai
arXiv AI
Sep 16

Affect-Prototype Guided Fusion for Open-Vocabulary Incomplete Multi-modal Emotion Recognition

The paper introduces Affect-Prototype Guided Fusion (APCF), a framework for open‑vocabulary multimodal emotion recognition that handles incomplete and unsynchronized modal data. APCF builds an affect‑prototype library to model how different emotions contribute across modalities, enabling dynamic fusion of available features. The fused representations are then decoded by an LLM to generate open‑vocabulary emotion labels, achieving superior performance on OV‑MERD+ and MER‑FG datasets compared to existing methods.

By Yichi Zhang, Shenyue Wang, Jing Luo, Chunyang Yu, Xinyu Yang
arXiv AI
Sep 16

FlexEE: Self-Speculative and KV-Compatible Early Exiting for Offloading-Aware LLM Inference

FlexEE is an early‑exiting framework designed for large language model inference that is constrained by computation and memory, particularly in offloading‑based deployments. It uses layer‑wise exit supervision, self‑speculative decoding over a Top‑K local vocabulary, and dynamic hidden‑state management to enable reliable intermediate‑layer predictions and memory‑aware execution. Experiments on Llama2‑7B and Llama3‑8B show that FlexEE achieves significant speedups—up to 1.27×/3.16× and 1.25×/2.83× respectively—while maintaining minimal accuracy loss.

By Qihu Xie, Ziwei Li, Yi Kang
arXiv AI
Sep 16

Symbolic Separation: Grounding Deep Agents in Knowledge Graphs for Trustworthy Operational Data Analytics

The paper introduces Symbolic Separation, a method that grounds deep learning agents in knowledge graphs to improve reliability in operational data analytics. By restricting agent actions to an ontology-constrained Virtual Knowledge Graph with deterministic pre-execution validation, the approach transforms complex queries into validated graph traversals rather than relying on LLM-inferred joins. In experiments on 49.9 TB of supercomputer telemetry, the Neurosymbolic Deep Analyst achieved an 86% task‑success rate, eliminated silent data‑integrity errors, and reduced token costs by 2.4× compared to a non‑symbolic baseline.

By Baibek Davletiyarov, Junaid Ahmed Khan, Andrea Bartolini
arXiv Machine Learning
Sep 16

Distilling Foundation Models for Agentic What-If Reasoning:Cost, Latency, and Governance in a Hybrid LLM+SLM Architecture

The paper presents a method for compressing large tabular foundation models into compact feed‑forward students for use in interactive agentic decision loops. By distilling a TabPFN teacher into a student, the authors reduce model size from 53.2 M to 8,546 parameters (6,220× compression) and from 111.4 M to 17,059 parameters (6,532× compression) while preserving 95.4–100.5% accuracy and 96.8–100.0% AUC across several benchmarks. The study demonstrates that soft‑target distillation yields a 2.1–7.0 AUC improvement over hard‑label training.

By Sourish Dey, Aditya Kumar
arXiv Machine Learning
Sep 16

Routing Absorption in Sparse Attention: Why Random Gates Are Hard to Beat

The paper examines why learned gates in sparse attention models offer little advantage over random gates when jointly trained with the transformer. Through experiments on a 31M-parameter transformer, the authors attribute this to routing absorption, where the model’s representations adapt to the imposed mask, diminishing the benefit of learned routing. They also explore hard masking, stochastic mask training, and the impact of trainable attention layers on gate performance, concluding that freezing the model stabilizes routing targets for effective post‑hoc sparsification.

By Keston Aquino-Michaels