[7] Char, I., Chung, Y., Neiswanger, W., Kandasamy, K., Nelson, A. O., Boyer, M., Kolemen, E., and Schneider, J. (2019). Offline contextual bayesian optimization. Advances in Neural Information Processing Systems (NeurIPS), 32.
[8] Chowdhury, S. R. and Gopalan, A. (2017). On kernelized multi-armed bandits. In International Conference on Machine Learning (ICML), page 844–853.
[9] Chowdhury, S. R. and Gopalan, A. (2021). No-regret algorithms for multi-task bayesian optimization. In International Conference on Artificial Intelligence and Statistics (AISTATS), pages 1873-1881.
[10] Ciliberto, C., Rosasco, L., and Villa, S. (2015). Learning multiple visual tasks while discovering their structure. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 131-139.
[11] Collobert, R. and Weston, J. (2008). A unified architecture for natural language processing: Deep neural networks with multitask learning. In International Conference on Machine learning (ICML), pages 160-167.
[12] Dekel, O., Long, P. M., and Singer, Y. (2007). Online learning of multiple tasks with a shared loss. Journal of Machine Learning Research, 8(10).
[13] Evgeniou, T., Micchelli, C. A., Pontil, M., and Shawe-Taylor, J. (2005). Learning multiple tasks with kernel methods. Journal of Machine Learning Research, 6(4).
[14] Harutyunyan, H., Khachatrian, H., Kale, D. C., Ver Steeg, G., and Galstyan, A. (2019). Multitask learning and benchmarking with clinical time series data. Scientific data, 6(1):96.
[15] Jain, G., Sharma, M., and Agarwal, B. (2019). Spam detection in social media using convolutional and long short term memory neural network. Annals of Mathematics and Artificial Intelligence, 85(1):21-44.
[16] Kairouz, P., McMahan, H. B., Avent, B., Bellet, A., Dennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., et al. (2021). Advances and open problems in federated learning. Foundations and Trends® in Machine Learning, 14(1-2):1-210.
[17] Krause, A. and Ong, C. (2011). Contextual Gaussian process bandit optimization. Advances in Neural Information Processing Systems (NeurIPS), 24.
[18] Li, X., Mehta, V., Kirschner, J., Char, I., Neiswanger, W., Schneider, J., Krause, A., and Bogunovic, I. (2023). Near-optimal policy identification in active reinforcement learning. International Conference on Learning Representations (ICRL).
[19] Liu, S., Johns, E., and Davison, A. J. (2019). End-to-end multi-task learning with attention. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 1871-1880.
[20] Lugosi, G., Papaspiliopoulos, O., and Stoltz, G. (2009). Online multi-task learning with hard constraints. In Conference on Learning Theory (COLT).
[21] Maurer, A., Pontil, M., and Romero-Paredes, B. (2016). The benefit of multitask representation learning. Journal of Machine Learning Research, 17(81):1-32.
[22] Pacchiano, A., Dann, C., Gentile, C., and Bartlett, P. L. (2020). Regret bound balancing and elimination for model selection in bandits and r1. ArXiv, abs/2012.13045.
[23] Settles, B. (2009). Active learning literature survey. Technical report, University of Wisconsin-Madison Department of Computer Sciences.
[24] Sheldon, D. (2008). Graphical multi-task learning. Technical report, Cornell University, Ithaca, NY.
[25] Srinivas, N., Krause, A., Kakade, S., and Seeger, M. (2010). Gaussian process optimization in the bandit setting: No regret and experimental design. In International Conference on Machine Learning (ICML).