The Branch Aggregation Lemma shows that branch-weighted tree statistics recover chain expectations when branch choices and weights are fixed before outgoing transitions are sampled, and bound the gradient bias from adaptive expansion and show that max backup assigns prefix credit to actions leading to better discovered...
Jun-Yu Lu, Shi-Chao Weng, Zhi-Qiang Wang et al.· 0 citations
This work identifies what must be preserved beyond the replaced value when using a KV cache as updatable memory and recovers distinctions missed by fixed cache similarities on synthetic record pairs.
Chang-Hai Zhou, Yu-Hua Zhou, Shi-Yang Zhang et al.· 0 citations
This paper introduces Caduceus, a family of MoE-enhanced foundation models built with a hierarchical pre-training paradigm to jointly integrate biological and natural language, and incorporates a multi-task instruction tuning phase, enabling robust protein parsing and natural language question answering.
Ming-Ze Yin, Yiheng Zhu, Jialu Wu et al.· Proceedings of the 32nd ACM...· 1 citation
This work presents LongStraw, an objective-aware, architecture-aware system for resident-state virtualization, response replay, and distributed-gradient execution that bounds the live training graph by the response suffix while reusing the expensive prompt computation across the complete GRPO group.
This paper introduces Caduceus, a family of MoE-enhanced foundation models built with a hierarchical pre-training paradigm to jointly integrate biological and natural language, and incorporates a multi-task instruction tuning phase, enabling robust protein parsing and natural language question answering.
Mingze Yin, Yiheng Zhu, Jialu Wu et al.· Proceedings of the 32nd ACM...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.