IDEAS home Printed from https://ideas.repec.org/p/crs/wpaper/2013-39.html

Optimal Exponential Bounds on the Accuracy of Classification

Author

Listed:
  • Gerard Kerkyacharian

    (Université Paris-Diderot)

  • Alexandre B. Tsybakov

    (CREST)

  • Vladimir Temlyakov

    (University of South Carolina)

  • Dominique Picard

    (Université Paris-Diderot)

  • Vladimir Koltchinskii

    (Georgia Institute of Technology)

Abstract

No abstract is available for this item.

Suggested Citation

  • Gerard Kerkyacharian & Alexandre B. Tsybakov & Vladimir Temlyakov & Dominique Picard & Vladimir Koltchinskii, 2013. "Optimal Exponential Bounds on the Accuracy of Classification," Working Papers 2013-39, Center for Research in Economics and Statistics.
    • Handle: RePEc:crs:wpaper:2013-39
    as

    Download full text from publisher

    File URL: http://crest.science/RePEc/wpstorage/2013-39.pdf
    File Function: Crest working paper version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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. Steinwart, Ingo & Hush, Don & Scovel, Clint, 2009. "Learning from dependent observations," Journal of Multivariate Analysis, Elsevier, vol. 100(1), pages 175-194, January.
    3. 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.
    4. 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.
    5. 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.
    6. Toru Kitagawa & Shosei Sakaguchi & Aleksey Tetenov, 2021. "Constrained Classification and Policy Learning," Papers 2106.12886, arXiv.org, revised Jul 2023.
    7. 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.
    8. Chang, Chih-Hao & Emura, Takeshi & Huang, Shih-Feng, 2026. "An algorithm for estimating threshold boundary regression models," Computational Statistics & Data Analysis, Elsevier, vol. 214(C).
    9. 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.
    10. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    11. Nan Liu & Yanbo Liu & Yuya Sasaki & Yuanyuan Wan, 2025. "Nonparametric Uniform Inference in Binary Classification and Policy Values," Working Papers tecipa-811, University of Toronto, Department of Economics.
    12. 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.
    13. Rubin Daniel B. & van der Laan Mark J., 2012. "Statistical Issues and Limitations in Personalized Medicine Research with Clinical Trials," The International Journal of Biostatistics, De Gruyter, vol. 8(1), pages 1-20, July.
    14. Zhiyu Ma & Shaowen Yao & Liwen Wu & Song Gao & Yunqi Zhang, 2022. "Hateful Memes Detection Based on Multi-Task Learning," Mathematics, MDPI, vol. 10(23), pages 1-16, November.
    15. Lee, Yoonkyung & Wang, Rui, 2015. "Does modeling lead to more accurate classification?: A study of relative efficiency in linear classification," Journal of Multivariate Analysis, Elsevier, vol. 133(C), pages 232-250.
    16. Nan Liu & Yanbo Liu & Yuya Sasaki & Yuanyuan Wan, 2026. "Root-$n$ Asymptotically Normal Maximum Score Estimation," Papers 2604.13399, arXiv.org.
    17. Guillaume Lecu'e, 2007. "Suboptimality of Penalized Empirical Risk Minimization in Classification," Papers math/0703811, arXiv.org.
    18. Aakil M. Caunhye & Douglas Alem, 2023. "Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 759-806, September.
    19. Aleksandar Arandjelovi'c & Julia Eisenberg, 2024. "Optimal risk mitigation by deep reinsurance," Papers 2408.06168, arXiv.org, revised Nov 2025.
    20. Hongzhi Tong & Di-Rong Chen & Fenghong Yang, 2013. "Learning Rates for l1‐Regularized Kernel Classifiers," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    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:crs:wpaper:2013-39. 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: Secretariat General (email available below). General contact details of provider: https://edirc.repec.org/data/crestfr.html .

    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.