Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bin Fang 0009

dblp:94/4033-9 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0009-0000-1305-5957ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › adversarial robustness
adversarial training
0.812024
Re-Thinking Data Availability Attacks Against Deep Neural Networks · CVPR 2024
Security and privacy of machine learning › adversarial attack
availability attack
0.812024
Re-Thinking Data Availability Attacks Against Deep Neural Networks · CVPR 2024
Security and privacy of machine learning › poisoning attack
unlearnable examples
0.812024
Re-Thinking Data Availability Attacks Against Deep Neural Networks · CVPR 2024

Methods — techniques the papers use, named apart from their topics

min-max-min optimization · 0.8adversarial training · 0.8
YearPublicationVenuePosition
2024 Re-Thinking Data Availability Attacks Against Deep Neural Networks
abstract
The unauthorized use of personal data for commercial purposes and the covert acquisition of private data for training machine learning models continue to raise concerns. To address these issues, researchers have proposed availability attacks that aim to render data unexploitable. However, many availability attack methods can be easily disrupted by adversarial training. Although some robust methods can resist adversarial training, their protective effects are limited. In this paper, we re-examine the existing availability attack methods and propose a novel two-stage min-max-min optimization paradigm to generate robust unlearnable noise. The inner min stage is utilized to generate unlearnable noise, while the outer min-max stage simulates the training process of the poisoned model. Additionally, we formulate the attack effects and use it to constrain the optimization objective. Comprehensive experiments have revealed that the noise generated by our method can lead to a decline in test accuracy for adversarially trained poisoned models by up to approximately 30%, in comparison to SOTA methods.11Code is available at EuterpeK/Rethinking-Data-Availability-Attacks
Bin Fang 0009, Bo Li 0115, Shuang Wu 0001, Shouhong Ding, Ran Yi 0002, Lizhuang Ma
CVPR1
2023 Image Fusion Based on Feature Decoupling and Proportion Preserving
Bin Fang 0009, Ran Yi 0002, Lizhuang Ma
CAD/Graphics1