Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Aadirupa Saha, Nagarajan Natarajan, Praneeth Netrapalli, Prateek Jain 0002. Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization. In Marina Meila, Tong Zhang 0001, editors, Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event. Volume 139 of Proceedings of Machine Learning Research, pages 9255-9264, PMLR, 2021. [doi]

This author has not been identified. Look up 'Aadirupa Saha' in GoogleThis author has not been identified. Look up 'Nagarajan Natarajan' in GoogleThis author has not been identified. Look up 'Praneeth Netrapalli' in GoogleThis author has not been identified. Look up 'Prateek Jain 0002' in Google

runs on WebDSL