Learning compressible models

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 872-881

  Zhang, Yi ^a   Schneider, Jeff ^b   Dubrawski, Artur ^b  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Compressible models; Compression; Inductive bias; Linear models; Sparse models; 1 regularization

Indexed keywords

CHARACTER RECOGNITION; CLASSIFICATION (OF INFORMATION); COMPACTION; COMPRESSIBILITY; COMPUTER PROGRAMMING; DATA MINING; FREQUENCY DOMAIN ANALYSIS; KNOWLEDGE MANAGEMENT; SEMANTICS; TEXT PROCESSING;

1-NORM REGULARIZATIONS; BRAIN-COMPUTER INTERFACING; COMPRESSIBLE MODELS; COMPRESSION OPERATIONS; HAND WRITTEN CHARACTER RECOGNITION; INDUCTIVE BIAS; PREDICTION PERFORMANCE; SPARSE MODELS;

LEARNING SYSTEMS;

EID: 80054063086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.76     Document Type: Conference Paper

References (33)

1. R. G. Baraniuk, E. J. Candes, R. Nowak, and M. Vetterli. Compressive Sampling (Special Issue). IEEE Signal Processing Magazine, 25:12-101, 2008.
2. B. Blankertz et al. The BCI Competition 2003: Progress and Perspectives in Detection and Discrimination of EEG Single Trails. IEEE Trans. Biomedical Engineering, 51(6):1044-1051, 2004.
3. H. D. Bondell and B. J. Reich. Simultaneous regression shrinkage, variable selection, and supervised clustering of predictors with oscar. Biometrics, 64:115-123, 2008.
4. R. Calderbank, S. Jafarpour, and R. Schapire. Compressed learning: Universal sparse dimensionality reduction and learning in the measurement domain. Preprint, 2009.
5. E. J. Candes. Compressive Sampling. In Proceedings of International Congress of Mathematicians, 2006.
6. E. J. Candes and M. B. Wakin. An Introduction to Compressive Sampling. IEEE Signal Processing Magazine, 25:21-30, 2008.
7. E. J. Candes, M. B. Wakin, and S. P. Boyd. Enhancing sparsity by reweighted l1 minimization. Journal of Fourier Analysis and Applications, 14:877-905, 2008.
8. C. Christopoulos, A. Skodras, and T. Ebrahimi. The JPEG2000 Still Image Coding System: An Overview. IEEE Trans. Consumer Electronics, 2000.
9. D. L. Donoho. Compressed Sensing. IEEE Trans. Information Theory, 52(4):1289-1306, 2006.
10. C. Faloutsos and V. Megalooikonomou. On data mining, compression, and kolmogorov complexity. Data Min. Knowl. Discov., 15(1):3-20, 2007.
11. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001.
12. J. Huang, T. Zhang, and D. Metaxas. Learning with structured sparsity. In ICML '09, 2009.
13. S. Ji and L. Carin. Bayesian Compressive Sensing and Projection Optimization. In ICML, 2007.
14. S. J. Kim, K. Ko, M. Lustig, S. Boyd, and D. Gorinevsky. An Interior-Point Method for Large-Scale L1-Regularized Least Squares. IEEE Journal of Selected Topics in Signal Processing, 1:606-617, 2008.
15. S. I. Lee, H. Lee, P. Abbeel, and A. Y. Ng. Efficient L-1 Regularized Logistic Regression. In AAAI, 2006.
16. R. Nallapati, A. Ahmed, W. Cohen, and E. Xing. Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models. In ICDM workshop on High Performance Data Mining, 2007.
17. R. Raina, A. Y. Ng, and D. Koller. Constructing Informative Priors using Transfer Learning. In ICML, pages 713-720, 2006.
18. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
19. L. Rudin, S. Osher, and E. Fatemi. Nonlinear total variation based noise removal algorithms. Physica D, 60:259-268, 1992.
20. F. O. Sullivan. A statistical perspective on ill-posed inverse problems. Statist. Sci., 1:502-518, 1986.
21. R. Tibshirani. Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Soceity, Series B, 58(1):267-288, 1996.
22. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight. Sparsity and smoothness via the fused lasso. Journal of The Royal Statistical Society Series B, 67(1):91-108, 2005.
23. A. N. Tikhonov and V. Y. Arsenin. Solutions of Ill-posed Problems. Winston and Sons, 1977.
24. P. Trevor and C. George. The bayesian lasso. Journal of the American Statistical Association, 103(482):681-686, 2008.
25. J. A. Tropp. Just relax: convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory, 52(3), 2006.
26. G. K. Wallace. The JPEG Still Picture Compression Standard. IEEE Trans. Consumer Electronics, 1992.
27. Y. Wang et al. The BCI Competition 2003 - Data Set IV: An Algorithm Based on CSSD and FDA for Classifying Single-Trail EEG. IEEE Trans. Biomedical Engineering, 51(6):1081-1086, 2004.
28. M. Yuan, M. Yuan, Y. Lin, and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68:49-67, 2006.
29. Y. Zhang, J. Schneider, and A. Dubrawski. Learning the Semantic Correlation: An Alternative Way to Gain from Unlabeled Text. In NIPS, 2008.
30. P. Zhao and B. Yu. On model selection consistency of lasso. J. Mach. Learn. Res., 7:2541-2563, 2006.
31. S. Zhou, J. Lafferty, and L. Wasserman. Compressed Regression. In NIPS, 2007.
32. H. Zou. The adaptive lasso and its oracle properties. Journal of the American Statistical Association, 101:1418-1429, 2006.
33. H. Zou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society B, 67:301-320, 2005.