Robust regression on MapReduce

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1925-1933

  Meng, Xiangrui ^a   Mahoney, Michael W ^b  

^a LINKEDIN CORPORATION   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LEARNING SYSTEMS; LINEAR ALGEBRA; LINEAR PROGRAMMING;

ALGORITHM FOR SOLVING; INTERIOR-POINT CUTTING-PLANE METHODS; ITERATIVE ALGORITHM; LINEAR LEAST SQUARES; MAPREDUCE FRAMEWORKS; NUMBER OF ITERATIONS; REGRESSION PROBLEM; ROBUST REGRESSIONS;

REGRESSION ANALYSIS;

EID: 84897474159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Balcan, M.-F., Blum, A., Fine, S., and Mansour, Y. Distributed learning, communication complexity and privacy. Arxiv preprint arXiv.1204-3514, 2012.
2. Bekkerman, R., Bilenko, M., and Langford, J. (eds.). Scaling up Machine Learning: Parallel and Distributed Approaches. Cambridge University Press, 2011.
3. Bertsekas, D. P. and Tsitsiklis, J. N. Some aspects of parallel and distributed iterative algorithms - a survey. Automatica, 27(1):3-21, 1991.
4. Bertsimas, D. and Vempala, S. Solving convex programs by random walks. Journal of the ACM, 51(4):540-556, 2004.
5. 1 regression. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 257-266. SIAM, 2005.
6. Clarkson, K. L. and Woodruff, D. P. Low rank approximation and regression in input sparsity time. In Proceedings of the 45th Annual ACM symposium on Theory of Computing (STOC), 2013.
7. Clarkson, K. L., Drineas, P., Magdon-Ismail, M., Mahoney, M. W., Meng, X., and Woodruff, D. P. The Fast Cauchy Transform and faster robust linear regression. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.
8. p regression. SIAM J. Comput., 38(5):2060-2078, 2009.
9. Daumé, III, H., Phillips, J. M., Saha, A., and Venkatasubramanian, S. Efficient protocols for distributed classification and optimization. In Proceedings of the 23rd International Conference on Algorithmic Learning Theory, pp. 154-168, 2012.
10. Dean, J. and Ghemawat, S. MapReduce: Simplified data processing on large clusters. In Proceedings of the Sixth Symposium on Operating System Design and Implementation (OSDI), pp. 137-149, 2004.
11. Feldman, J., Muthukrishnan, S., Sidiropoulos, A., Stein, C., and Svitkina, Z. On distributing symmetric streaming computations. ACM Transactions on Algorithms, 6 (4):Article 66, 2010.
12. Goodrich, M. T. Simulating parallel algorithms in the MapReduce framework with applications to parallel computational geometry. Arxiv preprint arXiv:1004.4708, 2010.
13. Grötschel, M., Lovász, L., and Schrijver, A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
14. Karloff, H., Suri, S., and Vassilvitskii, S. A model of computation for MapReduce. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 938-948, 2010.
15. Levin, A. Y. On an algorithm for the minimization of convex functions. In Soviet Mathematics Doklady, volume 160, pp. 1244-1247, 1965.
16. Lovász, L. Hit-and-run mixes fast. Math. Prog., 86(3):443-461, 1999.
17. Mackey, L., Talwalkar, A., and Jordan, M. I. Divide-and-conquer matrix factorization. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS), 2011.
18. Mahoney, M. W. Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning. NOW Publishers, Boston, 2011. Also available at: arXiv:1104.5557.
19. Meng, X. and Mahoney, M. W. Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression. In Proceedings of the 45th Annual ACM symposium on Theory of Computing (STOC), 2013.
20. Mitchell, J. E. Polynomial interior point cutting plane methods. Optimization Methods and Software, 18(5):507-534, 2003.
21. Nesterov, Y. Unconstrained convex minimization in relative scale. Mathematics of Operations Research, 34(1):180-193, 2009
22. Nesterov, Y. and Nemirovsky, A. Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.
23. Portnoy, S. and Koenker, R. The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. Statistical Science, 12(4):279-300, 1997. (Pubitemid 127464710)
24. Rousseeuw, P. J. and Leroy, A. M. Robust Regression and Outlier Detection. Wiley, 1987.
25. 1-norm with applications. In Proceedings of the 43rd annual ACM symposium on Theory of computing (STOC), pp. 755-764. ACM, 2011.
26. Tarasov, S., Khachiyan, L. G., and Erlikh, I. The method of inscribed ellipsoids. In Soviet Mathematics Doklady, volume 37, pp. 226-230, 1988.
27. Vaidya, P. M. A new algorithm for minimizing convex functions over convex sets. Math. Prog., 73:291-341, 1996. (Pubitemid 126375689)
28. Zhang, Y., Duchi, J., and Wainwright, M. J. Communication-efficient algorithms for statistical optimization. In Annual Advances in Neural Information Processing Systems 26: Proceedings of the 2012 Conference, 2012.