{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:50Z","timestamp":1777954610717,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743344","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"618-622","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Stochastic Parallel Scheduling with Bandit Feedback"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0024-0026","authenticated-orcid":false,"given":"Gerdus","family":"Benad\u00e8","sequence":"first","affiliation":[{"name":"Boston University, Boston, Massachusetts, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2416-6422","authenticated-orcid":false,"given":"Rathish","family":"Das","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, Texas, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7874-1908","authenticated-orcid":false,"given":"Thomas","family":"Lavastida","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, Richardson, Texas, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. In 21st Annual Conference on Learning Theory - COLT 2008","author":"Abernethy Jacob D.","year":"2008","unstructured":"Jacob D. Abernethy, Elad Hazan, and Alexander Rakhlin. 2008. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. In 21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, July 9-12, 2008. Omnipress, 263--274. http:\/\/colt2008.cs.helsinki.fi\/papers\/127-Abernethy.pdf"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2312.15427"},{"key":"e_1_3_2_1_3_1","volume-title":"Towards Minimax Policies for Online Linear Optimization with Bandit Feedback. In COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland (JMLR Proceedings","volume":"41","author":"Bubeck S\u00e9bastien","unstructured":"S\u00e9bastien Bubeck, Nicol\u00f2 Cesa-Bianchi, and Sham M. Kakade. 2012. Towards Minimax Policies for Online Linear Optimization with Bandit Feedback. In COLT 2012 - The 25th Annual Conference on Learning Theory, June 25-27, 2012, Edinburgh, Scotland (JMLR Proceedings, Vol. 23), Shie Mannor, Nathan Srebro, and Robert C. Williamson (Eds.). JMLR.org, 41.1--41.14. http:\/\/proceedings.mlr.press\/v23\/bubeck12a\/bubeck12a.pdf"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JCSS.2012.01.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00116"},{"key":"e_1_3_2_1_7_1","volume-title":"Advances in Neural Information Processing Systems","volume":"20","author":"Dani Varsha","year":"2007","unstructured":"Varsha Dani, Sham M Kakade, and Thomas Hayes. 2007. The Price of Bandit Information for Online Optimization. In Advances in Neural Information Processing Systems, Vol. 20. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2007\/file\/bf62768ca46b6c3b5bea9515d1a1fc45-Paper.pdf"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-7801-0_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/AAAI.V33I01.33011885"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.18"},{"key":"e_1_3_2_1_11_1","volume-title":"International Conference on Machine Learning, ICML 2022","volume":"7403","author":"Gergatsouli Evangelia","year":"2022","unstructured":"Evangelia Gergatsouli and Christos Tzamos. 2022. Online Learning for Min Sum Set Cover and Pandora's Box. In International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Proceedings of Machine Learning Research, Vol. 162). PMLR, 7382--7403. https:\/\/proceedings.mlr.press\/v162\/gergatsouli22a.html"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.83"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.2019.0999"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Ito Shinji","year":"2019","unstructured":"Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, and Ken-Ichi Kawarabayashi. 2019. Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. In Advances in Neural Information Processing Systems, Vol. 32. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2019\/file\/e6385d39ec9394f2f3a354d9d2b88eec-Paper.pdf"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258661"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020","volume":"5670","author":"Lattimore Tor","year":"2020","unstructured":"Tor Lattimore, Csaba Szepesv\u00e1ri, and Gell\u00e9rt Weisz. 2020. Learning with Good Feature Representations in Bandits and in RL with a Generative Model. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event (Proceedings of Machine Learning Research, Vol. 119). PMLR, 5662--5670. http:\/\/proceedings.mlr.press\/v119\/lattimore20a.html"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"e_1_3_2_1_19_1","volume-title":"Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021","author":"Lee Dabeen","year":"2021","unstructured":"Dabeen Lee and Milan Vojnovic. 2021. Scheduling jobs with stochastic holding costs. In Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual, Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, and Jennifer Wortman Vaughan (Eds.). 19375--19384. https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/a19744e268754fb0148b017647355b7b-Abstract.html"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538579"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29116-6_3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.1060.0201"},{"key":"e_1_3_2_1_23_1","volume-title":"On Preemption and Learning in Stochastic Scheduling. In International Conference on Machine Learning, ICML 2023","volume":"24516","author":"Merlis Nadav","year":"2023","unstructured":"Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, and Vianney Perchet. 2023. On Preemption and Learning in Stochastic Scheduling. In International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Proceedings of Machine Learning Research, Vol. 202), Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, and Jonathan Scarlett(Eds.). PMLR, 24478--24516. https:\/\/proceedings.mlr.press\/v202\/merlis23a.html"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331530"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.20.2.257"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.12.9.707"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/MOOR.1100.0446"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702415007"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000068"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-60924-4_18"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248591"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2774187.2774188"},{"key":"e_1_3_2_1_33_1","volume-title":"Linear Bandit Algorithms with Sublinear Time Complexity. In International Conference on Machine Learning, ICML 2022","volume":"25260","author":"Yang Shuo","year":"2022","unstructured":"Shuo Yang, Tongzheng Ren, Sanjay Shakkottai, Eric Price, Inderjit S. Dhillon, and Sujay Sanghavi. 2022. Linear Bandit Algorithms with Sublinear Time Complexity. In International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Proceedings of Machine Learning Research, Vol. 162). PMLR, 25241--25260. https:\/\/proceedings.mlr.press\/v162\/yang22m.html"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743344","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:20:34Z","timestamp":1777922434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":33,"alternative-id":["10.1145\/3694906.3743344","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743344","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}