5 papers
Structural properties of admissible subgraphs and the depth of symbolic powers of cover ideals
Nguyen Thu Hang, Nguyen Thi Thanh Tam, Thanh Vu
Let be a simple graph with cover ideal in a polynomial ring $S = \k[x_1, \ldots, x_n]$. For each integer , let denote the maximum size of an ordered ma…
Model or Harness? An Interaction-Centric Taxonomy for Localizing Agent Failures
Harsh Raj, Vipul Gupta, Anas Mahmoud +4
Existing evaluations often reduce agent failures to system-level outcomes, obscuring where the fault originated and which intervention would improve the agent system. This creates…
CRAFT: Clustering Rubrics to Diagnose Weak LLM Capabilities and Generate Targeted Fine-Tuning Data
Vipul Gupta, Zihao Wang, Razvan-Gabriel Dumitru +3
Evaluations should do more than measure a models current performance. They should tell us what to fix for the next model iteration and provide a way to generate targeted post train…
SWE-INTERACT: Reimagining SWE Benchmarks as User-Driven Long-Horizon Coding Sessions
Mohit Raghavendra, Anisha Gunjal, Aakash Sabharwal +1
We introduce SWE-Interact, a new testbed for evaluating coding agents on multi-turn, interactive, user-driven software engineering tasks. Existing frontier SWE benchmarks typically…
Rubric-Guided Self-Distillation: Post-Training Without Rubric Verifiers
MohammadHossein Rezaei, Anas Mahmoud, Zihao Wang +6
Rubrics have emerged as an alternative to RLVR in open-ended domains where a single ground-truth final answer is not available. Existing rubric-based training methods rely on an LL…