This study proposes a sentence-level framework to identify, analyze, and trace the evolution of motivations for mentioning algorithms in academic papers, using natural language processing as a case study. The researchers classify these motivations using pretrained models and data augmentation, revealing that deep learning models outperform traditional machine learning approaches.
The authors propose KbSD, a framework that addresses reward sparsity in agentic search by using dense token-level supervision and quadrant-adaptive optimization to calibrate when models should trust parametric memory versus retrieved evidence. This approach utilizes an information-asymmetric self-distillation process where a hint-augmented teacher generates calibrated reasoning demonstrations for a student model without requiring a larger external model.
The authors propose ARKD, a reinforcement-learning-based adaptive KL-weighted distillation framework that addresses the limitations of single KL objective methods in compressing Large Language Models. By using a policy network to dynamically assign weights to forward and reverse KL divergence based on teacher-student distributional characteristics, the method achieves dual alignment on principal and long-tail modes.
A study demonstrates that the per-word processing time in the state-space language model Mamba aligns with human reading times. The research shows that Mamba's dynamic discretization timestep is a significant predictor of how long humans take to read words, even when controlling for other factors like GPT-2 surprisal.
This study analyzes the distribution of novelty in Chinese Library and Information Science (LIS) papers published between 2000 and 2022, examining trends across journals, topics, and time periods. Using BERTopic for topic identification and combinatorial innovation theory for novelty scoring, the research investigates how collaboration patterns influence scholarly innovation.
This study introduces clinical reasoning graphs to evaluate the diagnostic reasoning patterns of large language models, revealing that while they achieve competence, they lack consistent reasoning schemas. The authors extracted structured graph representations from 750 traces across five LLMs and tested for stable reasoning patterns in clinically similar cases.
Researchers introduce SABER-Math, the first fully automated benchmark for evaluating mathematical information retrieval without expert annotation, addressing the difficulty of isolating retriever effects on downstream performance.
The article introduces MemDelta, a controlled evaluation protocol for agent memory systems that isolates individual components to prevent confounding variables from skewing results. Using the LongMemEval-S dataset with 500 questions across three model families, the study reveals that reported gains often mix changes in memory methods with variations in language models or retrieval pipelines.
This study investigates the reliability of using Large Language Models as judges for verifying rubrics in complex agentic scenarios, introducing RuVerBench as the first benchmark for this purpose. The research evaluates frontier models on deep research and coding tasks, revealing that while performance is strong, significant noise persists in verification.
This article proposes using thermodynamic phase-transition theory to understand the dynamics of language model alignment during post-training, specifically through the lens of material crystallization. The authors argue that this physical framework provides a principled vocabulary for reasoning about how models change and where alignment-induced structure originates.
The authors propose ParametricSkills, a framework that converts free-form textual skills into parameters at test time by training a hypernetwork to generate LoRA adapters. This approach enables context-free skill exploitation, addressing the difficulty of adhering to instructions in complex scenarios.
This study investigates the performance of small language models during the generation stage within a Retrieval-Augmented Generation (RAG) system. The research benchmarks these models using diverse open-source and proprietary datasets to evaluate their effectiveness across various subject areas.
The llama.cpp project has released version b9846, which includes a Vulkan backend optimization for Asahi Linux. This update rolls back the block size loop in matrix multiplication to improve compatibility and performance on Apple Silicon hardware running Linux.
The paper introduces LatentRevise, a first-order latent revision method designed to recover training signals in reinforcement learning with verifiable rewards (RLVR) for prompts where correct trajectories are rarely sampled. By optimizing the input embeddings of a reasoning prefix based on failed rollouts and gold answers, the method generates useful data from previously unproductive attempts.
This article introduces an adaptive RAG framework that allocates retrieval budgets by calibrating sequence log-probability and prefix-logit uncertainty signals into probabilities of correctness. The system decides whether to answer closed-book, retrieve a compact context (k=1), retrieve a full context (k=5), or abstain based on these calibrated probabilities.
IHDec addresses the failure of Large Language Models to maintain instruction hierarchies in multi-turn contexts by leveraging Jensen-Shannon Divergence to detect and correct role-influence inversions. This training-free method dynamically suppresses subordinate roles that override superior directives during token generation.
This study introduces approach-level diversity to address the gap between surface-level variation and actual strategic differences in LLM mathematical reasoning. It demonstrates that prior metrics fail to capture true methodological diversity, leading to a decline in approach-level diversity during diversity-aware RLVR training.
The article introduces VISTA, a training-free layer designed to address the context window limitations of long-horizon tool agents by exposing their internal state. It argues that frontier models are blind to their own context usage and proposes an interface that surfaces working memory details rather than relying on learned compression policies.
This paper addresses graph anomaly detection on text-attributed graphs by formalizing it as a node-to-neighborhood semantic consistency problem, where anomalies stem from mismatches between textual semantics and topological relationships. The authors propose N2NSC, a framework that uses two complementary fusion paths to align graph topology with textual semantics, enabling large language models to leverage both structural and textual neighborhood information.
The SHOVIR benchmark evaluates vision shortcut learning in radiology report generation by extending MIMIC-CXR and PadChest-GR with per-box CheXpert labels. It utilizes image-level and disease-level occlusion experiments to isolate direct and contextual shortcuts where models rely on spurious correlations rather than actual visual evidence.