Search Results for author:
Found 15 papers, 5 papers with code
Augmenting Legal Judgment Prediction with Contrastive Case Relations
Existing legal judgment prediction methods usually only consider one single case fact description as input, which may not fully utilize the information in the data such as case relations and frequency.
BMLP: Behavior-aware MLP for Heterogeneous Sequential Recommendation
In real recommendation scenarios, users often have different types of behaviors, such as clicking and buying.
Privacy-Preserving Cross-Domain Sequential Recommendation
It combines the characteristics of sequential recommender systems and cross-domain recommender systems, which can capture the dynamic preferences of users and alleviate the problem of cold-start users.
A Survey on Cross-Domain Sequential Recommendation
Cross-domain sequential recommendation (CDSR) shifts the modeling of user preferences from flat to stereoscopic by integrating and learning interaction information from multiple domains at different granularities (ranging from inter-sequence to intra-sequence and from single-domain to cross-domain).
A Survey on Multi-Behavior Sequential Recommendation
MBSR is a relatively new and worthy direction for in-depth research, which can achieve state-of-the-art recommendation through suitable modeling, and some related works have been proposed.
GNN4FR: A Lossless GNN-based Federated Recommendation Framework
Graph neural networks (GNNs) have gained wide popularity in recommender systems due to their capability to capture higher-order structure information among the nodes of users and items.
DPFormer: Learning Differentially Private Transformer on Long-Tailed Data
The Transformer has emerged as a versatile and effective architecture with broad applications.
Bounding System-Induced Biases in Recommender Systems with A Randomized Dataset
To bridge this gap, we study the debiasing problem from a new perspective and propose to directly minimize the upper bound of an ideal objective function, which facilitates a better potential solution to the system-induced biases.
Self-Sampling Training and Evaluation for the Accuracy-Bias Tradeoff in Recommendation
Specifically, SSTE uses a self-sampling module to generate some subsets with different degrees of bias from the original training and validation data.
DIWIFT: Discovering Instance-wise Influential Features for Tabular Data
Tabular data is one of the most common data storage formats behind many real-world web applications such as retail, banking, and e-commerce.
An Efficient Industrial Federated Learning Framework for AIoT: A Face Recognition Application
Recently, the artificial intelligence of things (AIoT) has been gaining increasing attention, with an intriguing vision of providing highly intelligent services through the network connection of things, leading to an advanced AI-driven ecology.
PAS: A Position-Aware Similarity Measurement for Sequential Recommendation
The common item-based collaborative filtering framework becomes a typical recommendation method when equipped with a certain item-to-item similarity measurement.
PrivateRec: Differentially Private Training and Serving for Federated News Recommendation
Collecting and training over sensitive personal data raise severe privacy concerns in personalized recommendation systems, and federated learning can potentially alleviate the problem by training models over decentralized user data. However, a theoretically private solution in both the training and serving stages of federated recommendation is essential but still lacking. Furthermore, naively applying differential privacy (DP) to the two stages in federated recommendation would fail to achieve a satisfactory trade-off between privacy and utility due to the high-dimensional characteristics of model gradients and hidden representations. In this work, we propose a federated news recommendation method for achieving a better utility in model training and online serving under a DP guarantee. We first clarify the DP definition over behavior data for each round in the life-circle of federated recommendation systems. Next, we propose a privacy-preserving online serving mechanism under this definition based on the idea of decomposing user embeddings with public basic vectors and perturbing the lower-dimensional combination coefficients.
Collaborative Recommendation with Auxiliary Data: A Transfer Learning View
In this paper, we consider the CRAD problem from a transfer learning view, especially on how to achieve knowledge transfer from some auxiliary data.
Accelerated Gradient Methods for Stochastic Optimization and Online Learning
Regularized risk minimization often involves non-smooth optimization, either because of the loss function (e. g., hinge loss) or the regularizer (e. g., $\ell_1$-regularizer).
