Search Results for author:
Found 70 papers, 24 papers with code
Original Content Is All You Need! an Empirical Study on Leveraging Answer Summary for WikiHowQA Answer Selection Task
And their experiments show that leveraging the answer summaries helps to attend the essential information in original lengthy answers and improve the answer selection performance under certain circumstances.
Semantic-Enhanced Differentiable Search Index Inspired by Learning Strategies
Specifically, we assign each document an Elaborative Description based on the query generation technique, which is more meaningful than a string of integers in the original DSI; and (2) For the associations between a document and its identifier, we take inspiration from Rehearsal Strategies in human learning.
Unconfounded Propensity Estimation for Unbiased Ranking
The goal of unbiased learning to rank (ULTR) is to leverage implicit user feedback for optimizing learning-to-rank systems.
Boosting Event Extraction with Denoised Structure-to-Text Augmentation
Event extraction aims to recognize pre-defined event triggers and arguments from texts, which suffer from the lack of high-quality annotations.
Disentangled Contrastive Collaborative Filtering
Recent studies show that graph neural networks (GNNs) are prevalent to model high-order relationships for collaborative filtering (CF).
Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agent
Large Language Models (LLMs) have demonstrated a remarkable ability to generalize zero-shot to various language-related tasks.
Learning to Tokenize for Generative Retrieval
As an alternative, generative retrieval represents documents as identifiers (docid) and retrieves documents by generating docids, enabling end-to-end modeling of document retrieval tasks.
User Retention-oriented Recommendation with Decision Transformer
However, deploying the DT in recommendation is a non-trivial problem because of the following challenges: (1) deficiency in modeling the numerical reward value; (2) data discrepancy between the policy learning and recommendation generation; (3) unreliable offline performance evaluation.
Layout-aware Webpage Quality Assessment
To assess webpage quality from complex DOM tree data, we propose a graph neural network (GNN) based method that extracts rich layout-aware information that implies webpage quality in an end-to-end manner.
Feature-Level Debiased Natural Language Understanding
We also propose a dynamic negative sampling strategy to capture the dynamic influence of biases by employing a bias-only model to dynamically select the most similar biased negative samples.
PILE: Pairwise Iterative Logits Ensemble for Multi-Teacher Labeled Distillation
In this paper, we focus on two key questions in knowledge distillation for ranking models: 1) how to ensemble knowledge from multi-teacher; 2) how to utilize the label information of data in the distillation process.
Whole Page Unbiased Learning to Rank
To address the above challenges, we propose a Bias Agnostic whole-page unbiased Learning to rank algorithm, BAL, to automatically discover and mitigate the biases from multiple SERP features with no specific design.
CPS-MEBR: Click Feedback-Aware Web Page Summarization for Multi-Embedding-Based Retrieval
Meanwhile, we introduce sentence-level semantic interaction to design a multi-embedding-based retrieval (MEBR) model, which can generate multiple embeddings to deal with different potential queries by using frequently clicked sentences in web pages.
Approximated Doubly Robust Search Relevance Estimation
We further instantiate the proposed unbiased relevance estimation framework in Baidu search, with comprehensive practical solutions designed regarding the data pipeline for click behavior tracking and online relevance estimation with an approximated deep neural network.
Model-based Unbiased Learning to Rank
Existing methods in unbiased learning to rank typically rely on click modeling or inverse propensity weighting (IPW).
Factorized and Controllable Neural Re-Rendering of Outdoor Scene for Photo Extrapolation
Expanding an existing tourist photo from a partially captured scene to a full scene is one of the desired experiences for photography applications.
A Large Scale Search Dataset for Unbiased Learning to Rank
The unbiased learning to rank (ULTR) problem has been greatly advanced by recent deep learning techniques and well-designed debias algorithms.
Geometry Contrastive Learning on Heterogeneous Graphs
Self-supervised learning (especially contrastive learning) methods on heterogeneous graphs can effectively get rid of the dependence on supervisory data.
Are Graph Neural Networks Really Helpful for Knowledge Graph Completion?
This suggests a conflation of scoring function design, loss function design, and aggregation in prior work, with promising insights regarding the scalability of state-of-the-art KGC methods today, as well as careful attention to more suitable aggregation designs for KGC tasks tomorrow.
A Simple yet Effective Framework for Active Learning to Rank
To handle the diverse query requests from users at web-scale, Baidu has done tremendous efforts in understanding users' queries, retrieve relevant contents from a pool of trillions of webpages, and rank the most relevant webpages on the top of results.
ERNIE-Search: Bridging Cross-Encoder with Dual-Encoder via Self On-the-fly Distillation for Dense Passage Retrieval
Our method 1) introduces a self on-the-fly distillation method that can effectively distill late interaction (i. e., ColBERT) to vanilla dual-encoder, and 2) incorporates a cascade distillation process to further improve the performance with a cross-encoder teacher.
Hypergraph Contrastive Collaborative Filtering
Additionally, our HCCF model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems, based on the hypergraph-enhanced self-discrimination.
Incorporating Explicit Knowledge in Pre-trained Language Models for Passage Re-ranking
To leverage a reliable knowledge, we propose a novel knowledge graph distillation method and obtain a knowledge meta graph as the bridge between query and passage.
Graph Enhanced BERT for Query Understanding
In other words, GE-BERT can capture both the semantic information and the users' search behavioral information of queries.
Sequential Recommendation with User Evolving Preference Decomposition
To solve this problem, in this paper, we propose a novel sequential recommender model via decomposing and modeling user independent preferences.
Contrastive Meta Learning with Behavior Multiplicity for Recommendation
In addition, to capture the diverse multi-behavior patterns, we design a contrastive meta network to encode the customized behavior heterogeneity for different users.
Gumble Softmax For User Behavior Modeling
We propose a sequential model with dynamic number of representations for recommendation systems (RDRSR).
User behavior understanding in real world settings
It is necessary to learn a dynamic group of representations according the item groups in a user historical behavior.
Global Context Enhanced Social Recommendation with Hierarchical Graph Neural Networks
Social recommendation which aims to leverage social connections among users to enhance the recommendation performance.
On Length Divergence Bias in Textual Matching Models
To determine whether TM models have adopted such heuristic, we introduce an adversarial evaluation scheme which invalidates the heuristic.
Enhancing Question Generation with Commonsense Knowledge
Question generation (QG) is to generate natural and grammatical questions that can be answered by a specific answer for a given context.
Pre-trained Language Model for Web-scale Retrieval in Baidu Search
More importantly, we present a practical system workflow for deploying the model in web-scale retrieval.
Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimation
Based on it, a more robust doubly robust (MRDR) estimator has been proposed to further reduce its variance while retaining its double robustness.
Pre-trained Language Model based Ranking in Baidu Search
However, it is nontrivial to directly apply these PLM-based rankers to the large-scale web search system due to the following challenging issues:(1) the prohibitively expensive computations of massive neural PLMs, especially for long texts in the web-document, prohibit their deployments in an online ranking system that demands extremely low latency;(2) the discrepancy between existing ranking-agnostic pre-training objectives and the ad-hoc retrieval scenarios that demand comprehensive relevance modeling is another main barrier for improving the online ranking system;(3) a real-world search engine typically involves a committee of ranking components, and thus the compatibility of the individually fine-tuned ranking model is critical for a cooperative ranking system.
Data-Efficient Reinforcement Learning for Malaria Control
This work introduces a practical, data-efficient policy learning method, named Variance-Bonus Monte Carlo Tree Search~(VB-MCTS), which can copy with very little data and facilitate learning from scratch in only a few trials.
First Target and Opinion then Polarity: Enhancing Target-opinion Correlation for Aspect Sentiment Triplet Extraction
Aspect Sentiment Triplet Extraction (ASTE) aims to extract triplets from a sentence, including target entities, associated sentiment polarities, and opinion spans which rationalize the polarities.
Ranked #8 on
Aspect Sentiment Triplet Extraction
on ASTE-Data-V2
User-Inspired Posterior Network for Recommendation Reason Generation
A simple and effective way is to extract keywords directly from the knowledge-base of products, i. e., attributes or title, as the recommendation reason.
SceneRec: Scene-Based Graph Neural Networks for Recommender Systems
Collaborative filtering has been largely used to advance modern recommender systems to predict user preference.
Modeling Topical Relevance for Multi-Turn Dialogue Generation
Therefore, an ideal dialogue generation models should be able to capture the topic information of each context, detect the relevant context, and produce appropriate responses accordingly.
Neural Interactive Collaborative Filtering
Therefore, the proposed exploration policy, to balance between learning the user profile and making accurate recommendations, can be directly optimized by maximizing users' long-term satisfaction with reinforcement learning.
CAST: A Correlation-based Adaptive Spectral Clustering Algorithm on Multi-scale Data
We study the problem of applying spectral clustering to cluster multi-scale data, which is data whose clusters are of various sizes and densities.
Robust Reinforcement Learning with Wasserstein Constraint
Robust Reinforcement Learning aims to find the optimal policy with some extent of robustness to environmental dynamics.
Data Manipulation: Towards Effective Instance Learning for Neural Dialogue Generation via Learning to Augment and Reweight
In this paper, we propose a data manipulation framework to proactively reshape the data distribution towards reliable samples by augmenting and highlighting effective learning samples as well as reducing the effect of inefficient samples simultaneously.
Posterior-GAN: Towards Informative and Coherent Response Generation with Posterior Generative Adversarial Network
Neural conversational models learn to generate responses by taking into account the dialog history.
Learning from Easy to Complex: Adaptive Multi-curricula Learning for Neural Dialogue Generation
Current state-of-the-art neural dialogue systems are mainly data-driven and are trained on human-generated responses.
Adaptive Parameterization for Neural Dialogue Generation
For each conversation, the model generates parameters of the encoder-decoder by referring to the input context.
GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks
In this paper, we propose GraphLIME, a local interpretable model explanation for graphs using the Hilbert-Schmidt Independence Criterion (HSIC) Lasso, which is a nonlinear feature selection method.
Attribute-aware Sequence Network for Review Summarization
Review summarization aims to generate a condensed summary for a review or multiple reviews.
Off-policy Learning for Multiple Loggers
To make full use of such historical data, learning policies from multiple loggers becomes necessary.
Deep Social Collaborative Filtering
Meanwhile, most of these models treat neighbors' information equally without considering the specific recommendations.
Toward Simulating Environments in Reinforcement Learning Based Recommendations
Thus, it calls for a user simulator that can mimic real users' behaviors where we can pre-train and evaluate new recommendation algorithms.
Graph Neural Networks for Social Recommendation
These advantages of GNNs provide great potential to advance social recommendation since data in social recommender systems can be represented as user-user social graph and user-item graph; and learning latent factors of users and items is the key.
Ranked #3 on
Recommendation Systems
on Epinions
(using extra training data)
Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systems
Though reinforcement learning~(RL) naturally fits the problem of maximizing the long term rewards, applying RL to optimize long-term user engagement is still facing challenges: user behaviors are versatile and difficult to model, which typically consists of both instant feedback~(e. g. clicks, ordering) and delayed feedback~(e. g. dwell time, revisit); in addition, performing effective off-policy learning is still immature, especially when combining bootstrapping and function approximation.
Whole-Chain Recommendations
With the recent prevalence of Reinforcement Learning (RL), there have been tremendous interests in developing RL-based recommender systems.
Multi-agent Reinforcement Learning
Recommendation Systems
+1
Product-Aware Answer Generation in E-Commerce Question-Answering
In this paper, we propose the task of product-aware answer generation, which tends to generate an accurate and complete answer from large-scale unlabeled e-commerce reviews and product attributes.
Ranked #1 on
Question Answering
on JD Product Question Answer
Deep reinforcement learning for search, recommendation, and online advertising: a survey
Search, recommendation, and online advertising are the three most important information-providing mechanisms on the web.
Streaming Graph Neural Networks
Current graph neural network models cannot utilize the dynamic information in dynamic graphs.
Explicit State Tracking with Semi-Supervision for Neural Dialogue Generation
However, the \emph{expensive nature of state labeling} and the \emph{weak interpretability} make the dialogue state tracking a challenging problem for both task-oriented and non-task-oriented dialogue generation: For generating responses in task-oriented dialogues, state tracking is usually learned from manually annotated corpora, where the human annotation is expensive for training; for generating responses in non-task-oriented dialogues, most of existing work neglects the explicit state tracking due to the unlimited number of dialogue states.
Linked Recurrent Neural Networks
Recurrent Neural Networks (RNNs) have been proven to be effective in modeling sequential data and they have been applied to boost a variety of tasks such as document classification, speech recognition and machine translation.
Multi-dimensional Graph Convolutional Networks
Convolutional neural networks (CNNs) leverage the great power in representation learning on regular grid data such as image and video.
Social and Information Networks
Sequicity: Simplifying Task-oriented Dialogue Systems with Single Sequence-to-Sequence Architectures
Existing solutions to task-oriented dialogue systems follow pipeline designs which introduces architectural complexity and fragility.
Knowledge Diffusion for Neural Dialogue Generation
Our empirical study on a real-world dataset prove that our model is capable of generating meaningful, diverse and natural responses for both factoid-questions and knowledge grounded chi-chats.
Deep Reinforcement Learning for Page-wise Recommendations
In particular, we propose a principled approach to jointly generate a set of complementary items and the corresponding strategy to display them in a 2-D page; and propose a novel page-wise recommendation framework based on deep reinforcement learning, DeepPage, which can optimize a page of items with proper display based on real-time feedback from users.
Recommendations with Negative Feedback via Pairwise Deep Reinforcement Learning
Users' feedback can be positive and negative and both types of feedback have great potentials to boost recommendations.
Deep Reinforcement Learning for List-wise Recommendations
Recommender systems play a crucial role in mitigating the problem of information overload by suggesting users' personalized items or services.
A Survey on Dialogue Systems: Recent Advances and New Frontiers
Dialogue systems have attracted more and more attention.
Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
However, sophisticated learning models are computationally unfeasible for data with millions of features.
Streaming Recommender Systems
The increasing popularity of real-world recommender systems produces data continuously and rapidly, and it becomes more realistic to study recommender systems under streaming scenarios.
Consistent Collective Matrix Completion under Joint Low Rank Structure
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations.
N$^3$LARS: Minimum Redundancy Maximum Relevance Feature Selection for Large and High-dimensional Data
We propose a feature selection method that finds non-redundant features from a large and high-dimensional data in nonlinear way.
