arXiv AI By Zonglin Han (Department of Computer Science, University of California, Davis), Yichen Chen (Department of Computer Science, University of California, Davis), Jiawen Jiang (International Digital Economy College, Minjiang University), Tongan Shi (School of Computer Science and Artificial Intelligence, Liaoning Normal University), Kristian A. Stevens (Department of Computer Science, University of California, Davis)

Stochasticity Is Not the Hard Part: Reduction and Complexity in Instructional Sequencing over Prerequisite DAGs

Read the original on arXiv AI →

arXiv:2608. 05455v1 Announce Type: new Abstract: When a student must learn concepts connected by prerequisite dependencies, when does the order of instruction matter, and what does it cost to find the best one?

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv AI.

arXiv Machine Learning
Jul 30

Early Verdicts, Better Budgets: Sequential Adaptive Rollout Allocation for Compute-Efficient RLVR

arXiv:2607. 26253v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards (RLVR) is bottlenecked by rollout generation, yet many sampled prompts produce saturated groups (all responses correct or all incorrect) whose zero reward variance yields no policy-gradient signal.

By Pixel Nomand, Elena Voss, Marcus Hale, Sofia Reyes
arXiv Machine Learning
Aug 3

Parameter-Free Heavy-Tailed Bandits

arXiv:2607. 29460v1 Announce Type: new Abstract: Heavy-tailed distributions arise naturally in sequential decision-making problems such as financial investment, online advertising, and network management, where rare but extreme outcomes can dominate performance.

By Gianmarco Genalti, Alberto Maria Metelli