28 citations · 66 across the 10 of their papers we have counts for
5 papers · 1 filter
Towards Strong Certified Defense with Universal Asymmetric Randomization
Hanbin Hong, Ashish Kundu, Ali Payani +2
Randomized smoothing has become essential for achieving certified adversarial robustness in machine learning models. However, current methods primarily use isotropic noise distribu…
Certifying Adapters: Enabling and Enhancing the Certification of Classifier Adversarial Robustness
Jieren Deng, Hanbin Hong, Aaron Palmer +5
Randomized smoothing has become a leading method for achieving certified robustness in deep classifiers against l_{p}-norm adversarial perturbations. Current approaches for achievi…
Certifiable Black-Box Attacks with Randomized Adversarial Examples: Breaking Defenses with Provable Confidence
Hanbin Hong, Xinyu Zhang, Binghui Wang +2
Black-box adversarial attacks have demonstrated strong potential to compromise machine learning models by iteratively querying the target model or leveraging transferability from a…
OpBoost: A Vertical Federated Tree Boosting Framework Based on Order-Preserving Desensitization
Xiaochen Li, Yuke Hu, Weiran Liu +5
Vertical Federated Learning (FL) is a new paradigm that enables users with non-overlapping attributes of the same data samples to jointly train a model without directly sharing the…
UniCR: Universally Approximated Certified Robustness via Randomized Smoothing
Hanbin Hong, Binghui Wang, Yuan Hong
We study certified robustness of machine learning classifiers against adversarial perturbations. In particular, we propose the first universally approximated certified robustness (…