Building Robust Ensembles via Margin Boosting
暂无分享,去创建一个
Aaron C. Courville | Arun Sai Suggala | Yoshua Bengio | Hongyang R. Zhang | Pradeep Ravikumar | Dinghuai Zhang | Hongyang Zhang | A. Suggala
[1] Xiaojun Xu,et al. On the Certified Robustness for Ensemble Models and Beyond , 2021, ICLR.
[2] A Multiclass Boosting Framework for Achieving Fast and Provable Adversarial Robustness , 2021, ArXiv.
[3] Yadong Mu,et al. Informative Dropout for Robust Representation Learning: A Shape-bias Perspective , 2020, ICML.
[4] James Bailey,et al. Improving Adversarial Robustness Requires Revisiting Misclassified Examples , 2020, ICLR.
[5] Balaraman Ravindran,et al. EMPIR: Ensembles of Mixed Precision Deep Networks for Increased Robustness against Adversarial Attacks , 2020, ICLR.
[6] Yisen Wang,et al. Adversarial Weight Perturbation Helps Robust Generalization , 2020, NeurIPS.
[7] Matthias Hein,et al. Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks , 2020, ICML.
[8] Yann Chevaleyre,et al. Randomization matters. How to defend against strong adversarial attacks , 2020, ICML.
[9] Mohan S. Kankanhalli,et al. Attacks Which Do Not Kill Training Make Adversarial Learning Stronger , 2020, ICML.
[10] J. Z. Kolter,et al. Overfitting in adversarially robust deep learning , 2020, ICML.
[11] Qiang Liu,et al. Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Framework , 2020, NeurIPS.
[12] Florian Tramèr,et al. On Adaptive Attacks to Adversarial Example Defenses , 2020, NeurIPS.
[13] Pooyan Jamshidi,et al. ATHENA: A Framework based on Diverse Weak Defenses for Building Adversarial Defense , 2020 .
[14] Nicolas Flammarion,et al. Square Attack: a query-efficient black-box adversarial attack via random search , 2019, ECCV.
[15] Matthias Hein,et al. Minimally distorted Adversarial Examples with a Fast Adaptive Boundary Attack , 2019, ICML.
[16] Mohan S. Kankanhalli,et al. GEOMETRY-AWARE INSTANCE-REWEIGHTED ADVER- , 2020 .
[17] Avrim Blum,et al. Random Smoothing Might be Unable to Certify 𝓁∞ Robustness for High-Dimensional Images , 2020, J. Mach. Learn. Res..
[18] James Bailey,et al. On the Convergence and Robustness of Adversarial Training , 2021, ICML.
[19] Greg Yang,et al. Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers , 2019, NeurIPS.
[20] Aleksander Madry,et al. Adversarial Examples Are Not Bugs, They Are Features , 2019, NeurIPS.
[21] Bin Dong,et al. You Only Propagate Once: Accelerating Adversarial Training via Maximal Principle , 2019, NeurIPS.
[22] J. Zico Kolter,et al. Certified Adversarial Robustness via Randomized Smoothing , 2019, ICML.
[23] Moinuddin K. Qureshi,et al. Improving Adversarial Robustness of Ensembles with Diversity Training , 2019, ArXiv.
[24] Ning Chen,et al. Improving Adversarial Robustness via Promoting Ensemble Diversity , 2019, ICML.
[25] Michael I. Jordan,et al. Theoretically Principled Trade-off between Robustness and Accuracy , 2019, ICML.
[26] Kannan Ramchandran,et al. Rademacher Complexity for Adversarially Robust Generalization , 2018, ICML.
[27] Ilya P. Razenshteyn,et al. Adversarial examples from computational constraints , 2018, ICML.
[28] Ananthram Swami,et al. Error Correcting Output Codes Improve Probability Estimation and Adversarial Robustness of Deep Neural Networks , 2019, NeurIPS.
[29] Po-Ling Loh,et al. Adversarial Risk Bounds via Function Transformation , 2018 .
[30] Taiji Suzuki,et al. Functional Gradient Boosting based on Residual Network Perception , 2018, ICML.
[31] David A. Wagner,et al. Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examples , 2018, ICML.
[32] Aditi Raghunathan,et al. Certified Defenses against Adversarial Examples , 2018, ICLR.
[33] J. Zico Kolter,et al. Provable defenses against adversarial examples via the convex outer adversarial polytope , 2017, ICML.
[34] Nathan Srebro,et al. The Implicit Bias of Gradient Descent on Separable Data , 2017, J. Mach. Learn. Res..
[35] Aleksander Madry,et al. Towards Deep Learning Models Resistant to Adversarial Attacks , 2017, ICLR.
[36] John Langford,et al. Learning Deep ResNet Blocks Sequentially using Boosting Theory , 2017, ICML.
[37] David A. Wagner,et al. Towards Evaluating the Robustness of Neural Networks , 2016, 2017 IEEE Symposium on Security and Privacy (SP).
[38] Yin Tat Lee,et al. Kernel-based methods for bandit convex optimization , 2016, STOC.
[39] Pascal Frossard,et al. Analysis of classifiers’ robustness to adversarial perturbations , 2015, Machine Learning.
[40] H. Brendan McMahan,et al. A survey of Algorithms and Analysis for Adaptive Online Learning , 2014, J. Mach. Learn. Res..
[41] Elad Hazan,et al. Introduction to Online Convex Optimization , 2016, Found. Trends Optim..
[42] Tianqi Chen,et al. XGBoost: A Scalable Tree Boosting System , 2016, KDD.
[43] Alexandre M. Bayen,et al. The Hedge Algorithm on a Continuum , 2015, ICML.
[44] Jonathon Shlens,et al. Explaining and Harnessing Adversarial Examples , 2014, ICLR.
[45] Joan Bruna,et al. Intriguing properties of neural networks , 2013, ICLR.
[46] Robert E. Schapire,et al. A theory of multiclass boosting , 2010, J. Mach. Learn. Res..
[47] Matus Telgarsky. The Fast Convergence of Boosting , 2011, NIPS.
[48] Jean-Yves Audibert. Fast learning rates in statistical inference through aggregation , 2007, math/0703854.
[49] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[50] Gunnar Rätsch,et al. Efficient Margin Maximizing with Boosting , 2005, J. Mach. Learn. Res..
[51] Peter L. Bartlett,et al. Improved Generalization Through Explicit Optimization of Margins , 2000, Machine Learning.
[52] J. Picard,et al. Statistical learning theory and stochastic optimization : École d'eté de probabilités de Saint-Flour XXXI - 2001 , 2004 .
[53] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[54] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[55] Peter L. Bartlett,et al. Boosting Algorithms as Gradient Descent , 1999, NIPS.
[56] Leo Breiman,et al. Prediction Games and Arcing Algorithms , 1999, Neural Computation.
[57] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.
[58] Peter L. Bartlett,et al. The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network , 1998, IEEE Trans. Inf. Theory.
[59] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.
[60] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.
[61] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[62] M. Sion. On general minimax theorems , 1958 .
[63] K Fan,et al. Minimax Theorems. , 1953, Proceedings of the National Academy of Sciences of the United States of America.