Supriyo Chakraborty
Author directory2026
A History-Aware Visually Grounded Critic for Computer Use Agents
Jaewoo Lee | Zaid Khan | Archiki Prasad | Justin Chen | Supriyo Chakraborty | Kartik Balasubramaniam | Sambit Sahu | Elias Stengel-Eskin | Hyunji Lee | Mohit Bansal
Findings of the Association for Computational Linguistics: EMNLP 2026
Jaewoo Lee | Zaid Khan | Archiki Prasad | Justin Chen | Supriyo Chakraborty | Kartik Balasubramaniam | Sambit Sahu | Elias Stengel-Eskin | Hyunji Lee | Mohit Bansal
Findings of the Association for Computational Linguistics: EMNLP 2026
Various test-time interventions for Computer Use Agents (CUAs), including critic models, have been developed to improve performance through pre-execution action evaluation in complex Graphical User Interface (GUI) environments. However, existing critics suffer from two key limitations: they (1) focus primarily on short-sighted decision loops (e.g., forgetting earlier actions) and (2) lack the visual grounding needed to detect flawed actions (e.g., clicking wrong UI elements). To address these, we introduce HIVIG, a History-aware Visually Grounded test-time framework, built around a multimodal critic trained on real GUI trajectories to abstract past interactions into a compact record and to evaluate actions with visual grounding. At test time, HIVIG integrates the critic into the policy decision loop to provide macro-action history, which summarizes the policy’s completed achievements, and visually grounded critique, which verifies raw execution coordinates against the current screenshot to intercept errors before execution. Across web, mobile, and desktop benchmarks, HIVIG consistently outperforms existing scalar and verbal critics, improving average success rates over the strongest baseline by 5.8% for Qwen3-VL-32B and 9.0% for Gemini-3-Flash, and demonstrates strong cross-platform generalization. Ablations show that macro-action history mitigates short-sighted planning and visually grounded critique reduces execution errors, with both components being critical for test-time scaling in long-horizon GUI tasks.
Routing with Generated Data: Annotation-Free LLM Skill Estimation and Expert Selection
Tianyi Niu | Justin Chen | Genta Indra Winata | Shi-Xiong Zhang | Supriyo Chakraborty | Sambit Sahu | Yue Zhang | Elias Stengel-Eskin | Mohit Bansal
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Tianyi Niu | Justin Chen | Genta Indra Winata | Shi-Xiong Zhang | Supriyo Chakraborty | Sambit Sahu | Yue Zhang | Elias Stengel-Eskin | Mohit Bansal
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large Language Model (LLM) routers dynamically select optimal models for given inputs. Existing approaches typically assume access to ground-truth labeled data, which is often unavailable in practice, especially when user request distributions are heterogeneous and unknown. We introduce Routing with Generated Data (RGD), a challenging setting in which routers are trained exclusively on generated queries and answers produced from high-level task descriptions by generator LLMs. We evaluate query-answer routers (using both queries and labels) and query-only routers across four diverse benchmarks and 12 models, finding that query-answer routers degrade faster than query-only routers as generator quality decreases. Our analysis reveals two crucial characteristics of effective generators: they must accurately respond to their own questions, and their questions must produce sufficient performance differentiation among the model pool. We then show how filtering for these characteristics can improve the quality of generated data. We further propose CASCAL, a novel query-only router that estimates model correctness through consensus voting and identifies model-specific skill niches via hierarchical clustering. CASCAL is substantially more robust to generator quality, outperforming the best query-answer router by 4.6% absolute accuracy when trained on weak generator data.
2025
Training Dynamics Underlying Language Model Scaling Laws: Loss Deceleration and Zero-Sum Learning
Andrei Mircea | Supriyo Chakraborty | Nima Chitsazan | Irina Rish | Ekaterina Lobacheva
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Andrei Mircea | Supriyo Chakraborty | Nima Chitsazan | Irina Rish | Ekaterina Lobacheva
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
This work aims to understand how scaling improves language models, specifically in terms of training dynamics. We find that language models undergo loss deceleration early in training—an abrupt slowdown in the rate of loss improvement, resulting in piecewise linear behaviour of the loss curve in log-log space. Scaling up the model mitigates this transition by (1) decreasing the loss at which deceleration occurs, and (2) improving the log-log rate of loss improvement after deceleration. We attribute loss deceleration to a type of degenerate training dynamics we term zero-sum learning (ZSL). In ZSL, per-example gradients become systematically opposed, leading to destructive interference in per-example changes in loss. As a result, improving loss on one subset of examples degrades it on another, bottlenecking overall progress. Loss deceleration and ZSL provide new insights into the training dynamics underlying language model scaling laws, and could potentially be targeted directly to improve language models independent of scale. We make our code and artefacts available at: https://github.com/mirandrom/zsl