arXiv:2609.21523v1 Announce Type: new
Abstract: A system may be compressed before its downstream task is fully known. We ask how much retained state is then necessary and how much can be saved by lim...
By Ronald Katende
arXiv:2610.20004v1 Announce Type: new
Abstract: Transformers can perform in-context reinforcement learning without parameter updates. However, existing theoretical constructions often require context...
By Yajie Zhao, Yingjun Mo, Zhiyong Wang, Bo Tang, Chao Xu, Fang Kong
arXiv:2610.09577v1 Announce Type: new
Abstract: We study finite-horizon online resource allocation with i.i.d. requests and an endogenous Markov state on a finite state space: each action affects the...
By Zhaohua Chen
arXiv:2608. 16216v1 Announce Type: new Abstract: What is the right delay complexity when a learner can track only $C$ pending feedback items and discarded feedback is permanently lost?
By Anling Xiang, Yuwen Yang, Yang Shen
arXiv:2607. 26273v1 Announce Type: new Abstract: We consider a stochastic multi-objective bandit problem where, at each round, the agent selects a slate of $k$ arms and observes their $d$-dimensional reward vectors under semi-bandit feedback.
By Nicolas Gutowski, Fabien Chhel, Alexandre Letard, Sylvain Lamprier
arXiv:2607. 11146v1 Announce Type: new Abstract: We study the coupled objective J_K^WOR = E_{S ~ PL-WOR_K}[max_{i in S} R_i]: the expected maximum reward of a size-K Plackett-Luce draw without replacement, the law of Gumbel-Top-K / Stochastic Beam Search decoding.
By Melveena Jolly, Midhun Xavier