Demo Data from VLDB 2026 / reviewers in the wild / expert
Qiu Ran
dblp:237/9718
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
3 papers |
Machine translation · 55% Language models and text generation · 31% Question answering and dialogue systems · 14% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Machine translation › neural machine translation
non-autoregressive machine translation |
0.9 | 2 | 2021 | Guiding Non-Autoregressive Neural Machine Translation Decoding with Reordering Information · AAAI 2021 Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine Translation · ACL 2020 |
Natural language and speech › Language models and text generation › decoding
semi-autoregressive decoding |
0.4 | 1 | 2020 | Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine Translation · ACL 2020 |
Natural language and speech › Question answering and dialogue systems
machine reading comprehension |
0.4 | 1 | 2019 | NumNet: Machine Reading Comprehension with Numerical Reasoning · EMNLP/IJCNLP (1) 2019 |
Natural language and speech › Language models and text generation › mathematical reasoning
numerical reasoning |
0.4 | 1 | 2019 | NumNet: Machine Reading Comprehension with Numerical Reasoning · EMNLP/IJCNLP (1) 2019 |
Methods — techniques the papers use, named apart from their topics
reordering modeling · 0.5non-autoregressive decoding · 0.5sequence-to-sequence learning · 0.4numerical reasoning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Guiding Non-Autoregressive Neural Machine Translation Decoding with Reordering InformationabstractNon-autoregressive neural machine translation (NAT) generates each target word in parallel and has achieved promising inference acceleration. However, existing NAT models still have a big gap in translation quality compared to autoregressive neural machine translation models due to the multimodality problem: the target words may come from multiple feasible translations. To address this problem, we propose a novel NAT framework ReorderNAT which explicitly models the reordering information to guide the decoding of NAT. Specially, ReorderNAT utilizes deterministic and non-deterministic decoding strategies that leverage reordering information as a proxy for the final translation to encourage the decoder to choose words belonging to the same translation. Experimental results on various widely-used datasets show that our proposed model achieves better performance compared to most existing NAT models, and even achieves comparable translation quality as autoregressive translation models with a significant speedup. Qiu Ran, Yankai Lin 0001, Peng Li 0030, Jie Zhou 0016 |
AAAI | 1 |
| 2020 | Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine TranslationabstractNon-autoregressive neural machine translation (NAT) predicts the entire target sequence simultaneously and significantly accelerates inference process.However, NAT discards the dependency information in a sentence, and thus inevitably suffers from the multi-modality problem: the target tokens may be provided by different possible translations, often causing token repetitions or missing.To alleviate this problem, we propose a novel semiautoregressive model RecoverSAT in this work, which generates a translation as a sequence of segments.The segments are generated simultaneously while each segment is predicted token-by-token.By dynamically determining segment length and deleting repetitive segments, RecoverSAT is capable of recovering from repetitive and missing token errors.Experimental results on three widelyused benchmark datasets show that our proposed model achieves more than 4× speedup while maintaining comparable performance compared with the corresponding autoregressive model. * indicates equal contribution † indicates corresponding author Src.es gibt heute viele Farmer mit diesem AnsatzFeasible there are lots of farmers doing this today Trans.there are a lot of farmers doing this todayTrans. 1 there are lots of of farmers doing this today Trans. 2 there are a lot farmers doing this today Qiu Ran, Yankai Lin 0001, Peng Li 0030, Jie Zhou 0016 |
ACL | 1 |
| 2019 | NumNet: Machine Reading Comprehension with Numerical ReasoningabstractQiu Ran, Yankai Lin, Peng Li, Jie Zhou, Zhiyuan Liu. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019. Qiu Ran, Yankai Lin 0001, Peng Li 0030, Jie Zhou 0016, Zhiyuan Liu 0001 |
EMNLP/IJCNLP (1) | 1 |