On statistics, computation and scalability

Bernoulli

Volumn 19, Issue 4, 2013, Pages 1378-1390

  Jordan, Michael I ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885041315     PISSN: 13507265     EISSN: None     Source Type: Journal    
DOI: 10.3150/12-BEJSP17     Document Type: Article

References (15)

1. Agarwal, A., Duchi, J., Bartlett, P. and Levrard, C. (2011). Oracle inequalities for computationally budgeted model selection. In 24th Annual Conference on Learning Theory, Budapest, Hungary.
2. Amini, A.A. and Wainwright, M.J. (2009). High-dimensional analysis of semidefinite relaxations for sparse principal components. Ann. Statist. 37 2877-2921. MR2541450
3. Bickel, P.J., Götze, F. and van Zwet, W.R. (1997). Resampling fewer than n observations: Gains, losses, and remedies for losses. Statist. Sinica 7 1-31. Empirical Bayes, sequential analysis and related topics in statistics and probability (New Brunswick, NJ, 1995). MR1441142
4. Candès, E.J. and Plan, Y. (2010). Matrix completion with noise. Proceedings of the IEEE 98 25-936.
5. Chandrasekaran, V. and Jordan, M.I. (2013). Computational and statistical tradeoffs via convex relaxation. Proc. Natl. Acad. Sci. USA 13 E1181-E1190.
6. Chen, X. and Xie, M. (2012). A split-and-conquer approach for analysis of extraordinarily large data. Technical Report 2012-01, Dept. Statistics, Rutgers Univ.
7. Donoho, D.L. and Johnstone, I.M. (1998). Minimax estimation via wavelet shrinkage. Ann. Statist. 26 879-921. MR1635414
8. Efron, B. (1979). Bootstrap methods: Another look at the jackknife. Ann. Statist. 7 1-26. MR0515681
9. Kleiner, A., Talwalkar, A., Sarkar, P. and Jordan, M.I. (2013). A scalable bootstrap for massive data. J. R. Stat. Soc. Ser. B Stat. Methodol. To appear.
10. Mackey, L., Talwalkar, A. and Jordan, M.I. (2012). Divide-and-conquer matrix factorization. Available at arXiv:1107.0789.
11. Politis, D.N., Romano, J.P. and Wolf, M. (1999). Subsampling. Springer Series in Statistics. New York: Springer. MR1707286
12. Recht, B. (2011). A simpler approach to matrix completion. J. Mach. Learn. Res. 12 3413-3430. MR2877360
13. Samworth, R. (2003). A note on methods of restoring consistency to the bootstrap. Biometrika 90 985-990. MR2024773
14. Shalev-Shwartz, S., Shamir, O. and Tromer, E. (2012). Using more data to speed up training time. In Conference on Artificial Intelligence and Statistics, La Palma, Canary Islands.
15. Vazirani, V. (2004). Approximation Algorithms. New York: Springer.