Feasible Action Search for Bandit Linear Programs via Thompson Sampling. Gangrade, A., Pacchiano, A., Scott, C., & Saligrama, V. In Singh, A., Fazel, M., Hsu, D., Lacoste-Julien, S., Berkenkamp, F., Maharaj, T., Wagstaff, K., & Zhu, J., editors, Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, volume 267, of Proceedings of Machine Learning Research, 2025. PMLR / OpenReview.net.
Feasible Action Search for Bandit Linear Programs via Thompson Sampling [link]Paper  bibtex   
@inproceedings{DBLP:conf/icml/GangradePSS25,
  author       = {Aditya Gangrade and
                  Aldo Pacchiano and
                  Clayton Scott and
                  Venkatesh Saligrama},
  editor       = {Aarti Singh and
                  Maryam Fazel and
                  Daniel Hsu and
                  Simon Lacoste{-}Julien and
                  Felix Berkenkamp and
                  Tegan Maharaj and
                  Kiri Wagstaff and
                  Jerry Zhu},
  title        = {Feasible Action Search for Bandit Linear Programs via Thompson Sampling},
  booktitle    = {Forty-second International Conference on Machine Learning, {ICML}
                  2025, Vancouver, BC, Canada, July 13-19, 2025},
  series       = {Proceedings of Machine Learning Research},
  volume       = {267},
  publisher    = {{PMLR} / OpenReview.net},
  year         = {2025},
  url          = {https://proceedings.mlr.press/v267/gangrade25a.html},
  timestamp    = {Wed, 04 Feb 2026 16:54:16 +0100},
  biburl       = {https://dblp.org/rec/conf/icml/GangradePSS25.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0