Kangmin Tan

dblp:318/3080 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 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.

Artificial intelligence
2 papers
Information extraction and text analysis · 33% Language models and text generation · 17% Robot manipulation · 17%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
cross-task generalization
0.612022
Unsupervised Cross-Task Generalization via Retrieval Augmentation · NeurIPS 2022
Natural language and speech › Language models and text generation
in-context learning
0.612022
Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER · ACL (1) 2022
Robotics › Robot manipulation
learning from demonstration
0.612022
Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER · ACL (1) 2022
Natural language and speech › Information extraction and text analysis › named entity recognition
low-resource named entity recognition
0.612022
Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER · ACL (1) 2022
Machine learning › Learning paradigms › multi-task learning
multi-task language model
0.612022
Unsupervised Cross-Task Generalization via Retrieval Augmentation · NeurIPS 2022
Natural language and speech › Information extraction and text analysis
named entity recognition
0.612022
Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER · ACL (1) 2022
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.612022
Unsupervised Cross-Task Generalization via Retrieval Augmentation · NeurIPS 2022
Information retrieval
retrieval augmentation
0.612022
Unsupervised Cross-Task Generalization via Retrieval Augmentation · NeurIPS 2022

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

retrieval augmentation · 1.1pairwise reranking · 0.6pair-wise reranking · 0.6demonstration-based learning · 0.6
YearPublicationVenuePosition
2022 Good Examples Make A Faster Learner: Simple Demonstration-based Learning for Low-resource NER
abstract
Dong-Ho Lee, Akshen Kadakia, Kangmin Tan, Mahak Agarwal, Xinyu Feng, Takashi Shibuya, Ryosuke Mitani, Toshiyuki Sekiya, Jay Pujara, Xiang Ren. Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2022.
Akshen Kadakia, Kangmin Tan, Mahak Agarwal, Takashi Shibuya 0001, Ryosuke Mitani, Toshiyuki Sekiya, Jay Pujara, Xiang Ren 0001
ACL (1)3
2022 Unsupervised Cross-Task Generalization via Retrieval Augmentation
abstract
Humans can perform unseen tasks by recalling relevant skills acquired previously and then generalizing them to the target tasks, even if there is no supervision at all. In this paper, we aim to improve this kind of cross-task generalization ability of massive multi-task language models, such as T0 and FLAN, in an unsupervised setting. We propose a retrieval-augmentation method named ReCross that takes a few unlabelled examples as queries to retrieve a small subset of upstream data and uses them to update the multi-task model for better generalization. ReCross is a straightforward yet effective retrieval method that combines both efficient dense retrieval and effective pair-wise reranking. Our results and analysis show that it significantly outperforms both non-retrieval methods and other baseline methods.
Bill Y. Lin, Kangmin Tan, Beiwen Tian, Xiang Ren 0001
NeurIPS2