Search Results for author:
Found 13 papers, 9 papers with code
Evaluating Interpolation and Extrapolation Performance of Neural Retrieval Models
For example, representation-based retrieval models perform almost as well as interaction-based retrieval models in terms of interpolation but not extrapolation.
Interacting with Non-Cooperative User: A New Paradigm for Proactive Dialogue Policy
To this end, we contribute to advance the study of the proactive dialogue policy to a more natural and challenging setting, i. e., interacting dynamically with users.
KuaiRec: A Fully-observed Dataset for Recommender Systems
This entails the significance of our fully-observed data in researching many directions in recommender systems, e. g., the unbiased recommendation, interactive/conversational recommendation, and evaluation.
Interpreting Dense Retrieval as Mixture of Topics
Dense Retrieval (DR) reaches state-of-the-art results in first-stage retrieval, but little is known about the mechanisms that contribute to its success.
Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval
However, the efficiency of most existing DR models is limited by the large memory cost of storing dense vectors and the time-consuming nearest neighbor search (NNS) in vector space.
POSSCORE: A Simple Yet Effective Evaluation of Conversational Search with Part of Speech Labelling
Conversational search systems, such as Google Assistant and Microsoft Cortana, provide a new search paradigm where users are allowed, via natural language dialogues, to communicate with search systems.
Jointly Optimizing Query Encoder and Product Quantization to Improve Retrieval Performance
Compared with previous DR models that use brute-force search, JPQ almost matches the best retrieval performance with 30x compression on index size.
Optimizing Dense Retrieval Model Training with Hard Negatives
ADORE replaces the widely-adopted static hard negative sampling method with a dynamic one to directly optimize the ranking performance.
THUIR@COLIEE-2020: Leveraging Semantic Understanding and Exact Matching for Legal Case Retrieval and Entailment
We participated in the two case law tasks, i. e., the legal case retrieval task and the legal case entailment task.
Learning To Retrieve: How to Train a Dense Retrieval Model Effectively and Efficiently
Through this process, it teaches the DR model how to retrieve relevant documents from the entire corpus instead of how to rerank a potentially biased sample of documents.
Neural Logic Reasoning
Both reasoning and generalization ability are important for prediction tasks such as recommender systems, where reasoning provides strong connection between user history and target items for accurate prediction, and generalization helps the model to draw a robust user portrait over noisy inputs.
RepBERT: Contextualized Text Embeddings for First-Stage Retrieval
Although exact term match between queries and documents is the dominant method to perform first-stage retrieval, we propose a different approach, called RepBERT, to represent documents and queries with fixed-length contextualized embeddings.
Unbiased Learning to Rank: Online or Offline?
While their definitions of \textit{unbiasness} are different, these two types of ULTR algorithms share the same goal -- to find the best models that rank documents based on their intrinsic relevance or utility.
