IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v100y2009i1p175-194.html
   My bibliography  Save this article

Learning from dependent observations

Author

Listed:
  • Steinwart, Ingo
  • Hush, Don
  • Scovel, Clint

Abstract

In most papers establishing consistency for learning algorithms it is assumed that the observations used for training are realizations of an i.i.d. process. In this paper we go far beyond this classical framework by showing that support vector machines (SVMs) only require that the data-generating process satisfies a certain law of large numbers. We then consider the learnability of SVMs for [alpha]-mixing (not necessarily stationary) processes for both classification and regression, where for the latter we explicitly allow unbounded noise.

Suggested Citation

  • Steinwart, Ingo & Hush, Don & Scovel, Clint, 2009. "Learning from dependent observations," Journal of Multivariate Analysis, Elsevier, vol. 100(1), pages 175-194, January.
    • Handle: RePEc:eee:jmvana:v:100:y:2009:i:1:p:175-194
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0047-259X(08)00109-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Irle, A., 1997. "On Consistency in Nonparametric Estimation under Mixing Conditions," Journal of Multivariate Analysis, Elsevier, vol. 60(1), pages 123-147, January.
    2. Bartlett, Peter L. & Jordan, Michael I. & McAuliffe, Jon D., 2006. "Convexity, Classification, and Risk Bounds," Journal of the American Statistical Association, American Statistical Association, vol. 101, pages 138-156, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alquier Pierre & Li Xiaoyin & Wintenberger Olivier, 2014. "Prediction of time series by statistical learning: general losses and fast rates," Dependence Modeling, De Gruyter, vol. 1(2013), pages 65-93, January.
    2. Katharina Strohriegl & Robert Hable, 2016. "Qualitative robustness of estimators on stochastic processes," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 79(8), pages 895-917, November.
    3. Alquier Pierre & Doukhan Paul & Fan Xiequan, 2019. "Exponential inequalities for nonstationary Markov chains," Dependence Modeling, De Gruyter, vol. 7(1), pages 150-168, January.
    4. Liu, Lu & Huang, Wei & Shen, Li, 2021. "Learning performance of regularized regression with multiscale kernels based on Markov observations," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    5. Arrieta-Prieto, Mario & Schell, Kristen R., 2022. "Spatio-temporal probabilistic forecasting of wind power for multiple farms: A copula-based hybrid model," International Journal of Forecasting, Elsevier, vol. 38(1), pages 300-320.
    6. Hang, H. & Steinwart, I., 2014. "Fast learning from α-mixing observations," Journal of Multivariate Analysis, Elsevier, vol. 127(C), pages 184-199.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Steffen Borgwardt & Rafael M. Frongillo, 2019. "Power Diagram Detection with Applications to Information Elicitation," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 184-196, April.
    2. Weiyang Ding & Michael K. Ng & Wenxing Zhang, 2024. "A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression," Journal of Global Optimization, Springer, vol. 90(3), pages 727-753, November.
    3. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    4. Zudi Lu, 2001. "Asymptotic Normality of Kernel Density Estimators under Dependence," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 53(3), pages 447-468, September.
    5. Nam Ho-Nguyen & Fatma Kılınç-Karzan, 2022. "Risk Guarantees for End-to-End Prediction and Optimization Processes," Management Science, INFORMS, vol. 68(12), pages 8680-8698, December.
    6. Guillaume Lecu'e, 2007. "Suboptimality of Penalized Empirical Risk Minimization in Classification," Papers math/0703811, arXiv.org.
    7. Walk, Harro, 2010. "Strong consistency of kernel estimates of regression function under dependence," Statistics & Probability Letters, Elsevier, vol. 80(15-16), pages 1147-1156, August.
    8. Aleksandar Arandjelovi'c & Julia Eisenberg, 2024. "Reinsurance with neural networks," Papers 2408.06168, arXiv.org.
    9. Ghysels, Eric & Babii, Andrii & Chen, Xi & Kumar, Rohit, 2020. "Binary Choice with Asymmetric Loss in a Data-Rich Environment: Theory and an Application to Racial Justice," CEPR Discussion Papers 15418, C.E.P.R. Discussion Papers.
    10. Christmann, Andreas & Steinwart, Ingo & Hubert, Mia, 2006. "Robust Learning from Bites for Data Mining," Technical Reports 2006,03, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    11. Xiang Zhang & Yichao Wu & Lan Wang & Runze Li, 2016. "Variable selection for support vector machines in moderately high dimensions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 78(1), pages 53-76, January.
    12. Yaoyao Xu & Menggang Yu & Ying‐Qi Zhao & Quefeng Li & Sijian Wang & Jun Shao, 2015. "Regularized outcome weighted subgroup identification for differential treatment effects," Biometrics, The International Biometric Society, vol. 71(3), pages 645-653, September.
    13. Pierre Alquier & Vincent Cottet & Guillaume Lecué, 2017. "Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions," Working Papers 2017-30, Center for Research in Economics and Statistics.
    14. Andrew Bennett & Nathan Kallus, 2020. "Efficient Policy Learning from Surrogate-Loss Classification Reductions," Papers 2002.05153, arXiv.org.
    15. Christmann, Andreas & Steinwart, Ingo & Hubert, Mia, 2007. "Robust learning from bites for data mining," Computational Statistics & Data Analysis, Elsevier, vol. 52(1), pages 347-361, September.
    16. Xiaotong Shen & Lifeng Wang, 2007. "Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii," Papers 0708.0121, arXiv.org.
    17. Peter L. Bartlett & Shahar Mendelson, 2007. "Discussion of "2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization" by V. Koltchinskii," Papers 0708.0089, arXiv.org.
    18. Toru Kitagawa & Shosei Sakaguchi & Aleksey Tetenov, 2021. "Constrained Classification and Policy Learning," Papers 2106.12886, arXiv.org, revised Jul 2023.
    19. Hung Yi Lee & Charles Hernandez & Hongcheng Liu, 2023. "Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness," Journal of Global Optimization, Springer, vol. 85(2), pages 257-282, February.
    20. Jun-ya Gotoh & Stan Uryasev, 2017. "Support vector machines based on convex risk functions and general norms," Annals of Operations Research, Springer, vol. 249(1), pages 301-328, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:100:y:2009:i:1:p:175-194. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.