activity
20172021
most citedFace Translation between Images and Videos using Identity-aware CycleGAN

8 citations · 9 across the 3 of their papers we have counts for

collaborators

10 papers

cs.CL2022

QA Domain Adaptation using Hidden Space Augmentation and Self-Supervised Contrastive Adaptation

Zhenrui Yue, Huimin Zeng, Bernhard Kratzwald +2

Question answering (QA) has recently shown impressive results for answering questions from customized domains. Yet, a common challenge is to adapt QA models to an unseen target dom…

cs.CL2021

Contrastive Domain Adaptation for Question Answering using Limited Text Corpora

Zhenrui Yue, Bernhard Kratzwald, Stefan Feuerriegel

Question generation has recently shown impressive results in customizing question answering (QA) systems to new domains. These approaches circumvent the need for manually annotated…

cs.CL20201 cited

Learning a Cost-Effective Annotation Policy for Question Answering

Bernhard Kratzwald, Stefan Feuerriegel, Huan Sun

State-of-the-art question answering (QA) relies upon large amounts of training data for which labeling is time consuming and thus expensive. For this reason, customizing QA systems…

cs.CL2020

Practical Annotation Strategies for Question Answering Datasets

Bernhard Kratzwald, Xiang Yue, Huan Sun +1

Annotating datasets for question answering (QA) tasks is very costly, as it requires intensive manual labor and often domain-specific knowledge. Yet strategies for annotating QA da…

cs.CL2019

RankQA: Neural Question Answering with Answer Re-Ranking

Bernhard Kratzwald, Anna Eigenmann, Stefan Feuerriegel

The conventional paradigm in neural question answering (QA) for narrative content is limited to a two-stage process: first, relevant text passages are retrieved and, subsequently,…

stat.ML2019

Sample Complexity Bounds for Recurrent Neural Networks with Application to Combinatorial Graph Problems

Nil-Jana Akpinar, Bernhard Kratzwald, Stefan Feuerriegel

Learning to predict solutions to real-valued combinatorial graph problems promises efficient approximations. As demonstrated based on the NP-hard edge clique cover number, recurren…