Entropic Advantage Policy Optimization (EAPO) is introduced, an entropy-guided credit assignment method that treats success and failure asymmetrically and promotes more effective exploration, broadening problem coverage and generating more diverse candidate answers.
Woongyeong Yeo, Minki Kang, Chanuk Lee et al.· 0 citations
BOReFT is introduced, which learns a compact, low-dimensional space of hidden-state interventions in a frozen language model, and uses this space as the search domain for Bayesian optimization with an external scoring function, and provides a principled new bridge between discrete proposal spaces of LLM-based search an...
It is suggested that LLMs can support revision boundary judgment when task-adapted, but general purpose prompting alone may not outperform transparent structural heuristics.
Yu Tian, Andrew H. Potter, Katerina Christhilf et al.· 0 citations
A standardized evaluation framework for unstructured NLA explanations is introduced, measuring information recoverable from explanations, contextual support for their claims, and writing quality, and opening up a direction for improving activation-derived training to encourage more informative, supported, and readable...
Gert Lek, Zi-Xuan Xia, Pin-Yu Chen et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Context-aware dynamic trees allocate the speculative decoding budget according to draft path probabilities, adapting their depth and branching to the current context. Under stochastic decoding, however, we find that this structural advantage does not always compensate for the acceptance gains of random sampling paired...
This work attempts to make use of high-quality public documents with small perturbations and empirically finds that LLMs can successfully generate context-dependent reasoning traces and answers, which are then used to train a student model that substantially improves the performance on CL-bench.
Hao Wu, Yang Xiao, Yu-Song Sun et al.· 0 citations
This work proposes a masked diffusion language model, fine-tuning LLaDA-8B-Instruct with a class-conditional reconstruction objective using LoRA and requiring no architectural changes beyond the base model, which leads on average rank against discriminative baselines trained on stronger backbones across seven held-out...
Gert Lek, Abele Malan, Chao-Yi Zhu et al.· 0 citations
On 434 expert-audited real LLM translations, SIV attains the top AUC, uniquely detects and grades expert-labeled major errors, and abstains, rather than mis-scoring, on out-of-vocabulary translations.
E-CONAN diagnostics dataset is introduced, a freely available dataset manually-annotated with coarse-grained and fine-grained categories based on the authors' proposed Arabic hierarchy, which helps NLU designers better understand their models by doing error analysis and in-depth investigation.
Khloud Al Jallad, Nada Ghneim, Ghaida Rebdawi· arXiv.org· 0 citations
This paper compares two low-cost choices retrospectively -- a cost-reducing choice and a balanced choice -- with estimated grading cost reductions and average post-training score gaps of 1-3 points from the best evaluated training verifier, and establishes that verifier choices are interchangeable.
Andreas Lindhardt Plesner, Curtis G. Northcutt, F. Guzmán et al.· 0 citations
Using controlled corruption, this work decouple these two roles and finds a reversal: making a noisy token easier to predict reduces its damage as a target but increases it as context.
Su-Qin Yuan, Runqi Lin, Ke-Yu Lin et al.· 0 citations
BRISK-DLM is introduced, a framework that addresses both mismatches between how these tokens are predicted and how they ultimately contribute to generation by optimizing proposal learning and selection for verified progress.
Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.