Summary of Formal Theorem Proving by Rewarding Llms to Decompose Proofs Hierarchically, By Kefan Dong et al.
Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchicallyby Kefan Dong, Arvind Mahankali, Tengyu…
Formal Theorem Proving by Rewarding LLMs to Decompose Proofs Hierarchicallyby Kefan Dong, Arvind Mahankali, Tengyu…
GITSR: Graph Interaction Transformer-based Scene Representation for Multi Vehicle Collaborative Decision-makingby Xingyu Hu, Lijun Zhang,…
Diversity Progress for Goal Selection in Discriminability-Motivated RLby Erik M. Lintunen, Nadia M. Ady, Christian…
Exploring the Edges of Latent State Clusters for Goal-Conditioned Reinforcement Learningby Yuanlin Duan, Guofeng Cui,…
Learning Hidden Subgoals under Temporal Ordering Constraints in Reinforcement Learningby Duo Xu, Faramarz FekriFirst submitted…
Two-Timescale Model Caching and Resource Allocation for Edge-Enabled AI-Generated Content Servicesby Zhang Liu, Hongyang Du,…
Task-Aware Harmony Multi-Task Decision Transformer for Offline Reinforcement Learningby Ziqing Fan, Shengchao Hu, Yuhang Zhou,…
Prompt Tuning with Diffusion for Few-Shot Pre-trained Policy Generalizationby Shengchao Hu, Wanru Zhao, Weixiong Lin,…
Birdie: Advancing State Space Models with Reward-Driven Objectives and Curriculaby Sam Blouir, Jimmy T.H. Smith,…
Mechanistic Interpretability of Reinforcement Learning Agentsby Tristan Trim, Triston GraystonFirst submitted to arxiv on: 30…