1,738 research outputs found
Group is better than individual: Exploiting Label Topologies and Label Relations for Joint Multiple Intent Detection and Slot Filling
Recent joint multiple intent detection and slot filling models employ label
embeddings to achieve the semantics-label interactions. However, they treat all
labels and label embeddings as uncorrelated individuals, ignoring the
dependencies among them. Besides, they conduct the decoding for the two tasks
independently, without leveraging the correlations between them. Therefore, in
this paper, we first construct a Heterogeneous Label Graph (HLG) containing two
kinds of topologies: (1) statistical dependencies based on labels'
co-occurrence patterns and hierarchies in slot labels; (2) rich relations among
the label nodes. Then we propose a novel model termed ReLa-Net. It can capture
beneficial correlations among the labels from HLG. The label correlations are
leveraged to enhance semantic-label interactions. Moreover, we also propose the
label-aware inter-dependent decoding mechanism to further exploit the label
correlations for decoding. Experiment results show that our ReLa-Net
significantly outperforms previous models. Remarkably, ReLa-Net surpasses the
previous best model by over 20\% in terms of overall accuracy on MixATIS
dataset.Comment: Accepted to EMNLP 2022 Main Conferenc
Efficient-FedRec: Efficient Federated Learning Framework for Privacy-Preserving News Recommendation
News recommendation is critical for personalized news access. Most existing
news recommendation methods rely on centralized storage of users' historical
news click behavior data, which may lead to privacy concerns and hazards.
Federated Learning is a privacy-preserving framework for multiple clients to
collaboratively train models without sharing their private data. However, the
computation and communication cost of directly learning many existing news
recommendation models in a federated way are unacceptable for user clients. In
this paper, we propose an efficient federated learning framework for
privacy-preserving news recommendation. Instead of training and communicating
the whole model, we decompose the news recommendation model into a large news
model maintained in the server and a light-weight user model shared on both
server and clients, where news representations and user model are communicated
between server and clients. More specifically, the clients request the user
model and news representations from the server, and send their locally computed
gradients to the server for aggregation. The server updates its global user
model with the aggregated gradients, and further updates its news model to
infer updated news representations. Since the local gradients may contain
private information, we propose a secure aggregation method to aggregate
gradients in a privacy-preserving way. Experiments on two real-world datasets
show that our method can reduce the computation and communication cost on
clients while keep promising model performance
- …