Support vector machines regression with unbounded sampling

References

• Vapnik V . The nature of statistical learning theory. New York (NY): Springer-Verlag; 1995.
   Google Scholar
• Vapnik V . Statistical learning theory. New York (NY): Wiley; 1998.
   Google Scholar
• Tong HZ , Ng M . Calibration of ∈-insensitive loss in support vector machines regression. Peprint, 2016.
   Google Scholar
• Aronszajn N . Theory of reproducing kernels. Trans Amer Math Soc. 1950;68:337–404.
   Web of Science ®Google Scholar
• Cristianini N , Shawe-Taylor J . An introduction to support vector machines. Cambridge: Cambridge University Press; 2000.
   Google Scholar
• Evgeniou T , Pontil M , Poggio T . Regularization networks and support vector machines. Adv Comput Math. 2000;13:1–50.
   Web of Science ®Google Scholar
• Steinwart I , Christmann A . Support vector machines. New York (NY): Springer; 2008.
   Google Scholar
• Tong HZ , Chen DR , Peng LZ . Analysis of support vector machines regression. Found Comput Math. 2009;9:243–257.
   Web of Science ®Google Scholar
• Xiang DH , Hu T , Zhou DX . Approximation analysis of learning algorithms for support vector regression and quantile regression. J Appl Math. 2012;2012: Article ID 902139, 17 p.
   Web of Science ®Google Scholar
• Caponnetto A , De Vito E . Optimal rates for regularized least squares algorithm. Found Comput Math. 2007;7:331–368.
   Web of Science ®Google Scholar
• De Mol C , De Vito E , Rosasco L . Elastic-net regularization in learning theory. J Complexity. 2009;25:201–230.
   Web of Science ®Google Scholar
• Wang C , Zhou DX . Optimal learning rates for least square regularized regression with unbounded sampling. J Complexity. 2011;27:55–67.
   Web of Science ®Google Scholar
• Cai J . Coefficient-based regression with non-identical unbounded sampling. Abstract Appl Anal. 2013;2013: Article ID 134727, 8 p.
   Google Scholar
• Cai J , Wang C . Coefficient-based regularized regression with indefinite kernels by unbouded sampling. Sci Sin Math. 2013;43:613–624. Chinese.
   Google Scholar
• Chu XR , Sun HW . Regularized least square regression with unbounded and dependent sampling. Abstract Appl Anal. 2013;2013: Article ID 139318, 7 p.
   Google Scholar
• Guo ZC , Wang C . Online regression with unbouded sampling. Int J Comput Math. 2011;88:2936–2941.
   Web of Science ®Google Scholar
• Guo ZC , Zhou DX . Concentration estimates for learning with unbouded sampling. Adv Comput Math. 2013;38:207–223.
   Web of Science ®Google Scholar
• He FC . Optimal convergence rates of high parzen windows with unbouded sampling. Stat Probab Lett. 2014;92:26–32.
   Web of Science ®Google Scholar
• He FC , Chen H , Li LQ . Statistical analysis of moving least squares method with unbouded sampling. Inform Sci. 2014;286:370–380.
   Web of Science ®Google Scholar
• Lv SG , Feng YL . Integral operator approach to learning theory with unbounded sampling. Complex Anal Oper Theory. 2012;6:533–548.
   Web of Science ®Google Scholar
• Nie WL , Wang C . Error analysis of EMR algorithm with unbounded and non-identical sampling. J Appl Math Phys. 2016;4:156–168.
   Google Scholar
• Wang C , Cai J . Convergence analysis of coefficient-based regularization under moment incremental condition. Int J Wavelets Multiresolution Inf Process. 2014;12(1): 19 p.
   Web of Science ®Google Scholar
• Wang C , Guo ZC . EMR learning with unbounded sampling. Acta Math Sin (Engl Ser). 2012;28:97–104.
   Web of Science ®Google Scholar
• Smale S , Zhou DX . Estimating the approximation error in learning theory. Anal Appl. 2003;1:17–41.
   Web of Science ®Google Scholar
• Cucker F , Zhou DX . Learning theory: an approximation theory viewpoint. Cambridge: Cambridge University Press; 2007.
   Google Scholar
• Cucker F , Smale S . On the mathematical foundations of learing theory. Bull Amer Math Soc. 2001;39:1–49.
   Web of Science ®Google Scholar
• Zhou DX . The covering number in learning theory. J Complexity. 2002;18:739–767.
   Web of Science ®Google Scholar
• Zhou DX . Capacity of reproducing kernel spaces in learning theory. IEEE Trans Inform Theory. 2003;49:1743–1752.
   Web of Science ®Google Scholar
• Cucker F , Smale S . Best choices for regularization parameters in learning theory: on the bias-variance problem. Found Comput Math. 2002;2:413–428.
   Web of Science ®Google Scholar
• Steinwart I , Scovel C . Fast rates for support vector machines using Gaussian kernels. Ann Stat. 2007;35:575–607.
   Web of Science ®Google Scholar
• Wu Q , Ying Y , Zhou DX . Learning rates of least-square regularized regression. Found Comput Math. 2006;6:171–192.
   Web of Science ®Google Scholar
• Xiang DH , Hu T , Zhou DX . Learning with varying insensitive loss. Appl Math Lett. 2011;24:2107–2109.
   Web of Science ®Google Scholar