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

Katherine L. Hermann

dblp:254/1923 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
5since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 3 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 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
6 papers
Trustworthy machine learning · 60% Image recognition and object detection · 14% Reinforcement learning · 8%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.432024
Understanding Visual Feature Reliance through the Lens of Complexity · NeurIPS 2024
What shapes feature representations? Exploring datasets, architectures, and training · NeurIPS 2020
Improving neural network representations using human similarity judgments · NeurIPS 2023
Machine learning › Trustworthy machine learning › interpretability
feature complexity
0.812024
Understanding Visual Feature Reliance through the Lens of Complexity · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
On the Foundations of Shortcut Learning · ICLR 2024
Machine learning › Trustworthy machine learning › robustness
shortcut bias
0.812024
On the Foundations of Shortcut Learning · ICLR 2024
Machine learning › Trustworthy machine learning › robustness
shortcut learning
0.812024
On the Foundations of Shortcut Learning · ICLR 2024
Machine learning › Representation and self-supervised learning › representation matching
feature alignment
0.712023
Improving neural network representations using human similarity judgments · NeurIPS 2023
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.712023
Improving neural network representations using human similarity judgments · NeurIPS 2023
Computer vision › Image recognition and object detection
human similarity judgment
0.712023
Improving neural network representations using human similarity judgments · NeurIPS 2023
Computer vision › Image recognition and object detection
image classification
0.412020
The Origins and Prevalence of Texture Bias in Convolutional Neural Networks · NeurIPS 2020
Machine learning › Trustworthy machine learning › robustness › spurious correlation
texture bias
0.412020
The Origins and Prevalence of Texture Bias in Convolutional Neural Networks · NeurIPS 2020
Machine learning › Deep learning architectures and training
convolutional neural network
0.112020
The Origins and Prevalence of Texture Bias in Convolutional Neural Networks · NeurIPS 2020

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

v-information · 0.8neural tangent kernel · 0.8generative framework · 0.8linear alignment · 0.7global-local transform · 0.7synthetic dataset · 0.4shape-texture conflict · 0.4linear decodability · 0.4data augmentation · 0.4
YearPublicationVenuePosition
2024 On the Foundations of Shortcut Learning
abstract
Deep-learning models can extract a rich assortment of features from data. Which features a model uses depends not only on *predictivity*---how reliably a feature indicates training-set labels---but also on *availability*---how easily the feature can be extracted from inputs. The literature on shortcut learning has noted examples in which models privilege one feature over another, for example texture over shape and image backgrounds over foreground objects. Here, we test hypotheses about which input properties are more available to a model, and systematically study how predictivity and availability interact to shape models' feature use. We construct a minimal, explicit generative framework for synthesizing classification datasets with two latent features that vary in predictivity and in factors we hypothesize to relate to availability, and we quantify a model's shortcut bias---its over-reliance on the shortcut (more available, less predictive) feature at the expense of the core (less available, more predictive) feature. We find that linear models are relatively unbiased, but introducing a single hidden layer with ReLU or Tanh units yields a bias. Our empirical findings are consistent with a theoretical account based on Neural Tangent Kernels. Finally, we study how models used in practice trade off predictivity and availability in naturalistic datasets, discovering availability manipulations which increase models' degree of shortcut bias. Taken together, these findings suggest that the propensity to learn shortcut features is a fundamental characteristic of deep nonlinear architectures warranting systematic study given its role in shaping how models solve tasks.
Katherine L. Hermann, Hossein Mobahi, Thomas Fel, Michael C. Mozer
ICLR1
2024 Understanding Visual Feature Reliance through the Lens of Complexity
abstract
Recent studies suggest that deep learning models' inductive bias towards favoring simpler features may be an origin of shortcut learning. Yet, there has been limited focus on understanding the complexities of the myriad features that models learn. In this work, we introduce a new metric for quantifying feature complexity, based on V-information and capturing whether a feature requires complex computational transformations to be extracted. Using this V-information metric, we analyze the complexities of 10,000 features—represented as directions in the penultimate layer—that were extracted from a standard ImageNet-trained vision model. Our study addresses four key questions: First, we ask what features look like as a function of complexity, and find a spectrum of simple-to-complex features present within the model. Second, we ask when features are learned during training. We find that simpler features dominate early in training, and more complex features emerge gradually. Third, we investigate where within the network simple and complex features "flow," and find that simpler features tend to bypass the visual hierarchy via residual connections. Fourth, we explore the connection between features' complexity and their importance for driving the network's decision. We find that complex features tend to be less important. Surprisingly, important features become accessible at earlier layers during training, like a "sedimentation process," allowing the model to build upon these foundational elements.
Thomas Fel, Louis Béthune, Andrew K. Lampinen, Thomas Serre, Katherine L. Hermann
NeurIPS5
2023 Multitask Learning Via Interleaving: A Neural Network Investigation
David Mayo, Tyler R. Scott, Mengye Ren, Gamaledin Elsayed, Katherine L. Hermann, Matt Jones 0001, Michael C. Mozer
CogSci5
2023 Learning in temporally structured environments
Matt Jones 0001, Tyler R. Scott, Mengye Ren, Gamaleldin F. Elsayed, Katherine L. Hermann, David Mayo, Michael C. Mozer
ICLR5
2023 Improving neural network representations using human similarity judgments
abstract
Deep neural networks have reached human-level performance on many computer vision tasks. However, the objectives used to train these networks enforce only that similar images are embedded at similar locations in the representation space, and do not directly constrain the global structure of the resulting space. Here, we explore the impact of supervising this global structure by linearly aligning it with human similarity judgments. We find that a naive approach leads to large changes in local representational structure that harm downstream performance. Thus, we propose a novel method that aligns the global structure of representations while preserving their local structure. This global-local transform considerably improves accuracy across a variety of few-shot learning and anomaly detection tasks. Our results indicate that human visual representations are globally organized in a way that facilitates learning from few examples, and incorporating this global structure into neural network representations improves performance on downstream tasks.
Lukas Muttenthaler, Lorenz Linhardt, Jonas Dippel, Robert A. Vandermeulen, Katherine L. Hermann, Andrew K. Lampinen, Simon Kornblith
NeurIPS5
2020 The Origins and Prevalence of Texture Bias in Convolutional Neural Networks
abstract
Recent work has indicated that, unlike humans, ImageNet-trained CNNs tend to classify images by texture rather than by shape. How pervasive is this bias, and where does it come from? We find that, when trained on datasets of images with conflicting shape and texture, CNNs learn to classify by shape at least as easily as by texture. What factors, then, produce the texture bias in CNNs trained on ImageNet? Different unsupervised training objectives and different architectures have small but significant and largely independent effects on the level of texture bias. However, all objectives and architectures still lead to models that make texture-based classification decisions a majority of the time, even if shape information is decodable from their hidden representations. The effect of data augmentation is much larger. By taking less aggressive random crops at training time and applying simple, naturalistic augmentation (color distortion, noise, and blur), we train models that classify ambiguous images by shape a majority of the time, and outperform baselines on out-of-distribution test sets. Our results indicate that apparent differences in the way humans and ImageNet-trained CNNs process images may arise not primarily from differences in their internal workings, but from differences in the data that they see.
Katherine L. Hermann, Ting Chen 0007, Simon Kornblith
NeurIPS1
2020 What shapes feature representations? Exploring datasets, architectures, and training
abstract
In naturalistic learning problems, a model's input contains a wide range of features, some useful for the task at hand, and others not. Of the useful features, which ones does the model use? Of the task-irrelevant features, which ones does the model represent? Answers to these questions are important for understanding the basis of models' decisions, as well as for building models that learn versatile, adaptable representations useful beyond the original training task. We study these questions using synthetic datasets in which the task-relevance of input features can be controlled directly. We find that when two features redundantly predict the labels, the model preferentially represents one, and its preference reflects what was most linearly decodable from the untrained model. Over training, task-relevant features are enhanced, and task-irrelevant features are partially suppressed. Interestingly, in some cases, an easier, weakly predictive feature can suppress a more strongly predictive, but more difficult one. Additionally, models trained to recognize both easy and hard features learn representations most similar to models that use only the easy feature. Further, easy features lead to more consistent representations across model runs than do hard features. Finally, models have greater representational similarity to an untrained model than to models trained on a different task. Our results highlight the complex processes that determine which features a model represents.
Katherine L. Hermann, Andrew K. Lampinen
NeurIPS1