Author of the publication

Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization.

, , , , , and . Proc. VLDB Endow., 14 (10): 1756-1768 (2021)

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

Efficient Pure Exploration in Adaptive Round model., , , and . NeurIPS, page 6605-6614. (2019)Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits., , , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 5065-5073. PMLR, (2021)Optimal Streaming Algorithms for Multi-Armed Bandits., , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 5045-5054. PMLR, (2021)Maximizing the Effect of Information Adoption: A General Framework., , , , , and . SDM, page 693-701. SIAM, (2018)Double Explore-then-Commit: Asymptotic Optimality and Beyond., , , and . COLT, volume 134 of Proceedings of Machine Learning Research, page 2584-2633. PMLR, (2021)Thompson Sampling with Less Exploration is Fast and Optimal., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 15239-15261. PMLR, (2023)A Markov Chain Monte Carlo Approach for Source Detection in Networks., , , , , and . SMP, volume 774 of Communications in Computer and Information Science, page 77-88. Springer, (2017)Best Arm Identification with Minimal Regret., , and . CoRR, (2024)MOTS: Minimax Optimal Thompson Sampling., , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 5074-5083. PMLR, (2021)Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization., , , , , and . Proc. VLDB Endow., 14 (10): 1756-1768 (2021)