No-Regret M-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting

Taihei Oki, Hokkaido University, Hokkaido, Japan, oki@icredd.hokudai.ac.jp "3026 Shinsaku Sakaue[1], The University of Tokyo and RIKEN AIP, Tokyo, Japan, sakaue@mist.i.u-tokyo.ac.jp

Oct-10-2025, 04:59:07 GMT–Neural Information Processing Systems 

[no summary]