Large-scale search and recommendation systems routinely run online experiments for ranking models, feed policies, user-interface treatments, and ad/recommendation blending strategies. These launches are rarely single-metric decisions: teams often need to improve click-through rate, conversion, dwell time, retention, or...
Zi-Long Wang, Peng-Lei Zhao, Fang-yuan Kong et al.· Proceedings of the 35th ACM...· 0 citations
Long-term LLM assistants must repeatedly decide what prior context to expose and which model should answer as an interaction evolves. Existing memory systems and model routers usually make these decisions separately, although memory construction changes the evidence, distractors, and difficulty of the resulting input....
Ming-Han Wang, Jin-Hang Zuo, Zhong-Xiang Dai et al.· 0 citations
Transformers can implement reinforcement-learning algorithms in context, yet how off-policy control emerges within Transformers remains poorly understood. We study Q-learning, a foundational model-free control algorithm that combines off-policy bootstrapping with greedy policy improvement. We prove that a two-layer att...
A unified algorithmic framework featuring two algorithms: MIN-UCB-VI for regret minimization and MAX-LCB-VI for best policy identification for best policy identification is proposed, including both instance-dependent and independent upper bounds on regret and sub-optimality gap.
This work proposes an offline-to-online combinatorial experts selection (CES) framework that leverages offline evaluation to warm-start model capability estimation and employs online learning to adapt to capability shifts and correct offline inaccuracies.
Jinkun Xu, Minghan Wang, Zhiyong Wang 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.