← heapsort-ai

large language models

265 items

RESEARCHarXiv CS.CL·4/15/2026

Self-Distillation Zero: Self-Revision Turns Binary Rewards into Dense Supervision

Self-Distillation Zero (SD-Zero) is a novel post-training method designed to be more training sample-efficient than traditional reinforcement learning, without requiring external teachers or high-quality demonstrations. It operates by having a single model act as both a Generator and a Reviser, using the Reviser's improved responses and token distributions to provide dense supervision for the Generator through on-policy self-distillation.

27
RESEARCHarXiv CS.CL·4/15/2026

Narrative over Numbers: The Identifiable Victim Effect and its Amplification Under Alignment and Reasoning in Large Language Models

This research systematically investigates the Identifiable Victim Effect (IVE) in Large Language Models, a cognitive bias where specific, narratively described victims receive more resources than statistically characterized groups. The large-scale empirical study across 16 frontier LLMs determines if these systems inherit human affective irrationalities in critical applications like humanitarian triage and content moderation.

27
RESEARCHarXiv CS.LG·4/15/2026

Disposition Distillation at Small Scale: A Three-Arc Negative Result

This paper details an attempt to distill behavioral dispositions into small language models (0.6B-2.3B parameters) through a distillation pipeline. Initial reported gains were later falsified due to evaluation artifacts, resulting in a negative outcome for the core hypothesis and leading to three subsequent arcs of investigation.

27
RESEARCHarXiv CS.LG·4/15/2026

A Layer-wise Analysis of Supervised Fine-Tuning

This research analyzes Supervised Fine-Tuning (SFT), revealing that instruction-following capabilities emerge distinctly across layers: middle layers are stable while final layers are highly sensitive. Leveraging this, the authors propose Mid-Block Efficient Tuning, which updates critical intermediate layers, outperforming standard LoRA with reduced parameter overhead.

27
RESEARCHarXiv CS.AI·4/25/2026

Adaptive Test-Time Compute Allocation with Evolving In-Context Demonstrations

This work introduces an innovative framework for adaptive test-time compute allocation, jointly adjusting where computation is spent and how generation is performed. The method uses a warm-up phase to identify easy queries and then concentrates further computation on unresolved queries, reshaping generation distributions with evolving in-context demonstrations.

27
RESEARCHarXiv CS.AI·4/13/2026

Model Space Reasoning as Search in Feedback Space for Planning Domain Generation

This research investigates using an agentic language model feedback framework to generate high-quality planning domains from augmented natural language descriptions. It evaluates the impact of various symbolic feedback mechanisms, like landmarks and plan validation output, in conjunction with heuristic search over model space to optimize domain quality.

27
RESEARCHarXiv CS.LG·4/13/2026

Distributionally Robust Token Optimization in RLHF

To address LLMs' susceptibility to failures from small prompt shifts, especially in multi-step reasoning, researchers propose Distributionally Robust Token Optimization (DRTO). This approach combines token-level Reinforcement Learning from Human Feedback (RLHF) with Distributionally Robust Optimization (DRO) to enhance consistency under distribution shifts, showing improvements on mathematical reasoning benchmarks.

27
RESEARCHarXiv CS.CL·5/1/2026

Length Value Model: Scalable Value Pretraining for Token-Level Length Modeling

This paper introduces the Length Value Model (LenVM), a novel token-level framework for modeling the remaining generation length in autoregressive models. By formulating length modeling as a value estimation problem, LenVM provides an annotation-free, scalable, and effective signal for LLMs and VLMs, improving performance on exact length matching tasks.

27
RESEARCHarXiv CS.CL·4/30/2026

SpecTr-GBV: Multi-Draft Block Verification Accelerating Speculative Decoding

SpecTr-GBV is a novel speculative decoding method that unifies multi-draft and greedy block verification to accelerate language model inference. It formulates the verification step as an optimal transport problem, improving both theoretical efficiency and empirical performance by achieving the optimal expected acceptance length.

27
RESEARCHarXiv CS.CL·4/9/2026

Hallucination as output-boundary misclassification: a composite abstention architecture for language models

Este artigo enquadra a alucinação em grandes modelos de linguagem como um erro de classificação e propõe uma intervenção composta por recusa baseada em instruções e um gate de abstenção estrutural. O gate utiliza um score de déficit de suporte de sinais como auto-consistência e cobertura de citação, mas a avaliação controlada mostrou que nenhum mecanismo isolado foi suficiente para mitigar totalmente o problema.

27