TAG
#curriculum
0 reviews · 2 essays
Related essays
Kelidari et al.: A Card-Game Agent Is Only as Strong as the Yardstick You Build First — Fukai Reads
An arXiv preprint by Nima Kelidari and two co-authors, under submission to AIIDE 2026. Using Gin Rummy and a hand-written fixed expert as an immovable yardstick, they run more than a hundred controlled experiments on what makes a lightweight reinforcement learning agent strong. Win-rate against the expert is 15.0% for PPO, 22.5% for TRPO and 34.2±2.1% with every working ingredient stacked; swapping network shapes leaves win-rates overlapping, while a search that can see the hidden cards reaches 85% against 26% for one that cannot.
Han et al.: Sorting Out When Learning Order Matters, by Computational Complexity — Fukai Reads
A paper by Han and four colleagues at UC Davis and partner institutions on the computational complexity of instructional sequencing. They formalise the ordering of prerequisite-linked concepts as a stochastic shortest-path problem, prove that the stochasticity of retry-after-failure collapses exactly by dividing cost by success probability, show that optimal ordering nonetheless remains NP-hard, and give a cheap diagnostic that upper-bounds the value of sequencing before any optimisation. On 70,893 real interactions from an introductory CS course that headroom was under 0.2%, while on a constructed trap greedy sequencing lost 28.3-45.1%. arXiv preprint, submitted 5 August 2026, not peer reviewed.
