Demo Data from EDBT 2026 / reviewers in the wild / expert
Sara Romiti
dblp:326/0044
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0002-1980-6798ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers |
Efficient and distributed learning · 28% Transfer learning and domain adaptation · 28% Learning paradigms · 28% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › semi-supervised learning
consistency regularization |
0.6 | 1 | 2022 | Okapi: Generalising Better by Making Statistical Matches Match · NeurIPS 2022 |
Machine learning › Efficient and distributed learning › model reuse
model patching |
0.6 | 1 | 2022 | RealPatch: A Statistical Matching Framework for Model Patching with Real Samples · ECCV (25) 2022 |
Machine learning › Transfer learning and domain adaptation › domain adaptation › low-resource domain adaptation
semi-supervised domain adaptation |
0.6 | 1 | 2022 | Okapi: Generalising Better by Making Statistical Matches Match · NeurIPS 2022 |
Machine learning › Trustworthy machine learning
out-of-distribution generalization |
0.2 | 1 | 2022 | Okapi: Generalising Better by Making Statistical Matches Match · NeurIPS 2022 |
Machine learning › Trustworthy machine learning
robustness |
0.2 | 1 | 2022 | Okapi: Generalising Better by Making Statistical Matches Match · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
statistical matching · 0.6nearest-neighbor matching · 0.6momentum encoder · 0.6memory bank · 0.6consistency loss · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | RealPatch: A Statistical Matching Framework for Model Patching with Real Samples
Sara Romiti, Christopher Inskip, Viktoriia Sharmanska, Novi Quadrianto |
ECCV (25) | 1 |
| 2022 | Okapi: Generalising Better by Making Statistical Matches MatchabstractWe propose Okapi, a simple, efficient, and general method for robust semi-supervised learning based on online statistical matching. Our method uses a nearest-neighbours-based matching procedure to generate cross-domain views for a consistency loss, while eliminating statistical outliers. In order to perform the online matching in a runtime- and memory-efficient way, we draw upon the self-supervised literature and combine a memory bank with a slow-moving momentum encoder. The consistency loss is applied within the feature space, rather than on the predictive distribution, making the method agnostic to both the modality and the task in question. We experiment on the WILDS 2.0 datasets Sagawa et al., which significantly expands the range of modalities, applications, and shifts available for studying and benchmarking real-world unsupervised adaptation. Contrary to Sagawa et al., we show that it is in fact possible to leverage additional unlabelled data to improve upon empirical risk minimisation (ERM) results with the right method. Our method outperforms the baseline methods in terms of out-of-distribution (OOD) generalisation on the iWildCam (a multi-class classification task) and PovertyMap (a regression task) image datasets as well as the CivilComments (a binary classification task) text dataset. Furthermore, from a qualitative perspective, we show the matches obtained from the learned encoder are strongly semantically related. Code for our paper is publicly available at https://github.com/wearepal/okapi/. Myles Bartlett, Sara Romiti, Viktoriia Sharmanska, Novi Quadrianto |
NeurIPS | 2 |