Search Results for author: Hongyan Bao

Found 5 papers, 0 papers with code

Defending Jailbreak Prompts via In-Context Adversarial Game

no code implementations20 Feb 2024 Yujun Zhou, Yufei Han, Haomin Zhuang, Taicheng Guo, Kehan Guo, Zhenwen Liang, Hongyan Bao, Xiangliang Zhang

Large Language Models (LLMs) demonstrate remarkable capabilities across diverse applications.

AdvCat: Domain-Agnostic Robustness Assessment for Cybersecurity-Critical Applications with Categorical Inputs

no code implementations13 Dec 2022 Helene Orsini, Hongyan Bao, Yujun Zhou, Xiangrui Xu, Yufei Han, Longyang Yi, Wei Wang, Xin Gao, Xiangliang Zhang

Machine Learning-as-a-Service systems (MLaaS) have been largely developed for cybersecurity-critical applications, such as detecting network intrusions and fake news campaigns.

Adversarial Robustness Fake News Detection +1

Towards Efficient and Domain-Agnostic Evasion Attack with High-dimensional Categorical Inputs

no code implementations13 Dec 2022 Hongyan Bao, Yufei Han, Yujun Zhou, Xin Gao, Xiangliang Zhang

Our work targets at searching feasible adversarial perturbation to attack a classifier with high-dimensional categorical inputs in a domain-agnostic setting.

Towards Understanding the Robustness Against Evasion Attack on Categorical Data

no code implementations ICLR 2022 Hongyan Bao, Yufei Han, Yujun Zhou, Yun Shen, Xiangliang Zhang

Characterizing and assessing the adversarial vulnerability of classification models with categorical input has been a practically important, while rarely explored research problem.

Classification

PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization

no code implementations25 Aug 2020 Zhize Li, Hongyan Bao, Xiangliang Zhang, Peter Richtárik

Then, we show that PAGE obtains the optimal convergence results $O(n+\frac{\sqrt{n}}{\epsilon^2})$ (finite-sum) and $O(b+\frac{\sqrt{b}}{\epsilon^2})$ (online) matching our lower bounds for both nonconvex finite-sum and online problems.

Cannot find the paper you are looking for? You can Submit a new open access paper.