Search Results for author:
Found 20 papers, 5 papers with code
AdaBERT: Task-Adaptive BERT Compression with Differentiable Neural Architecture Search
Motivated by the necessity and benefits of task-oriented BERT compression, we propose a novel compression method, AdaBERT, that leverages differentiable Neural Architecture Search to automatically compress BERT into task-adaptive small models for specific tasks.
APG: Adaptive Parameter Generation Network for Click-Through Rate Prediction
In many web applications, deep learning-based CTR prediction models (deep CTR models for short) are widely adopted.
ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performance
Most of ranking models are trained only with displayed items (most are hot items), but they are utilized to retrieve items in the entire space which consists of both displayed and non-displayed items (most are long-tail items).
CATN: Cross-Domain Recommendation for Cold-Start Users via Aspect Transfer Network
Given two relevant domains (e. g., Book and Movie), users may have interactions with items in one domain but not in the other domain.
Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Models
However, far less attention has been paid to the overfitting problem of models in recommendation systems, which, on the contrary, is recognized as a critical issue for deep neural networks.
Gated Group Self-Attention for Answer Selection
Nevertheless, it is difficult for RNN based models to capture the information about long-range dependency among words in the sentences of questions and answers.
CAN: Feature Co-Action for Click-Through Rate Prediction
For example, a simple attempt to learn the combination of feature A and feature B <A, B> as the explicit cartesian product representation of new features can outperform previous implicit feature interaction models including factorization machine (FM)-based models and their variations.
Explanation as a Defense of Recommendation
At training time, the two learning tasks are joined by a latent sentiment vector, which is encoded by the recommendation module and used to make word choices for explanation generation.
One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Prediction
Concretely, STAR has the star topology, which consists of the shared centered parameters and domain-specific parameters.
Learning a Product Relevance Model from Click-Through Data in E-Commerce
We propose a novel way to consider samples of different relevance confidence, and come up with a new training objective to learn a robust relevance model with desirable score distribution.
Path-based Deep Network for Candidate Item Matching in Recommenders
PDN utilizes Trigger Net to capture the user's interest in each of his/her interacted item, and Similarity Net to evaluate the similarity between each interacted item and the target item based on these items' profile and CF information.
DemiNet: Dependency-Aware Multi-Interest Network with Self-Supervised Graph Learning for Click-Through Rate Prediction
In this paper, we propose a novel model named DemiNet (short for DEpendency-Aware Multi-Interest Network) to address the above two issues.
Comparative Explanations of Recommendations
As recommendation is essentially a comparative (or ranking) process, a good explanation should illustrate to users why an item is believed to be better than another, i. e., comparative explanations about the recommended items.
Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction
We further show that such a process is equivalent to adding an adversarial perturbation to the model input, and thereby name our proposed approach as an the Adversarial Gradient Driven Exploration (AGE).
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation
In this paper, we propose a novel method to extend ANN search to arbitrary matching functions, e. g., a deep neural network.
GBA: A Tuning-free Approach to Switch between Synchronous and Asynchronous Training for Recommendation Model
High-concurrency asynchronous training upon parameter server (PS) architecture and high-performance synchronous training upon all-reduce (AR) architecture are the most commonly deployed distributed training modes for recommendation models.
Joint Optimization of Ranking and Calibration with Contextualized Hybrid Model
It can be attributed to the calibration ability of the pointwise loss since the prediction can be viewed as the click probability.
KEEP: An Industrial Pre-Training Framework for Online Recommendation via Knowledge Extraction and Plugging
To alleviate this issue, we propose to extract knowledge from the \textit{super-domain} that contains web-scale and long-time impression data, and further assist the online recommendation task (downstream task).
Multi-Scenario Ranking with Adaptive Feature Learning
Recently, Multi-Scenario Learning (MSL) is widely used in recommendation and retrieval systems in the industry because it facilitates transfer learning from different scenarios, mitigating data sparsity and reducing maintenance cost.
