paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
AP

Archiki Prasad

ACL 2026×2COLM 2026ICLR 2026推理强化学习与后训练效率与系统智能体与工具评测与基准
新星分贡献者
68
一作贡献0
核心/参与41
方向广度16
合作网络6
0 一作 · 4 篇 · ACL 2026 / COLM 2026 / ICLR 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

4
作者位次 #3/6COLM 2026Poster· Poster Session 2· Franciscan C· #98

Think Right: Learning to Mitigate Under-Over Thinking via Adaptive, Attentive Compression

Joykirat Singh · Justin Chen · Archiki Prasad · Elias Stengel-Eskin · Akshay Nambi · Mohit Bansal

Think Right with Adaptive, Attentive Compression: Online post-training RL method that leverages the model’s self-attention to identify key steps and prune redundant ones.

摘要

Recent thinking models are capable of solving complex reasoning tasks by scaling test-time compute, but this scaling should be allocated in line with task difficulty. On one hand, short reasoning (underthinking) leads to errors on harder problems that require extended reasoning steps; but, excessively long reasoning (overthinking) can be token inefficient by generating unnecessary steps even after reaching a correct intermediate solution. We refer to this as under-adaptivity, where the model fails to modulate its response length appropriately given problems of varying difficulty. To address under-adaptivity and strike a balance between under- and overthinking, we propose TRAAC (Think Right with Adaptive, Attentive Compression), an online post-training RL method that leverages the model’s self-attention to identify key steps and prune redundant ones. TRAAC also estimates difficulty and incorporates it into training rewards, thereby learning to allocate a reasoning budget commensurate with example difficulty. Across a variety of tasks (AIME, AMC, GPQA-D, BBEH), TRAAC (Qwen3-4B) achieves an average absolute accuracy gain of 8.4% with a relative reduction in reasoning length of 36.8% compared to the base model, and a 7.9% accuracy gain paired with a 29.4% length drop compared to the best RL baseline. TRAAC generalizes well, with accuracy and efficiency gains on out-of-distribution non-math datasets like GPQA-D, BBEH, and OptimalThinkingBench. Our analysis shows that TRAAC learns to adjust its thinking budget based on difficulty and that a combination of task-difficulty calibration and attention-based compression yields gains across diverse tasks.

推理强化学习与后训练效率与系统LLM ReasoningGRPOOverthinkingUnderthinkingOpenReview
作者位次 #2/6ACL 2026Poster· Natural Language Processing

PRI n TS : Reward Modeling for Long-Horizon Information Seeking

Jaewoo Lee · Archiki Prasad · Justin Chen · Zaid Khan · Elias Stengel-Eskin · Mohit Bansal

摘要

Information-seeking is a core capability for AI agents, requiring them to gather and reason over tool-generated information across long trajectories. However, such multi-step information-seeking tasks remain challenging for agents backed by language models. While process reward models (PRMs) can...

智能体与工具评测与基准推理OpenReview 项目页
作者位次 #2/4ACL 2026Poster· Natural Language Processing

G r AI n S : Gradient-based Attribution for Inference-Time Steering of LLM s and VLM s

Duy Nguyen · Archiki Prasad · Elias Stengel-Eskin · Mohit Bansal

摘要

Inference-time steering provides a lightweight alternative to fine-tuning large language models (LLMs) and vision-language models (VLMs) by modifying model activations without updating weights. However, existing methods often rely on a global intervention vector, overlook token-level causal influ...

多模态可解释性对齐与偏好OpenReview 项目页

常见合作者