Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory., , , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 151-162. Springer, (2015)Reinforcement Leaning in Feature Space: Matrix Bandit, Kernels, and Regret Bound., and . CoRR, (2019)Online Sub-Sampling for Reinforcement Learning with General Function Approximation., , , and . CoRR, (2021)Misspecified nonconvex statistical optimization for sparse phase retrieval., , , , , and . Math. Program., 176 (1-2): 545-571 (2019)Minimax sample complexity for turn-based stochastic game., and . UAI, volume 161 of Proceedings of Machine Learning Research, page 1496-1504. AUAI Press, (2021)The Physical Systems Behind Optimization Algorithms., , , and . NeurIPS, page 4377-4386. (2018)Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity., , , and . NeurIPS, (2020)Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?, , , and . ICLR, OpenReview.net, (2020)Learning to Control in Metric Space with Optimal Regret., , and . Allerton, page 726-733. IEEE, (2019)Provably Correct SGD-Based Exploration for Generalized Stochastic Bandit Problem., , and . SmartNets, page 1-6. IEEE, (2024)