SlowGuess/NeurIPS_2023_OCR huggingface dataset:
Wangli Xu is the corresponding author of this paper. The majority of this work was done when the first author was a postdoc in Renmin University of China. At the time the paper was accepted, the first author was with Inspur (Beijing) Electronic Information Industry Co., Ltd. This work was supported by Beijing Natural Science Foundation (No Z200001), National Natural Science Foundation of China (No 11971478), and by Public Health & Disease Control and Prevention, Major Innovation & Planning Interdisciplinary Platform for the "Double-First Class" Initiative, Renmin University of China (No. 2023PDPC), and the MOE Project of Key Research Institute of Humanities and Social Sciences (No. 22JJD910001).
D. C. Ahfock, W. J. Astle, and S. Richardson. Statistical properties of sketching algorithms. Biometrika, 108(2):283-297, jul 2021.
D. E. Barton and D. J. Casley. A quick estimate of the regression coefficient. Biometrika, 45(3-4): 431-435, 1958.
Q. Cheng, H. Wang, and M. Yang. Information-based optimal subdata selection for big data logistic regression. Journal of Statistical Planning and Inference, 209:112-122, 2020.
E. Dobriban and S. Liu. Asymptotics for sketching in least squares regression. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d' Alché-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019.
P. Drineas and M. W. Mahoney. RandNLA. Communications of the ACM, 59(6):80-90, may 2016.
R. W. Floyd and R. L. Rivest. Algorithm 489: The algorithm selects for finding the  $i$ th smallest of  $n$  elements [m1]. Communications of the ACM, 18(3):173, Mar. 1975.
W. Lin, Z. He, and M. Xiao. Balanced clustering: A uniform model and fast algorithm. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pages 2987-2993. International Joint Conferences on Artificial Intelligence Organization, 7 2019.
P. Ma, M. W. Mahoney, and B. Yu. A statistical perspective on algorithmic leveraging. Journal of Machine Learning Research, 16(27):861-911, 2015.
P. Ma, X. Zhang, X. Xing, J. Ma, and M. Mahoney. Asymptotic analysis of sampling estimators for randomized numerical linear algebra algorithms. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, pages 1026-1035, Online, 2020.
M. W. Mahoney. Randomized algorithms for matrices and data. Foundations and Trends® in Machine Learning, 3(2):123-224, 2010.
M. Paterson. Progress in selection. In Algorithm Theory — SWAT'96, pages 368-379, 1996.
M. Pilanci and M. J. Wainwright. Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares. Journal of Machine Learning Research, 17:1-38, 2016.
G. Raskutti and M. W. Mahoney. A statistical perspective on randomized sketching for ordinary least-squares. Journal of Machine Learning Research, 17:1-31, 2016.
H. Wang. Divide-and-conquer information-based optimal subdata selection algorithm. Journal of Statistical Theory and Practice, 13(3):1-19, 2019.
H. Wang, M. Yang, and J. Stufken. Information-based optimal subdata selection for big data linear regression. Journal of the American Statistical Association, 114(525):393-405, 2019.
J. Wang, J. D. Lee, M. Mahdavi, M. Kolar, and N. Srebro. Sketching meets random projection in the dual: A provable recovery algorithm for big and high-dimensional data. Electronic Journal of Statistics, 11(2):4896-4944, 2017.
D. P. Woodruff. Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science, 10(1-2):iv+157, 2014.