IDEAS home Printed from https://ideas.repec.org/p/arx/papers/0708.0121.html
   My bibliography  Save this paper

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii

Author

Listed:
  • Xiaotong Shen
  • Lifeng Wang

Abstract

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Suggested Citation

  • 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.
    • Handle: RePEc:arx:papers:0708.0121
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/0708.0121
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shen, Xiaotong & Huang, Hsin-Cheng, 2006. "Optimal Model Assessment, Selection, and Combination," Journal of the American Statistical Association, American Statistical Association, vol. 101, pages 554-568, June.
    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)

    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. Huiyu Huang & Tae-Hwy Lee, 2010. "To Combine Forecasts or to Combine Information?," Econometric Reviews, Taylor & Francis Journals, vol. 29(5-6), pages 534-570.
    4. Benjamin Säfken & Thomas Kneib, 2020. "Conditional covariance penalties for mixed models," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 47(3), pages 990-1010, September.
    5. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    6. María José Lombardía & Esther López‐Vizcaíno & Cristina Rueda, 2017. "Mixed generalized Akaike information criterion for small area models," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 180(4), pages 1229-1252, October.
    7. 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.
    8. Yan Gao & Xinyu Zhang & Shouyang Wang & Terence Tai-leung Chong & Guohua Zou, 2019. "Frequentist model averaging for threshold models," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 71(2), pages 275-306, April.
    9. Guillaume Lecu'e, 2007. "Suboptimality of Penalized Empirical Risk Minimization in Classification," Papers math/0703811, arXiv.org.
    10. Aleksandar Arandjelovi'c & Julia Eisenberg, 2024. "Reinsurance with neural networks," Papers 2408.06168, arXiv.org.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Zhang, Bo & Shen, Xiaotong & Mumford, Sunni L., 2012. "Generalized degrees of freedom and adaptive model selection in linear mixed-effects models," Computational Statistics & Data Analysis, Elsevier, vol. 56(3), pages 574-586.
    16. Aman Ullah & Xinyu Zhang, 2015. "Grouped Model Averaging for Finite Sample Size," Working Papers 201501, University of California at Riverside, Department of Economics.
    17. 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.
    18. Andrew Bennett & Nathan Kallus, 2020. "Efficient Policy Learning from Surrogate-Loss Classification Reductions," Papers 2002.05153, arXiv.org.
    19. 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.
    20. Steinwart, Ingo & Hush, Don & Scovel, Clint, 2009. "Learning from dependent observations," Journal of Multivariate Analysis, Elsevier, vol. 100(1), pages 175-194, January.

    More about this item

    Statistics

    Access and download statistics

    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:arx:papers:0708.0121. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.