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

Renyu Li

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

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

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

Artificial intelligence
1 paper
Trustworthy machine learning · 67% Information extraction and text analysis · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.612022
GAPX: Generalized Autoregressive Paraphrase-Identification X · NeurIPS 2022
Natural language and speech › Information extraction and text analysis › text similarity
paraphrase identification
0.612022
GAPX: Generalized Autoregressive Paraphrase-Identification X · NeurIPS 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
GAPX: Generalized Autoregressive Paraphrase-Identification X · NeurIPS 2022

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

positive/negative model separation · 0.6perplexity-based OOD metric · 0.6
YearPublicationVenuePosition
2022 GAPX: Generalized Autoregressive Paraphrase-Identification X
abstract
Paraphrase Identification is a fundamental task in Natural Language Processing. While much progress has been made in the field, the performance of many state-of- the-art models often suffer from distribution shift during inference time. We verify that a major source of this performance drop comes from biases introduced by negative examples. To overcome these biases, we propose in this paper to train two separate models, one that only utilizes the positive pairs and the other the negative pairs. This enables us the option of deciding how much to utilize the negative model, for which we introduce a perplexity based out-of-distribution metric that we show can effectively and automatically determine how much weight it should be given during inference. We support our findings with strong empirical results.
Renyu Li, Hayden Housen, Ser-Nam Lim
NeurIPS2