[13] T.-J. Chang and S. Shahrampour. On online optimization: Dynamic regret analysis of strongly convex and smooth problems. Proceedings of the AAAI Conference on Artificial Intelligence, 2021.
[14] X. Chen, Y. Wang, and Y.-X. Wang. Technical note — non-stationary stochastic optimization under lp, q-variation measures. Operations Research, 2018.
[15] C. B. Clement, M. Bierbaum, K. P. O'Keeffe, and A. A. Alemi. On the use of arxiv as a dataset. arXiv preprint arXiv:1905.00075, 2019.
[16] C. Cortes and M. Mohri. Domain adaptation and sample bias correction theory and algorithm for regression. Theoretical Computer Science, 519, 2014.
[17] C. Cortes, Y. Mansour, and M. Mohri. Learning Bounds for Importance Weighting. In Advances in Neural Information Processing Systems (NIPS), 2010.
[18] Y. Cui, M. Jia, T.-Y. Lin, Y. Song, and S. Belongie. Class-balanced loss based on effective number of samples. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9268-9277, 2019.
[19] A. Daniely, A. Gonen, and S. Shalev-Shwartz. Strongly adaptive online learning. In International Conference on Machine Learning, pages 1405-1411, 2015.
[20] D. Donoho and I. Johnstone. Ideal spatial adaptation by wavelet shrinkage. Biometrika, 81(3): 425-455, 1994.
[21] D. Donoho and I. Johnstone. Minimax risk over  $\ell_p$ -balls for  $\ell_q$ -error. Probability Theory and Related Fields, 99(2):277-303, 1994.
[22] D. Donoho, R. Liu, and B. MacGibbon. Minimax risk over hyperrectangles, and implications. Annals of Statistics, 18(3):1416-1437, 1990.
[23] D. L. Donoho and I. M. Johnstone. Minimax estimation via wavelet shrinkage. The annals of Statistics, 26(3):879-921, 1998.
[24] C. Elkan and K. Noto. Learning classifiers from only positive and unlabeled data. In International Conference Knowledge Discovery and Data Mining (KDD), pages 213-220, 2008.
[25] P. Gaillard and S. Gerchinovitz. A chaining algorithm for online nonparametric regression. In Conference on Learning Theory, pages 764-796, 2015.
[26] S. Garg, Y. Wu, S. Balakrishnan, and Z. Lipton. A unified view of label shift estimation. In Advances in Neural Information Processing Systems (NeurIPS), 2020.
[27] S. Garg, Y. Wu, A. Smola, S. Balakrishnan, and Z. Lipton. Mixture proportion estimation and PU learning: A modern approach. In Advances in Neural Information Processing Systems (NeurIPS), 2021.
[28] S. Garg, S. Balakrishnan, and Z. Lipton. Domain adaptation under open set label shift. In Advances in Neural Information Processing Systems (NeurIPS), 2022.
[29] S. Garg, S. Balakrishnan, Z. Lipton, B. Neyshabur, and H. Sedghi. Leveraging unlabeled data to predict out-of-distribution performance. In International Conference on Learning Representations (ICLR), 2022.
[30] S. Garg, N. Erickson, J. Sharpnack, A. Smola, S. Balakrishnan, and Z. Lipton. Rlsbench: Domain adaptation under relaxed label shift. In International Conference on Machine Learning (ICML), 2023.
[31] H. Gjoreski, M. Ciliberto, L. Wang, F. J. O. Morales, S. Mekki, S. Valentin, and D. Roggen. The university of sussex-huawei locomotion and transportation dataset for multimodal analytics with mobile devices. IEEE Access, 6:42592-42604, 2018.