Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Binsheng Liu

dblp:51/10219 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 86% Query processing and optimization · 14%
Artificial intelligence
1 paper
Language models and text generation · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval
neural ranking model
0.512021
Generalizing Discriminative Retrieval Models using Generative Tasks · WWW 2021
Information retrieval
retrieval models
0.512021
Generalizing Discriminative Retrieval Models using Generative Tasks · WWW 2021
Query processing and optimization › multi-query optimization
query fusion
0.412019
From Query Variations To Learned Relevance Modeling · SIGIR 2019
Information retrieval › query understanding
query variation
0.412019
From Query Variations To Learned Relevance Modeling · SIGIR 2019
Information retrieval › ranking › search relevance
relevance modeling
0.412019
From Query Variations To Learned Relevance Modeling · SIGIR 2019

Methods — techniques the papers use, named apart from their topics

transformer · 1.0multi-task learning · 1.0cross-training · 1.0query enrichment · 0.4fusion techniques · 0.4
YearPublicationVenuePosition
2021 Generalizing Discriminative Retrieval Models using Generative Tasks
abstract
Information Retrieval has a long history of applying either discriminative or generative modeling to retrieval and ranking tasks. Recent developments in transformer architectures and multi-task learning techniques have dramatically improved our ability to train effective neural models capable of resolving a wide variety of tasks using either of these paradigms. In this paper, we propose a novel multi-task learning approach which can be used to produce more effective neural ranking models. The key idea is to improve the quality of the underlying transformer model by cross-training a retrieval task and one or more complementary language generation tasks. By targeting the training on the encoding layer in the transformer architecture, our experimental results show that the proposed multi-task learning approach consistently improves retrieval effectiveness on the targeted collection and can easily be re-targeted to new ranking tasks. We provide an in-depth analysis showing how multi-task learning modifies model behaviors, resulting in more general models.
Binsheng Liu, Hamed Zamani, Xiaolu Lu 0002, J. Shane Culpepper
WWW1
2021 Strong natural language query generation
Binsheng Liu, Xiaolu Lu 0002, J. Shane Culpepper
Inf. Retr. J.1
2019 From Query Variations To Learned Relevance Modeling
abstract
Thinking in terms of an information need instead of simply queries provides a rich set of new opportunities in improving the effectiveness of search [6]. User queries may vary a lot for a single information need [3, 9], as a query is often under-specified. Many techniques have been proposed to enrich a single query, for example relevance modeling [8]. These techniques focus on improving overall system performance but may fail in some occasions. Instead of optimizing for a single query, another direction is to use multiple query variations to represent an information need. With fusion techniques, query variations can improve system performance while failing fewer queries [2, 6].
Binsheng Liu
SIGIR1