Demo Data from EDBT 2026 / reviewers in the wild / expert
Karl Ridgeway
dblp:91/7216
· DBLP profile ↗
4ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Representation and self-supervised learning · 64% Transfer learning and domain adaptation · 36% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
deep embedding |
0.3 | 1 | 2018 | Learning Deep Disentangled Embeddings With the F-Statistic Loss · NeurIPS 2018 |
Machine learning › Representation and self-supervised learning › representation learning › metric learning
deep metric learning |
0.3 | 1 | 2018 | Adapted Deep Embeddings: A Synthesis of Methods for k-Shot Inductive Transfer Learning · NeurIPS 2018 |
Machine learning › Representation and self-supervised learning › representation learning
disentangled representation learning |
0.3 | 1 | 2018 | Learning Deep Disentangled Embeddings With the F-Statistic Loss · NeurIPS 2018 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.3 | 1 | 2018 | Adapted Deep Embeddings: A Synthesis of Methods for k-Shot Inductive Transfer Learning · NeurIPS 2018 |
Machine learning › Transfer learning and domain adaptation › knowledge transfer
inductive transfer learning |
0.3 | 1 | 2018 | Adapted Deep Embeddings: A Synthesis of Methods for k-Shot Inductive Transfer Learning · NeurIPS 2018 |
Machine learning › Representation and self-supervised learning › representation learning
metric learning |
0.3 | 1 | 2018 | Learning Deep Disentangled Embeddings With the F-Statistic Loss · NeurIPS 2018 |
Machine learning › Transfer learning and domain adaptation › knowledge transfer
parameter transfer |
0.1 | 1 | 2018 | Adapted Deep Embeddings: A Synthesis of Methods for k-Shot Inductive Transfer Learning · NeurIPS 2018 |
Methods — techniques the papers use, named apart from their topics
recall@k evaluation · 0.3histogram loss · 0.3fine-tuning · 0.3few-shot learning · 0.3f-statistic loss · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Benchmarking Egocentric Multimodal Goal Inference for Assistive Wearable AgentsabstractThere has recently been a surge of interest in Wearable Assistant Agents: agents embodied in a wearable form factor such as smart glasses, who can take actions toward a user’s stated goal — a high-level language-expressed command such as “where did I leave my keys?”, “Text Alice I will be late”, or “What’s the weather in Cancun?”. In this work, we consider the complementary problem of eliminating the effort required to interact with such an agent by proactively inferring the user’s goal from multimodal contextual observations. As vision-language models (VLMs) hold strong potential to ultimately solve this problem, our work focuses on creating a strong benchmark to measure progress toward this end. Given the limited prior work in this area, establishing the benchmark required collecting a novel multimodal goal-inference dataset; our dataset comprises ~30 hours of data from 363 participants across 3,482 recordings, featuring ground-truth reference goals alongside accompanying visual, audio, digital, and longitudinal contextual observations. We ran a human predictability study, where we found that humans set a strong baseline that comprises a de facto upper bound on model performance: they show multiple choice question (MCQ) accuracy of 93%, with the best VLM achieving about 84% accuracy. However, MCQ assesses discrimination, not the model’s ultimate task of generating the goal through open-ended text generation. Through a meta-evaluation, we find that a VLM judging the generated goals is as good as a human judge if it has access to a human-authored script of the video or a correct reference goal. Finally, we evaluate several families of modern vision-language models on the benchmark, showing that larger models have a significant performance advantage, but are still far from being practically useful, as they produce relevant goals only ~57% of the time. The best-performing smaller models—whose size makes them better suited to wearable applications—perform significantly worse than their counterparts, generating ~49% accuracy on the benchmark. Through a modality ablation, we show that models benefit from extra information in relevant modalities with minimal performance degradation from irrelevant modalities, but don’t gain as much when noisy modalities are included (e.g., in the case of digital context when most of the app state is irrelevant). Vijay Veerabadran, Fanyi Xiao, Nitin Kamra, Pedro Matias 0004, Joy Chen, Caley Drooff, Brett Roads, Riley Williams, Ethan Henderson, Xuanyi Zhao, Kevin Carlberg, Joseph Tighe, Karl Ridgeway |
NeurIPS | 13 |
| 2018 | Learning Deep Disentangled Embeddings With the F-Statistic LossabstractDeep-embedding methods aim to discover representations of a domain that make explicit the domain's class structure and thereby support few-shot learning. Disentangling methods aim to make explicit compositional or factorial structure. We combine these two active but independent lines of research and propose a new paradigm suitable for both goals. We propose and evaluate a novel loss function based on the $F$ statistic, which describes the separation of two or more distributions. By ensuring that distinct classes are well separated on a subset of embedding dimensions, we obtain embeddings that are useful for few-shot learning. By not requiring separation on all dimensions, we encourage the discovery of disentangled representations. Our embedding method matches or beats state-of-the-art, as evaluated by performance on recall@$k$ and few-shot learning tasks. Our method also obtains performance superior to a variety of alternatives on disentangling, as evaluated by two key properties of a disentangled representation: modularity and explicitness. The goal of our work is to obtain more interpretable, manipulable, and generalizable deep representations of concepts and categories. Karl Ridgeway, Michael C. Mozer |
NeurIPS | 1 |
| 2018 | Adapted Deep Embeddings: A Synthesis of Methods for k-Shot Inductive Transfer LearningabstractThe focus in machine learning has branched beyond training classifiers on a single task to investigating how previously acquired knowledge in a source domain can be leveraged to facilitate learning in a related target domain, known as inductive transfer learning. Three active lines of research have independently explored transfer learning using neural networks. In weight transfer, a model trained on the source domain is used as an initialization point for a network to be trained on the target domain. In deep metric learning, the source domain is used to construct an embedding that captures class structure in both the source and target domains. In few-shot learning, the focus is on generalizing well in the target domain based on a limited number of labeled examples. We compare state-of-the-art methods from these three paradigms and also explore hybrid adapted-embedding methods that use limited target-domain data to fine tune embeddings constructed from source-domain data. We conduct a systematic comparison of methods in a variety of domains, varying the number of labeled instances available in the target domain (k), as well as the number of target-domain classes. We reach three principal conclusions: (1) Deep embeddings are far superior, compared to weight transfer, as a starting point for inter-domain transfer or model re-use (2) Our hybrid methods robustly outperform every few-shot learning and every deep metric learning method previously proposed, with a mean error reduction of 34% over state-of-the-art. (3) Among loss functions for discovering embeddings, the histogram loss (Ustinova & Lempitsky, 2016) is most robust. We hope our results will motivate a unification of research in weight transfer, deep metric learning, and few-shot learning. Tyler R. Scott, Karl Ridgeway, Michael C. Mozer |
NeurIPS | 2 |
| 2017 | Learning to generate images with perceptual similarity metricsabstractDeep networks are increasingly being applied to problems involving image synthesis, e.g., generating images from textual descriptions and reconstructing an input image from a compact representation. Supervised training of image-synthesis networks typically uses a pixel-wise loss (PL) to indicate the mismatch between a generated image and its corresponding target image. We propose instead to use a loss function that is better calibrated to human perceptual judgments of image quality: the multiscale structural-similarity score (MS-SSIM) [1]. Because MS-SSIM is differentiable, it is easily incorporated into gradient-descent learning. We compare the consequences of using MS-SSIM versus PL loss on training autoencoders. Human observers reliably prefer images synthesized by MS-SSIM-optimized models over those synthesized by PL-optimized models, for two distinct PL measures (L1and L2distances). We also explore the effect of training objective on image encoding and analyze conditions under which perceptually-optimized representations yield better performance on image classification. Finally, we demonstrate the superiority of perceptually-optimized networks for super-resolution imaging. We argue that significant advances can be made in modeling images through the use of training objectives that are well aligned to characteristics of human perception. Jake Snell, Karl Ridgeway, Renjie Liao 0001, Brett Roads, Michael C. Mozer, Richard S. Zemel |
ICIP | 2 |