1
Enhancing LLM Safety Through a Theoretical Minimax Game Lens
从博弈论角度破解大模型安全难题，提出理论新框架。
arXiv:2502.05163v2 Announce Type: replace-cross Abstract: The rapid advancement of large language models (LLMs) necessitates effective mechanisms to e…
2
Algorithmic and Minimax Complexities in Kernel Bandits
探究核赌博机问题的算法与极小极大复杂度，理论机器学习新进展
arXiv:2606.11171v1 Announce Type: new Abstract: Gaussian-process upper confidence bound (GP-UCB) and decision-estimation-coefficient (DEC) methods may…