Yitong Li 0002

dblp:127/0252-2 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0003-0640-5992ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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
5 papers
Trustworthy machine learning · 34% Efficient and distributed learning · 27% Transfer learning and domain adaptation · 19%
Network and information security
3 papers
Privacy and data protection · 90% Cryptographic primitives and cryptanalysis · 5% Network security · 5%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
1.022022
How to Democratise and Protect AI: Fair and Differentially Private Decentralised Deep Learning · IEEE Trans. Dependable Secur. Comput. 2022
Towards Differentially Private Text Representations · SIGIR 2020
Machine learning › Representation and self-supervised learning › text embedding
text representation learning
0.722020
Towards Differentially Private Text Representations · SIGIR 2020
Learning Robust Representations of Text · EMNLP 2016
Machine learning › Trustworthy machine learning
fairness
0.612022
How to Democratise and Protect AI: Fair and Differentially Private Decentralised Deep Learning · IEEE Trans. Dependable Secur. Comput. 2022
Machine learning › Efficient and distributed learning › federated learning › trustworthy federated learning
fair federated learning
0.412020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Machine learning › Efficient and distributed learning
federated learning
0.412020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Privacy and data protection › privacy-preserving machine learning
federated learning privacy
0.412020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Privacy and data protection › differential privacy
local differential privacy
0.412020
Towards Differentially Private Text Representations · SIGIR 2020
Privacy and data protection
privacy-preserving machine learning
0.412020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Machine learning › Transfer learning and domain adaptation › cross-domain learning
multi-domain learning
0.412019
Semi-supervised Stochastic Multi-Domain Learning using Variational Inference · ACL (1) 2019
Machine learning › Transfer learning and domain adaptation › domain adaptation › low-resource domain adaptation
semi-supervised domain adaptation
0.412019
Semi-supervised Stochastic Multi-Domain Learning using Variational Inference · ACL (1) 2019
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.212016
Learning Robust Representations of Text · EMNLP 2016
Machine learning › Trustworthy machine learning
robustness
0.212016
Learning Robust Representations of Text · EMNLP 2016
Machine learning › Trustworthy machine learning › robustness
robust representations
0.212016
Learning Robust Representations of Text · EMNLP 2016
Cryptographic primitives and cryptanalysis
encryption
0.112020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Network security › anonymity networks
onion routing encryption
0.112020
Towards Fair and Privacy-Preserving Federated Deep Models · IEEE Trans. Parallel Distributed Syst. 2020
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.112019
Semi-supervised Stochastic Multi-Domain Learning using Variational Inference · ACL (1) 2019

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

reputation system · 1.1differentially private SGD · 1.1differentially private GAN · 1.1differential privacy · 1.1randomization · 0.9onion-style encryption · 0.9local differential privacy · 0.9local credibility evaluation · 0.9latent variable model · 0.4adversarial learning · 0.4
YearPublicationVenuePosition
2022 How to Democratise and Protect AI: Fair and Differentially Private Decentralised Deep Learning
abstract
This article first considers the research problem of fairness in collaborative deep learning, while ensuring privacy. A novel reputation system is proposed through digital tokens and local credibility to ensure fairness, in combination with differential privacy to guarantee privacy. In particular, we build a fair and differentially private decentralised deep learning framework called FDPDDL, which enables parties to derive more accurate local models in a fair and private manner by using our developed two-stage scheme: during the initialisation stage, artificial samples generated by Differentially Private Generative Adversarial Network (DPGAN) are used to mutually benchmark the local credibility of each party and generate initial tokens; during the update stage, Differentially Private SGD (DPSGD) is used to facilitate collaborative privacy-preserving deep learning, and local credibility and tokens of each party are updated according to the quality and quantity of individually released gradients. Experimental results on benchmark datasets under three realistic settings demonstrate that FDPDDL achieves high fairness, yields comparable accuracy to the centralised and distributed frameworks, and delivers better accuracy than the standalone framework.
Lingjuan Lyu, Yitong Li 0002, Karthik Nandakumar, Jiangshan Yu, Xingjun Ma
IEEE Trans. Dependable Secur. Comput.2
2020 Towards Differentially Private Text Representations
abstract
Most deep learning frameworks require users to pool their local data or model updates to a trusted server to train or maintain a global model. The assumption of a trusted server who has access to user information is ill-suited in many applications. To tackle this problem, we develop a new deep learning framework under an untrusted server setting, which includes three modules: (1) embedding module, (2) randomization module, and (3) classifier module. For the randomization module, we propose a novel local differentially private (LDP) protocol to reduce the impact of privacy parameter ε on accuracy, and provide enhanced flexibility in choosing randomization probabilities for LDP. Analysis and experiments show that our framework delivers comparable or even better performance than the non-private framework and existing LDP protocols, demonstrating the advantages of our LDP protocol.
Lingjuan Lyu, Yitong Li 0002, Xuanli He, Tong Xiao 0001
SIGIR2
2020 Towards Fair and Privacy-Preserving Federated Deep Models
abstract
The current standalone deep learning framework tends to result in overfitting and low utility. This problem can be addressed by either a centralized framework that deploys a central server to train a global model on the joint data from all parties, or a distributed framework that leverages a parameter server to aggregate local model updates. Server-based solutions are prone to the problem of a single-point-of-failure. In this respect, collaborative learning frameworks, such as federated learning (FL), are more robust. Existing federated learning frameworks overlook an important aspect of participation: fairness. All parties are given the same final model without regard to their contributions. To address these issues, we propose a decentralized Fair and Privacy-Preserving Deep Learning (FPPDL) framework to incorporate fairness into federated deep learning models. In particular, we design a local credibility mutual evaluation mechanism to guarantee fairness, and a three-layer onion-style encryption scheme to guarantee both accuracy and privacy. Different from existing FL paradigm, under FPPDL, each participant receives a different version of the FL model with performance commensurate with his contributions. Experiments on benchmark datasets demonstrate that FPPDL balances fairness, privacy and accuracy. It enables federated learning ecosystems to detect and isolate low-contribution parties, thereby promoting responsible participation.
Lingjuan Lyu, Jiangshan Yu, Karthik Nandakumar, Yitong Li 0002, Xingjun Ma, Jiong Jin, Han Yu 0001, Kee Siong Ng
IEEE Trans. Parallel Distributed Syst.4
2019 Semi-supervised Stochastic Multi-Domain Learning using Variational Inference
abstract
Supervised models of NLP rely on large collections of text which closely resemble the intended testing setting.Unfortunately matching text is often not available in sufficient quantity, and moreover, within any domain of text, data is often highly heterogenous.In this paper we propose a method to distill the important domain signal as part of a multi-domain learning system, using a latent variable model in which parts of a neural model are stochastically gated based on the inferred domain.We compare the use of discrete versus continuous latent variables, operating in a domain-supervised or a domain semi-supervised setting, where the domain is known only for a subset of training inputs.We show that our model leads to substantial performance improvements over competitive benchmark domain adaptation methods, including methods using adversarial learning.
Yitong Li 0002, Timothy Baldwin, Trevor Cohn
ACL (1)1
2018 Detecting Misflagged Duplicate Questions in Community Question-Answering Archives
Doris Hoogeveen, Andrew Bennett, Yitong Li 0002, Karin Verspoor, Timothy Baldwin
ICWSM3
2016 Learning Robust Representations of Text
abstract
Deep neural networks have achieved remarkable results across many language processing tasks, however these methods are highly sensitive to noise and adversarial attacks.We present a regularization based method for limiting network sensitivity to its inputs, inspired by ideas from computer vision, thus learning models that are more robust.Empirical evaluation over a range of sentiment datasets with a convolutional neural network shows that, compared to a baseline model and the dropout method, our method achieves superior performance over noisy inputs and out-of-domain data. 1
Yitong Li 0002, Trevor Cohn, Timothy Baldwin
EMNLP1