{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:38Z","timestamp":1750220018803,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2022,3,22]]},"abstract":"<jats:p>Several applications in online learning involve sequential sampling\/polling of an underlying population. A classical learning task in this space is online cardinality estimation, where the goal is to estimate the size of a set by sequential sampling of elements from the set (see, for example, [2,4,7]). The key idea here is to use 'collisions,' i.e., instances where the same element is sampled more than once, to estimate the size of the set. Another recent application is community exploration, where the goal of the learning agent is to sample as many distinct elements as possible, given a family of sampling distributions\/domains to poll from (see [3, 6]).<\/jats:p>","DOI":"10.1145\/3529113.3529135","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T22:30:42Z","timestamp":1648247442000},"page":"63-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sequential community mode estimation"],"prefix":"10.1145","volume":"49","author":[{"given":"Shubham","family":"Anand Jain","sequence":"first","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreyas","family":"Goenka","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divyam","family":"Bapna","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayakrishnan","family":"Nair","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"COLT - Conference on Learning Theory","author":"Audibert J.-Y.","year":"2010","unstructured":"J.-Y. Audibert and S. Bubeck . Best Arm Identification in Multi-Armed Bandits . In COLT - Conference on Learning Theory , 2010 . J.-Y. Audibert and S. Bubeck. Best Arm Identification in Multi-Armed Bandits. In COLT - Conference on Learning Theory, 2010."},{"key":"e_1_2_1_2_1","volume-title":"Simple set cardinality estimation through random sampling. arXiv preprint arXiv:1512.07901","author":"Bressan M.","year":"2015","unstructured":"M. Bressan , E. Peserico , and L. Pretto . Simple set cardinality estimation through random sampling. arXiv preprint arXiv:1512.07901 , 2015 . M. Bressan, E. Peserico, and L. Pretto. Simple set cardinality estimation through random sampling. arXiv preprint arXiv:1512.07901, 2015."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502599"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.871973"},{"key":"e_1_2_1_5_1","volume-title":"Conference on Learning Theory","author":"Carpentier A.","year":"2016","unstructured":"A. Carpentier and A. Locatelli . Tight (lower) bounds for the fixed budget best arm identification bandit problem . In Conference on Learning Theory , 2016 . A. Carpentier and A. Locatelli. Tight (lower) bounds for the fixed budget best arm identification bandit problem. In Conference on Learning Theory, 2016."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems","author":"Chen X.","year":"2018","unstructured":"X. Chen , W. Huang , W. Chen , and J. C. Lui . Community exploration: from offline optimization to online learning . In Proceedings of the 32nd International Conference on Neural Information Processing Systems , 2018 . X. Chen, W. Huang, W. Chen, and J. C. Lui. Community exploration: from offline optimization to online learning. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, 2018."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-7152(97)00146-6"},{"key":"e_1_2_1_8_1","volume-title":"Performance Evaluation","author":"Jain S. A.","year":"2021","unstructured":"S. A. Jain , S. Goenka , D. Bapna , N. Karamchandani , and J. Nair . Sequential community mode estimation . Performance Evaluation , 2021 . S. A. Jain, S. Goenka, D. Bapna, N. Karamchandani, and J. Nair. Sequential community mode estimation. Performance Evaluation, 2021."},{"key":"e_1_2_1_9_1","volume-title":"International Conference on Machine Learning","author":"Karnin Z.","year":"2013","unstructured":"Z. Karnin , T. Koren , and O. Somekh . Almost optimal exploration in multi-armed bandits . In International Conference on Machine Learning , 2013 . Z. Karnin, T. Koren, and O. Somekh. Almost optimal exploration in multi-armed bandits. In International Conference on Machine Learning, 2013."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946646"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529135","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529113.3529135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:25Z","timestamp":1750182685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3,22]]}},"alternative-id":["10.1145\/3529113.3529135"],"URL":"https:\/\/doi.org\/10.1145\/3529113.3529135","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"2022-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}