- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
this paper introduces T-REX, a training-free binder design framework that orchestrates diverse generative models under an efficient compute budget. It interprets campaign evidence via three strategies: rescue, explore and exploit. the In-silico experiments show it tops deduplicated hits on all 7 targets under matched budgets, outperforming PUCT and the strongest generator-only baseline per target.
Critical strengths
T-REX has a carefully tailored harness for novel protein binder design, including four failure mode, three allocation priorities, and gpu allocation for effectiveness execution. which well track the evidence such as evidence summary, campaign states.
the experimental gains are significant compare with generator-only baselines, rule-based controllers, and tree-search controllers.
the paper is well written, appendix includes sufficient details, and the figure presentations are look good.
Critical weaknesses
it is well established that tool + LLM planning alone boosts performance. baselines are narrow without peer agentic comparisons such as autoBinder, the claude Science autonomous binder, or recent OpenAI bio agents/skills, nor a generic coding agent as a resource allocator. without these, the marginal value of T-REX's LLM orchestration over tool-using planning alone remains unclear. notably, given the strong capability of current coding agents, it remains unclear whether they could directly plan and allocate jobs to solve the same campaign without T-REX-style harness.
Questions for authors
no token cost for orchestration planning nor module-level effectiveness, leaving the efficiency claim unconvincing.
ablations do not cover other llm model (only qwen3.6-27b)
7 comments
[Q1] Token costs and module-level effectiveness
We have expanded our cost analysis to include both token-based LLM inference costs and the full cost of dedicated GPU serving (see our response to Reviewer VK4s, [W3]; SI Section E.5.1, Tables S12 and S25). Even when charging the full LLM-server reservation, T-ReX retains its throughput advantage over all baselines, with geometric-mean improvements of 1.82× over PUCT and 1.90× over the strongest generator-only baseline.
Regarding module-level effectiveness, our Rescue-priority ablation examines the contribution of explicitly identifying and recovering from stalled design campaigns. Removing Rescue increased the fraction of compute spent in stalled states from 3.8% to 27.7%, demonstrating the importance of using structured failure information to guide subsequent design decisions.
[Q2] Generalization to other LLMs
Following the reviewer’s suggestion, we additionally evaluated T-ReX with Claude Sonnet 5.5, replacing Qwen3.6-27B while retaining the same framework and 50-worker-GPU-hour budget on CD45 (SI Section E.5.3, Table S26).
| Framework | LLM | Seed 0 | Seed 1 | Mean | LLM token cost ($ per run, mean) | Cost per SU ($) |
|---|---|---|---|---|---|---|
| T-REX | Qwen3.6-27B | 139 | 141 | 140 | 2.34 | 1.69 |
| T-REX | Claude Sonnet 5.5 | 128 | 104 | 116 | 51.81 | 2.47 |
| Claude campaign | Claude Sonnet 5.5 | 143 | 70 | 106.5 | 22.99 | 2.42 |
Cost per SU = (50 GPU-h x $4.69 + LLM token cost) / SU, pooled over the two seeds; token prices as in [W1].
These results demonstrate that T-ReX can successfully operate with different underlying LLMs, although performance varies with the model. Our primary contribution is the agentic campaign-control framework rather than a comparison of LLM capabilities. A systematic evaluation across LLM architectures and scales is beyond the scope of this work, but represents an interesting direction for future research, particularly as LLM reasoning capabilities continue to improve.
thanks author for the carefully responses, which address some of my concerns; while the author also acknowledge and include more baseline and experiments, this is good helping readers to fairly understand the gains. and it looks T-Rex is more efficient. while my concerns are still on the significance and innovation between T-Rex and existing agents solutions. thus I maintain my original rating.
We thank the reviewer for their positive assessment of T-ReX, particularly recognizing T-REX's carefully tailored design, the significant improvements over existing baselines, and the clarity of the paper and appendix. We appreciate the constructive suggestions and have conducted additional experiments to address the reviewer's concerns.
[W1] Comparison with additional agentic baselines
Thanks for the suggestion. We agree that comparisons with general-purpose agentic systems are valuable for understanding the contribution of the T-REX's structured framework. As the reviewer suggested, we implemented an additional baseline based on the Claude Code autonomous binding-design campaign protocol [1]. We note that the Claude binder-design campaign used has a substantially larger compute budget (~$10k per target, roughly 2,500 H100-hours). For a fair comparison, we adapted the protocol to match T-ReX's design objective, target, available design methods, and compute budget, removing platform-specific services such as Slack, cloud-account integration, and external databases. We evaluated both approaches on CD45 using a budget of 50 worker GPU-hours across two random seeds (Section 3.1; SI Section E.5.2, Table S26).
We evaluated the Claude campaign protocol with two LLMs: Qwen3.6-27B, the same model used by T-ReX, to compare the campaign-control frameworks, and Claude Sonnet 5.5, to evaluate the performance of a frontier LLM agent.
Cost per SU = (50 worker GPU-h x $4.69 + LLM token cost) / SU, pooled over the two seeds (CD45; LLM via API).
For the token price, Qwen 3.6-27B is $0.25 / $2.00 per M input/output tokens while Claude Sonnet 5.5 is $2 / $10 per M input/output tokens.
With the same underlying LLM, T-ReX produced 1.57× more structurally unique designs on average than the adapted Claude campaign protocol. We also observed substantially lower GPU idle time (3%/6% versus 23%/17% across the two seeds), demonstrating the benefit of separating LLM-guided planning from deterministic job scheduling.
Notably, T-ReX achieves these results using the open-weight Qwen3.6-27B model. Even when using the more expensive frontier model Claude Sonnet 5.5, the Claude campaign produced fewer SUs on average (106.5 versus 140), although it slightly outperformed T-ReX in one seed. These results suggest that a specialized campaign-control framework can achieve competitive or better performance without relying on a frontier LLM.
We also appreciate the reference to AutoBinder Agent [2]. AutoBinder automates a predefined design pipeline (MaSIF → Rosetta grafting → ProteinMPNN → AlphaFold3), whereas T-ReX adaptively allocates compute across multiple design methods. Since AutoBinder does not report a comparable compute-constrained binder-design benchmark, a quantitative comparison is not currently possible. We will discuss this work in our revised related-work section.
References
[1] Claude Science and A. Shanehsazzadeh, "Autonomous de novo protein binder design with Claude," Anthropic technical report, August 2026.
[2] Ge et al., "AutoBinder Agent: An MCP-Based Agent for End-to-End Protein Binder Design," arXiv:2602.00019 (2026).