Unbiased estimates for linear regression via volume sampling

Advances in Neural Information Processing Systems

Volumn 2017-December, Issue , 2017, Pages 3085-3094

  Dereziński, Michał ^a   Warmuth, Manfred K ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION; LEAST SQUARES APPROXIMATIONS; SURFACE RECONSTRUCTION;

LEAST SQUARES SOLUTIONS; LINEAR LEAST SQUARES; LINEAR LEAST SQUARES PROBLEMS; OPTIMAL SOLUTIONS; PSEUDO-INVERSES; STATE OF THE ART; UNBIASED ESTIMATES; UNBIASED ESTIMATOR;

INVERSE PROBLEMS;

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

References (19)

1. Haim Avron and Christos Boutsidis. Faster subset selection for matrices and applications. SIAM Journal on Matrix Analysis and Applications, 34(4):1464-1499, 2013.
2. Aharon Ben-Tal and Marc Teboulle. A geometric property of the least squares solution of linear equations. Linear Algebra and its Applications, 139:165-170, 1990.
3. Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail. Rich coresets for constrained linear regression. CoRR, abs/1202.3505, 2012.
4. Nicolo Cesa-Bianchi and Gabor Lugosi. Prediction, Learning, and Games. Cambridge University Press, New York, NY, USA, 2006.
5. Kenneth L. Clarkson and David P. Woodruff. Low rank approximation and regression in input sparsity time. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC'13, pages 81-90, New York, NY, USA, 2013. ACM.
6. Amit Deshpande and Luis Rademacher. Efficient volume sampling for row/column subset selection. In Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS'10, pages 329-338, Washington, DC, USA, 2010. IEEE Computer Society.
7. Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang. Matrix approximation and projective clustering via volume sampling. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA'06, pages 1117-1126, Philadelphia, PA, USA, 2006. Society for Industrial and Applied Mathematics.
8. Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, and David P. Woodruff. Fast approximation of matrix coherence and statistical leverage. J. Mach. Learn. Res., 13(1):3475-3506, December 2012.
9. Valeri Vadimovich Fedorov, W.J. Studden, and E.M. Klimko, editors. Theory of optimal experiments. Probability and mathematical statistics. Academic Press, New York, 1972.
10. Mike Gartrell, Ulrich Paquet, and Noam Koenigstein. Bayesian low-rank determinantal point processes. In Proceedings of the 10th ACM Conference on Recommender Systems, RecSys'16, pages 349-356, New York, NY, USA, 2016. ACM.
11. Venkatesan Guruswami and Ali Kemal Sinop. Optimal column-based low-rank matrix reconstruction. In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'12, pages 1207-1214, Philadelphia, PA, USA, 2012. Society for Industrial and Applied Mathematics.
12. Daniel Hsu, Kevin Shi, and Xiaorui Sun. Linear regression without correspondence. CoRR, abs/1705.07048, 2017.
13. Byungkon Kang. Fast determinantal point process sampling with application to clustering. In Proceedings of the 26th International Conference on Neural Information Processing Systems, NIPS'13, pages 2319-2327, USA, 2013. Curran Associates Inc.
14. Alex Kulesza and Ben Taskar. k-DPPs: Fixed-Size Determinantal Point Processes. In Proceedings of the 28th International Conference on Machine Learning, pages 1193-1200. Omnipress, 2011.
15. Alex Kulesza and Ben Taskar. Determinantal Point Processes for Machine Learning. Now Publishers Inc., Hanover, MA, USA, 2012.
16. C. Li, S. Jegelka, and S. Sra. Column Subset Selection via Polynomial Time Dual Volume Sampling. ArXiv e-prints, March 2017.
17. Michael W. Mahoney. Randomized algorithms for matrices and data. Found. Trends Mach. Learn., 3(2):123-224, February 2011.
18. Tamas Sarlos. Improved approximation algorithms for large matrices via random projections. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS'06, pages 143-152, Washington, DC, USA, 2006. IEEE Computer Society.
19. Masashi Sugiyama and Shinichi Nakajima. Pool-based active learning in approximate linear regression. Mach. Learn., 75(3):249-274, June 2009.