collaborators

5 papers

cs.DS2026

Minimum eccentricity shortest paths of -minor-free graphs

Dibyayan Chakraborty, Sandip Das, Sk Samim Islam +2

Given a simple, undirected, and unweighted graph , and an integer , the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists…

cs.AI2026

Don't Just Fine-tune the Agent, Tune the Environment

Siyuan Lu, Zechuan Wang, Hongxuan Zhang +5

Large Language Model (LLM) agents show great promise for complex, multi-turn tool-use tasks, but their development is often hampered by the extreme scarcity of high-quality trainin…

cs.AI2026

V2P: Visual Attention Calibration for GUI Grounding via Background Suppression and Center Peaking

Jikai Chen, Long Chen, Dong Wang +6

Precise localization of GUI elements is crucial for the development of GUI agents. Traditional methods rely on bounding box or center-point regression, neglecting spatial interacti…

cs.AI2026

V2P: Visual Attention Calibration for GUI Grounding via Background Suppression and Center Peaking

Jikai Chen, Long Chen, Dong Wang +6

Precise localization of GUI elements is crucial for the development of GUI agents. Traditional methods rely on bounding box or center-point regression, neglecting spatial interacti…

cs.AI2025

SQLCritic: Correcting Text-to-SQL Generation via Clause-wise Critic

Jikai Chen, Leilei Gan, Ziyu Zhao +3

Existing refinement methods in LLM-based Text-to-SQL systems exhibit limited effectiveness. They often introduce new errors during the self-correction process and fail to detect an…