Search Results for author:
Found 44 papers, 21 papers with code
Dense Retrieval Adaptation using Target Domain Description
In information retrieval (IR), domain adaptation is the process of adapting a retrieval model to a new domain whose data distribution is different from the source domain.
Generalized Weak Supervision for Neural Information Retrieval
To address this issue, one can train NRMs via weak supervision, where a large dataset is automatically generated using an existing ranking model (called the weak labeler) for training NRMs.
Evaluating Fairness in Argument Retrieval
In this work, we analyze a range of non-stochastic fairness-aware ranking and diversity metrics to evaluate the extent to which argument stances are fairly exposed in argument retrieval systems.
Asking Clarifying Questions Based on Negative Feedback in Conversational Search
To quickly identify user intent and reduce effort during interactions, we propose an intent clarification task based on yes/no questions where the system needs to ask the correct question about intents within the fewest conversation turns.
Passage Retrieval for Outside-Knowledge Visual Question Answering
We first conduct sparse retrieval with BM25 and study expanding the question with object names and image captions.
A Neural Passage Model for Ad-hoc Document Retrieval
Traditional statistical retrieval models often treat each document as a whole.
Weakly-Supervised Open-Retrieval Conversational Question Answering
Our method is more flexible as it can handle both span answers and freeform answers.
Context-Aware Target Apps Selection and Recommendation for Enhancing Personal Mobile Assistants
Here we focus on context-aware models to leverage the rich contextual information available to mobile devices.
Guided Transformer: Leveraging Multiple External Sources for Representation Learning in Conversational Search
Asking clarifying questions in response to ambiguous or faceted queries has been recognized as a useful technique for various information retrieval systems, especially conversational search systems with limited bandwidth interfaces.
Open-Retrieval Conversational Question Answering
We build an end-to-end system for ORConvQA, featuring a retriever, a reranker, and a reader that are all based on Transformers.
A Transformer-based Embedding Model for Personalized Product Search
Aware of these limitations, we propose a transformer-based embedding model (TEM) for personalized product search, which could dynamically control the influence of personalization by encoding the sequence of query and user's purchase history with a transformer architecture.
Learning a Fine-Grained Review-based Transformer Model for Personalized Product Search
RTM conducts review-level matching between the user and item, where each review has a dynamic effect according to the context in the sequence.
AREDSUM: Adaptive Redundancy-Aware Iterative Sentence Ranking for Extractive Document Summarization
Redundancy-aware extractive summarization systems score the redundancy of the sentences to be included in a summary either jointly with their salience information or separately as an additional sentence scoring step.
IART: Intent-aware Response Ranking with Transformers in Information-seeking Conversation Systems
We also perform case studies and analysis of learned user intent and its impact on response ranking in information-seeking conversations to provide interpretation of results.
The Challenges of Optimizing Machine Translation for Low Resource Cross-Language Information Retrieval
When performing cross-language information retrieval (CLIR) for lower-resourced languages, a common approach is to retrieve over the output of machine translation (MT).
Explainable Product Search with a Dynamic Relation Embedding Model
Specifically, we propose to model the "search and purchase" behavior as a dynamic relation between users and items, and create a dynamic knowledge graph based on both the multi-relational product data and the context of the search session.
A Study of Context Dependencies in Multi-page Product Search
In this paper, we study RF techniques based on both long-term and short-term context dependencies in multi-page product search.
Conversational Product Search Based on Negative Feedback
So in this paper, we propose a conversational paradigm for product search driven by non-relevant items, based on which fine-grained feedback is collected and utilized to show better results in the next iteration.
Leverage Implicit Feedback for Context-aware Product Search
However, customers with little or no purchase history do not benefit from personalized product search.
A Zero Attention Model for Personalized Product Search
In this paper, we formulate the problem of personalized product search and conduct large-scale experiments with search logs sampled from a commercial e-commerce search engine.
Attentive History Selection for Conversational Question Answering
First, we propose a positional history answer embedding method to encode conversation history with position information using BERT in a natural way.
Asking Clarifying Questions in Open-Domain Information-Seeking Conversations
In this paper, we formulate the task of asking clarifying questions in open-domain information-seeking conversational systems.
ANTIQUE: A Non-Factoid Question Answering Benchmark
Despite the importance of the task, the community still feels the significant lack of large-scale non-factoid question answering collections with real questions and comprehensive relevance judgments.
BERT with History Answer Embedding for Conversational Question Answering
One of the major challenges to multi-turn conversational search is to model the conversation history to answer the current question.
Investigating the Successes and Failures of BERT for Passage Re-Ranking
The bidirectional encoder representations from transformers (BERT) model has recently advanced the state-of-the-art in passage re-ranking.
A Deep Look into Neural Ranking Models for Information Retrieval
Ranking models lie at the heart of research on information retrieval (IR).
Learning to Selectively Transfer: Reinforced Transfer Learning for Deep Text Matching
Specifically, the data selector "acts" on the source domain data to find a subset for optimization of the TL model, and the performance of the TL model can provide "rewards" in turn to update the selector.
Revisiting Iterative Relevance Feedback for Document and Passage Retrieval
We conduct extensive experiments to analyze and compare IRF with the standard top-k RF framework on document and passage retrieval.
From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing
In this work, we propose a standalone neural ranking model (SNRM) by introducing a sparsity property to learn a latent sparse representation for each query and document.
Ranked #12 on
Ad-Hoc Information Retrieval
on TREC Robust04
Transfer Learning for Context-Aware Question Matching in Information-seeking Conversations in E-commerce
Building multi-turn information-seeking conversation systems is an important and challenging research topic.
Cross Domain Regularization for Neural Ranking Models Using Adversarial Learning
We use an adversarial discriminator and train our neural ranking model on a small set of domains.
Information Retrieval
Response Ranking with Deep Matching Networks and External Knowledge in Information-seeking Conversation Systems
Our models and research findings provide new insights on how to utilize external knowledge with deep neural models for response selection and have implications for the design of the next generation of information-seeking conversation systems.
Analyzing and Characterizing User Intent in Information-seeking Conversations
Understanding and characterizing how people interact in information-seeking conversations is crucial in developing conversational search systems.
Learning a Deep Listwise Context Model for Ranking Refinement
Specifically, we employ a recurrent neural network to sequentially encode the top results using their feature vectors, learn a local context model and use it to re-rank the top results.
Unbiased Learning to Rank with Unbiased Propensity Estimation
We find that the problem of estimating a propensity model from click data is a dual problem of unbiased learning to rank.
aNMM: Ranking Short Answer Texts with Attention-Based Neural Matching Model
As an alternative to question answering methods based on feature engineering, deep learning approaches such as convolutional neural networks (CNNs) and Long Short-Term Memory Models (LSTMs) have recently been proposed for semantic matching of questions and answers.
Ranked #12 on
Question Answering
on TrecQA
A Deep Relevance Matching Model for Ad-hoc Retrieval
Specifically, our model employs a joint deep architecture at the query term level for relevance matching.
Ranked #14 on
Ad-Hoc Information Retrieval
on TREC Robust04
Joint Representation Learning for Top-N Recommendation with Heterogeneous Information Sources
In this framework, each type of information source (review text, product image, numerical rating, etc) is adopted to learn the corresponding user and item representations based on available (deep) representation learning architectures.
Neural Matching Models for Question Retrieval and Next Question Prediction in Conversation
We further evaluate the neural matching models in the next question prediction task in conversations.
Relevance-based Word Embedding
This is the motivation for developing unsupervised relevance-based word embedding models that learn word representations based on query-document relevance information.
Neural Ranking Models with Weak Supervision
Our experiments indicate that employing proper objective functions and letting the networks to learn the input representation based on weakly supervised data leads to impressive performance, with over 13% and 35% MAP improvements over the BM25 model on the Robust and the ClueWeb collections.
Ranked #8 on
Ad-Hoc Information Retrieval
on TREC Robust04
(MAP metric)
Adaptability of Neural Networks on Varying Granularity IR Tasks
Recent work in Information Retrieval (IR) using Deep Learning models has yielded state of the art results on a variety of IR tasks.
