Subgradient arid sampling algorithms for ℓ 1 regression

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 257-266

  Clarkson, Kenneth L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROPERTIES; MONTE CARLO ALGORITHMS; REGRESSION MODELS; SAMPLING ALGORITHMS;

APPROXIMATION THEORY; FUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; MONTE CARLO METHODS; RANDOM PROCESSES; REGRESSION ANALYSIS; STATISTICS; VECTORS;

ALGORITHMS;

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

References (17)

1. [AHPVar] P. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM, to appear.
2. [BC02] Mihai Bǎdoiu and K. L. Clarkson. Optimal core-sets for balls. Manuscript, available via http://cm.bell-labs.com/vho/clarkson/, 2002.
3. [Ber46] S. Bernstein. The Theory of Probabilities. Gastehizdat Publishing House, 1946.
4. [Ber01] D. Bertsekas. Convex Analysis and Optimization. Athena Scientific, 2001.
5. [BHPI02] M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. 34th Symp. Theory of Camp., 2002.
6. [Cla95] K. L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM, 42(2):488-499, 1995.
7. [DK01] P. Drinneas and R. Kannan. Fast Monte-Carlo algorithms for approximate matrix multiplication. In EEE Symposium on Foundations of Computer Science, 2001.
8. [DKM] P. Drineas, R. Kannan, and M. W. Mahoney. Fast monte carlo algorithms for matrices I: Approximating matrix multiplication. Manuscript. Available via http://cs-www.cs.yale.edu/homes/mmahoney/.
9. [HPV02] S. Har-Peled and K. R. Varadarajan. Projective clustering in high dimensions using core-sets. In Symp. Comp. Geometry, 2002.
10. [Lov86] L. Lovász. Algorithmic Theory of Numbers, Graphs, and Convexity. SIAM, 1986.
11. [Mau03] A. Maurer. A bound on the deviation probability for sums of non-negative random variables. J. Inequalities in Pure and Applied Mathematics, 4, 2003.
12. [MO03] D. McAllester and L. Ortiz. Concentration inequalities for the missing mass and for histogram rule error. J. Machine Learning Research, 4:895-911, 2003.
13. [MT93] N. Megiddo and A. Tamir. Linear time algorithms for some separable quadratic programming problems. Operations Research Letters, 13:203-211, March 1993.
14. [NB01] A. Nedić and D. Bertsekas. Incremental subgradient methods for nondifferentiable optimization. SIAM J. Opt., 12(1):109-138, 2001.
15. [Sch86] A. Schrijver. Theory of Linear and Integer Programming. Wiley, New York, 1986.
16. [Sho85] N. Z. Shor. Minimization Methods for Non-differentiable Functions. Springer, 1985.
17. [YKII88] P. Yamamoto, K. Kato, K. Imai, and H. Imai. Algorithms for vertical and orthogonal L1 linear approximation of points. In Proceedings of the fourth annual symposium on Computational geometry, pages 352-361. ACM Press, 1988.