Predicting execution time of computer programs using sparse polynomial regression

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Huang, Ling ^a   Jia, Jinzhu ^b   Yu, Bin ^b   Chun, Byung Gon ^a   Maniatis, Petros ^a   Naik, Mayur ^a  

^a INTEL CORPORATION   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE EXTRACTION; POLYNOMIALS; REGRESSION ANALYSIS;

ACCURATE PREDICTION; IMPORTANT FEATURES; POLYNOMIAL REGRESSION; PREDICTING EXECUTION TIME; PREDICTION MODELLING; PROGRAM CODE; PROGRAM EXECUTION; REGRESSION ALGORITHMS; REGRESSION METHOD; SPARSE POLYNOMIALS;

FORECASTING;

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

References (29)

1. Caltech 101 Object Categories. http://www.vision.caltech.edu/Image- Datasets/Caltech101/Caltech101.html.
2. Event Dataset. http://vision.stanford.edu/lijiali/event-dataset/.
3. ImageJ. http://rsbweb.nih.gov/ij/.
4. Mahout. lucene.apache.org/mahout.
5. Visual Object Classes Challenge 2008. http://pascallin.ecs.soton.ac.uk/ challenges/VOC/voc2008/.
6. S. Chen, K. Joshi, M. A. Hiltunen, W. H. Sanders, and R. D. Schlichting. Link gradients: Predicting the impact of network latency on multitier applications. In INFOCOM, 2009.
7. B.-G. Chun, L. Huang, S. Lee, P.Maniatis, and M. Naik. Mantis: Predicting system performance through program analysis and modeling. Technical Report, 2010. arXiv:1010.0019v1 [cs.PF].
8. D. Donoho. For most large underdetermined systems of equations, the minimal 1-norm solution is the sparsest solution. Communications on Pure and Applied Mathematics, 59:797829, 2006.
9. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani. Least angle regression. Annals of Statistics, 32(2):407-499, 2002.
10. J. Friedman, T. Hastie, and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software, 33(1), 2010.
11. A. Ganapathi, H. Kuno, U. Dayal, J. L. Wiener, A. Fox, M. Jordan, and D. Patterson. Predicting multiple metrics for queries: Better decisions enabled by machine learning. In ICDE, 2009.
12. S. Goldsmith, A. Aiken, and D. Wilkerson. Measuring empirical computational complexity. In FSE, 2007.
13. C. Gupta, A. Mehta, and U. Dayal. PQR: Predicting query execution times for autonomous workload management. In ICAC, 2008.
14. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer, 2009.
15. M. Isard, V. Prabhakaran, J. Currey, U. Wieder, K. Talwar, and A. Goldberg. Quincy: fair scheduling for distributed computing clusters. In Proceedings of SOSP'09, 2009.
16. S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky. An interior-point method for large-scale l1-regularized least squares. IEEE Journal on Selected Topics in Signal Processing, 1(4):606-617, 2007.
17. Z. Li,M. Zhang, Z. Zhu, Y. Chen, A. Greenberg, and Y.-M.Wang. WebProphet: Automating performance prediction for web services. In NSDI, 2010.
18. H. Liu and X. Chen. Nonparametric greedy algorithm for the sparse learning problems. In NIPS 22, 2009.
19. M. Osborne, B. Presnell, and B. Turlach. On the lasso and its dual. Journal of Computational and Graphical Statistics, 9(2):319-337, 2000.
20. P. Ravikumar, J. Lafferty, H. Liu, and L. Wasserman. Sparse additive models. Journal of the Royal Statistical Society: Series B(Statistical Methodology), 71(5):1009-1030, 2009.
21. P. Ravikumar, V. Vu, B. Yu, T. Naselaris, K. Kay, J. Gallant, and C. Berkeley. Nonparametric sparse hierarchical models describe v1 fmri responses to natural images. Advances in Neural Information Processing Systems (NIPS), 21, 2008.
22. S. A. Seshia and A. Rakhlin. Game-theoretic timing analysis. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 575-582. IEEE Press, Nov. 2008.
23. S. A. Seshia and A. Rakhlin. Quantitative analysis of systems using game-theoretic learning. ACM Transactions on Embedded Computing Systems (TECS), 2010. To appear.
24. M. Tariq, A. Zeitoun, V. Valancius, N. Feamster, and M. Ammar. Answering what-if deployment and configuration questions with wise. In ACM SIGCOMM, 2008.
25. R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal. Statist. Soc B., 1996.
26. M. Wainwright. Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso). IEEE Trans. Information Theory, 55:2183-2202, 2009.
27. T. Zhang. Adaptive forward-backward greedy algorithm for sparse learning with linear models. Advances in Neural Information Processing Systems, 22, 2008.
28. P. Zhao and B. Yu. On model selection consistency of Lasso. The Journal of Machine Learning Research, 7:2563, 2006.
29. H. Zou. The adaptive lasso and its oracle properties. Journal of the American Statistical Association, 101(476):1418-1429, 2006.