Deterministic verifiers make test-time optimization of large language model (LLM) outputs practical, but modern search pipelines still waste budget on candidates that are structurally ineligible for semantic evaluation. Ineligibility includes parse failures, schema violations, and dependency breaks. These dead-on-arriv...
Rui Li, Shuang Cao· IEEE Transactions on Pattern...· 0 citations
This work presents Evolutionary Self-Debugging Agents (ESDA), which mines tool traces into structured failure signatures and uses them to maintain a strategy bank of reusable debugging policies, and analyze transfer across languages and build systems and finds that mining failure signatures yields consistent gains unde...
Shuang Cao, Rui Li· Proceedings of the 32nd ACM...· 0 citations
A Aegis scheduler is presented, a scheduler that adapts placement using live fabric telemetry under operator-defined contracts that reduces service p99 RPC latency, cuts SLO violations, and lowers ECN mark rate while improving utilization under production-derived workloads.
Rui Li, Shuang Cao· Conference on Applications,...· 0 citations
Repository-level code repair generates rich tool traces, but most LLM agents discard this data and keep restarting from a fixed debugging loop. We present Evolutionary Self-Debugging Agents (ESDA), which mines tool traces into structured failure signatures and uses them to maintain a strategy bank of reusable debugging...
Shuang Cao, Rui Li· Proceedings of the 32nd ACM...· 0 citations
Contract-checked graph editing is proposed : represent each candidate as an interface-typed reasoning DAG and validate every nontrivial edit with a deterministic structural gate (acyclicity, namespace closure, schema validity, terminal constraints) before invoking the verifier.
Rui Li, Shuang Cao· Annual Meeting of the Associ...· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
