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

Kaitao Zhang

dblp:257/3347 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2021
0000-0002-8394-2137ORCID · corroborated

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

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

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
3 papers
Information retrieval · 87% Machine learning and data management · 13%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
neural retrieval
0.922021
OpenMatch: An Open Source Library for Neu-IR Research · SIGIR 2021
Selective Weak Supervision for Neural Information Retrieval · WWW 2020
Information retrieval › retrieval models
ad-hoc retrieval
0.512021
OpenMatch: An Open Source Library for Neu-IR Research · SIGIR 2021
Information retrieval › interactive information retrieval › conversational information seeking
conversational search
0.512021
OpenMatch: An Open Source Library for Neu-IR Research · SIGIR 2021
Information retrieval
ranking
0.512021
OpenMatch: An Open Source Library for Neu-IR Research · SIGIR 2021
Information retrieval
retrieval models
0.512021
Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision · ACL/IJCNLP (1) 2021
Information retrieval › ranking
text ranking
0.512021
Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision · ACL/IJCNLP (1) 2021
Machine learning and data management
weak supervision
0.512021
Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision · ACL/IJCNLP (1) 2021

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

synthetic data generation · 0.5meta-learning · 0.5few-shot training · 0.5reinforcement learning · 0.4policy gradient · 0.4learning to rank · 0.4
YearPublicationVenuePosition
2021 Few-Shot Text Ranking with Meta Adapted Synthetic Weak Supervision
abstract
Si Sun, Yingzhuo Qian, Zhenghao Liu, Chenyan Xiong, Kaitao Zhang, Jie Bao, Zhiyuan Liu, Paul Bennett. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021.
Si Sun, Yingzhuo Qian, Zhenghao Liu 0001, Chenyan Xiong, Kaitao Zhang, Zhiyuan Liu 0001, Paul N. Bennett
ACL/IJCNLP (1)5
2021 OpenMatch: An Open Source Library for Neu-IR Research
abstract
OpenMatch is a Python-based library that serves for Neural Information Retrieval (Neu-IR) research. It provides self-contained neural and traditional IR modules, making it easy to build customized and higher-capacity IR systems. In order to develop the advantages of Neu-IR models for users, OpenMatch provides implementations of recent neural IR models, complicated experiment instructions, and advanced few-shot training methods. OpenMatch reproduces corresponding ranking results of previous work on widely-used IR benchmarks, liberating users from surplus labor in baseline reimplementation. Our OpenMatch-based solutions conduct top-ranked empirical results on various ranking tasks, such as ad hoc retrieval and conversational retrieval, illustrating the convenience of OpenMatch to facilitate building an effective IR system. The library, experimental methodologies and results of OpenMatch are all publicly available at https://github.com/thunlp/OpenMatch.
Zhenghao Liu 0001, Kaitao Zhang, Chenyan Xiong, Zhiyuan Liu 0001, Maosong Sun 0001
SIGIR2
2020 Selective Weak Supervision for Neural Information Retrieval
abstract
This paper democratizes neural information retrieval to scenarios where large scale relevance training signals are not available. We revisit the classic IR intuition that anchor-document relations approximate query-document relevance and propose a reinforcement weak supervision selection method, ReInfoSelect, which learns to select anchor-document pairs that best weakly supervise the neural ranker (action), using the ranking performance on a handful of relevance labels as the reward. Iteratively, for a batch of anchor-document pairs, ReInfoSelect back propagates the gradients through the neural ranker, gathers its NDCG reward, and optimizes the data selection network using policy gradients, until the neural ranker’s performance peaks on target relevance metrics (convergence). In our experiments on three TREC benchmarks, neural rankers trained by ReInfoSelect, with only publicly available anchor data, significantly outperform feature-based learning to rank methods and match the effectiveness of neural rankers trained with private commercial search logs. Our analyses show that ReInfoSelect effectively selects weak supervision signals based on the stage of the neural ranker training, and intuitively picks anchor-document pairs similar to query-document pairs.
Kaitao Zhang, Chenyan Xiong, Zhenghao Liu 0001, Zhiyuan Liu 0001
WWW1