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

Danyang Yue

dblp:297/1441 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-6018-1996ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 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.

Artificial intelligence
1 paper
Trustworthy machine learning · 62% Optimization for machine learning · 38%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › privacy › privacy-preserving machine learning
privacy-preserving deep learning
0.712023
Differentially Private Deep Learning With Dynamic Privacy Budget Allocation and Adaptive Optimization · IEEE Trans. Inf. Forensics Secur. 2023
Privacy and data protection
differential privacy
0.712023
Differentially Private Deep Learning With Dynamic Privacy Budget Allocation and Adaptive Optimization · IEEE Trans. Inf. Forensics Secur. 2023
Machine learning › Optimization for machine learning
adaptive optimization
0.212023
Differentially Private Deep Learning With Dynamic Privacy Budget Allocation and Adaptive Optimization · IEEE Trans. Inf. Forensics Secur. 2023
Machine learning › Optimization for machine learning › gradient-based optimization
gradient descent
0.212023
Differentially Private Deep Learning With Dynamic Privacy Budget Allocation and Adaptive Optimization · IEEE Trans. Inf. Forensics Secur. 2023

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

sinh-normal noise · 1.3noisymin · 1.3layer-wise relevance propagation · 1.3gradient clipping · 1.3
YearPublicationVenuePosition
2023 Differentially Private Deep Learning With Dynamic Privacy Budget Allocation and Adaptive Optimization
abstract
Deep learning (DL) has been adopted in a broad range of Internet-of-Things (IoT) applications such as auto-driving, intelligent healthcare and smart grids, but limitations such as those relating to data and user privacy can complicate its broader implementation. Seeking to jointly address both privacy and utility, in this paper we connect the layer-wise relevance propagation with gradient descent for injecting proper noise into gradients. We also improve the conventional gradient clipping method by dividing the gradients into several groups; thus, minimizing the gradient distortion. Since the noisy gradient causes the undetermined descent direction and might adversely affect the loss minimization, we use the NoisyMin algorithm to select the best step size for each gradient perturbation. Finally, we integrate the adaptive optimizer into the gradient descent. In addition to improving the model utility, we also leverage the leading Sinh-Normal noise addition mechanism to achieve truncated concentrated differential privacy (tCDP) – as demonstrated by our rigorous analysis. Our experimental evaluations also validate the effectiveness of the proposed algorithm.
Lin Chen 0033, Danyang Yue, Xiaofeng Ding 0001, Zuan Wang, Kim-Kwang Raymond Choo, Hai Jin 0001
IEEE Trans. Inf. Forensics Secur.2
2021 The generative adversarial network improved by channel relationship learning mechanisms
Danyang Yue, Jianxu Luo
Neurocomputing1