Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-11T12:49:53.851Z Has data issue: false hasContentIssue false
  • English
  • Français

LEARNING GRADIENTS FROM NONIDENTICAL DATA

Part of: Artificial intelligence (68Txx) Linear inference, regression

Published online by Cambridge University Press:  07 March 2017

XUE-MEI DONG Open the ORCID record for XUE-MEI DONG [Opens in a new window]
XUE-MEI DONG*
Affiliation:
School of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou, 310018, China email dongxuemei@zjgsu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Selecting important variables and estimating coordinate covariation have received considerable attention in the current big data deluge. Previous work shows that the gradient of the regression function, the objective function in regression and classification problems, can provide both types of information. In this paper, an algorithm to learn this gradient function is proposed for nonidentical data. Under some mild assumptions on data distribution and the model parameters, a result on its learning rate is established which provides a theoretical guarantee for using this method in dynamical gene selection and in network security for recognition of malicious online attacks.

Keywords

gradient learningvariable selectioncoordinate covariation estimation

MSC classification

Primary: 68T05: Learning and adaptive systems
Secondary: 62J02: General nonlinear regression
Type
Research Article
Information
The ANZIAM Journal , Volume 58 , Issue 3-4 , April 2017 , pp. 220 - 230
Copyright
© 2017 Australian Mathematical Society 

References

Aronszajn, N., “Theory of reproducing kernels”, Trans. Amer. Math. Soc. 68 (1950) 337–404; doi:10.2307/1990404.Google Scholar
Bickel, P. and Levina, E., “Covariance regularization by thresholding”, Ann. Statist. 36 (2008) 2577–2604; doi:10.1214/08-AOS600.CrossRefGoogle Scholar
Cai, T. and Liu, W., “Adaptive thresholding for sparse covariance matrix estimation”, J. Amer. Statist. Assoc. 106 (2011) 672–684; doi:10.1198/jasa.2011.tm10560.Google Scholar
Guyon, I. and Ellsseeff, A., “An introduction to variable and feature selection”, J. Mach. Learn. Res. 3 (2003) 1157–1182; doi:10.1162/153244303322753616.Google Scholar
Koski, T., Hidden Markov models for bioinformatics (Springer, Netherlands, 2001).Google Scholar
Lax, P. D., Functional analysis (John Wiley & Sons, New York, 2002).Google Scholar
Mukherjee, S. and Zhou, D. X., “Learning coordinate covariances via gradients”, J. Mach. Learn. Res. 7 (2006) 519–549; http://www.jmlr.org/papers/volume7/mukherjee06a/mukherjee06a.pdf.Google Scholar
Raftery, A. E., Madigan, D. and Hoeting, J. A., “An introduction to variable and feature selection”, J. Amer. Statist. Assoc. 92 (1998) 179–191; doi:10.1080/01621459.1997.10473615.Google Scholar
Robinson, C., Dynamical systems: stability, symbolic dynamics, and chaos (CRC Press, New York, 1998).CrossRefGoogle Scholar
Smale, S. and Zhou, D.-X., “Online learning with Markov sampling”, Anal. Appl. 7 (2009) 87–113; doi:10.1142/S0219530509001293.CrossRefGoogle Scholar
Steinwart, I., Hush, D. and Scovel, C., “Learning from dependent observations”, J. Multivariate Anal. 100 (2009) 175–194; doi:10.1016/j.jmva.2008.04.001.Google Scholar
Tibshirani, R., “Regression shrinkage and selection via the lasso”, J. R. Stat. Soc. Ser. B Stat. Methodol. 58 (1996) 267–288; doi:10.2307/2346178.Google Scholar
Ye, G. B. and Xie, X., “Learning sparse gradients for variable selection and dimension reduction”, Mach. Learn. 87 (2012) 303–355; doi:10.1007/s10994-012-5284-9.CrossRefGoogle Scholar
Zou, H. and Hastie, T., “Regularization and variable selection via the elastic net”, J. R. Stat. Soc. Ser. B, Stat. Methodol. 67 (2005) 301–320; doi:10.1111/j.1467-9868.2005.00503.x.Google Scholar