Christina Göpfert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christina Göpfert has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Barbara Hammer
Bielefeld University
9 shared publications - Benjamin Paaßen
Faculty of Technology, Bielefeld University, Bielefeld, Germany
3 shared publications - Jan Philip Göpfert
Bielefeld University
3 shared publications - Lukas Pfannschmidt
Machine learning group Bielefeld University Bielefeld Germany
3 shared publications - Alex Haig
Google Inc, Mountain View, United States
1 shared publication - Chih-Wei Hsu
Google Inc, Mountain View, United States
1 shared publication
Latest Publications
- Open Access
- 31 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Recommender Systems
- Vol. 2 (4) , 1-37
Discovering Personalized Semantics for Soft Attributes in Recommender Systems Using Concept Activation Vectors
Interactive recommender systems have emerged as a promising paradigm to overcome the limitations of the primitive user feedback used by traditional recommender systems (e.g., clicks, item consumption, ratings). They allow users to express intent, preferences, constraints, and contexts in a richer fashion, often using natural language (including faceted search and dialogue). Yet more research is needed to find the most effective ways to use this feedback. One challenge is inferring a user’s semantic intent from the open-ended terms or attributes often used to describe a desired item. This is critical for recommender systems that wish to support users in their everyday, intuitive use of natural language to refine recommendation results. Leveraging concept activation vectors (CAVs) [ 26 ], a recently developed approach for model interpretability in machine learning, we develop a framework to learn a representation that captures the semantics of such attributes and connects them to user preferences and behaviors in recommender systems. One novel feature of our approach is its ability to distinguish objective and subjective attributes (both subjectivity of degree and of sense ) and associate different senses of subjective attributes with different users. We demonstrate on both synthetic and real-world datasets that our CAV representation not only accurately interprets users’ subjective semantics but also can be used to improve recommendations through interactive item critiquing .
- 31 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Recommender Systems
- Vol. 2 (4) , 1-37
Open AccessDiscovering Personalized Semantics for Soft Attributes in Recommender Systems Using Concept Activation Vectors
Interactive recommender systems have emerged as a promising paradigm to overcome the limitations of the primitive user feedback used by traditional recommender systems (e.g., clicks, item consumption, ratings). They allow users to express intent, preferences, constraints, and contexts in a richer fashion, often using natural language (including faceted search and dialogue). Yet more research is needed to find the most effective ways to use this feedback. One challenge is inferring a user’s semantic intent from the open-ended terms or attributes often used to describe a desired item. This is critical for recommender systems that wish to support users in their everyday, intuitive use of natural language to refine recommendation results. Leveraging concept activation vectors (CAVs) [ 26 ], a recently developed approach for model interpretability in machine learning, we develop a framework to learn a representation that captures the semantics of such attributes and connects them to user preferences and behaviors in recommender systems. One novel feature of our approach is its ability to distinguish objective and subjective attributes (both subjectivity of degree and of sense ) and associate different senses of subjective attributes with different users. We demonstrate on both synthetic and real-world datasets that our CAV representation not only accurately interprets users’ subjective semantics but also can be used to improve recommendations through interactive item critiquing .
- 7 September 2021
- Published by Springer Nature
- p. 29-41
How to Compare Adversarial Robustness of Classifiers from a Global Perspective
- 7 September 2021
- Published by Springer Nature
- p. 29-41
How to Compare Adversarial Robustness of Classifiers from a Global Perspective
- Open Access
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
FRI-Feature Relevance Intervals for Interpretable and Interactive Data Exploration
Most existing feature selection methods are insufficient for analytic purposes as soon as high dimensional data or redundant sensor signals are dealt with since features can be selected due to spurious effects or correlations rather than causal effects. To support the finding of causal features in biomedical experiments, we hereby present FRI, an open source Python library that can be used to identify all-relevant variables in linear classification and (ordinal) regression problems. Using the recently proposed feature relevance interval method, FRI is able to provide the base for further general experimentation or in specific can facilitate the search for alternative biomarkers. It can be used in an interactive context, by providing model manipulation and visualization methods, or in a batch process as a filter method.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
Open AccessFRI-Feature Relevance Intervals for Interpretable and Interactive Data Exploration
Most existing feature selection methods are insufficient for analytic purposes as soon as high dimensional data or redundant sensor signals are dealt with since features can be selected due to spurious effects or correlations rather than causal effects. To support the finding of causal features in biomedical experiments, we hereby present FRI, an open source Python library that can be used to identify all-relevant variables in linear classification and (ordinal) regression problems. Using the recently proposed feature relevance interval method, FRI is able to provide the base for further general experimentation or in specific can facilitate the search for alternative biomarkers. It can be used in an interactive context, by providing model manipulation and visualization methods, or in a batch process as a filter method.
- Open Access
FRI -- Feature Relevance Intervals for Interpretable and Interactive Data Exploration
Most existing feature selection methods are insufficient for analytic purposes as soon as high dimensional data or redundant sensor signals are dealt with since features can be selected due to spurious effects or correlations rather than causal effects. To support the finding of causal features in biomedical experiments, we hereby present FRI, an open source Python library that can be used to identify all-relevant variables in linear classification and (ordinal) regression problems. Using the recently proposed feature relevance method, FRI is able to provide the base for further general experimentation or in specific can facilitate the search for alternative biomarkers. It can be used in an interactive context, by providing model manipulation and visualization methods, or in a batch process as a filter method.
Open AccessFRI -- Feature Relevance Intervals for Interpretable and Interactive Data Exploration
Most existing feature selection methods are insufficient for analytic purposes as soon as high dimensional data or redundant sensor signals are dealt with since features can be selected due to spurious effects or correlations rather than causal effects. To support the finding of causal features in biomedical experiments, we hereby present FRI, an open source Python library that can be used to identify all-relevant variables in linear classification and (ordinal) regression problems. Using the recently proposed feature relevance method, FRI is able to provide the base for further general experimentation or in specific can facilitate the search for alternative biomarkers. It can be used in an interactive context, by providing model manipulation and visualization methods, or in a batch process as a filter method.
- Open Access
- 4 February 2019
- Published by Elsevier in Neurocomputing
- Vol. 342, 125-136
Differential privacy for learning vector quantization
- 4 February 2019
- Published by Elsevier in Neurocomputing
- Vol. 342, 125-136
Open AccessDifferential privacy for learning vector quantization
- Open Access
Statistical Mechanics of On-Line Learning Under Concept Drift
We introduce a modeling framework for the investigation of on-line machine learning processes in non-stationary environments. We exemplify the approach in terms of two specific model situations: In the first, we consider the learning of a classification scheme from clustered data by means of prototype-based Learning Vector Quantization (LVQ). In the second, we study the training of layered neural networks with sigmoidal activations for the purpose of regression. In both cases, the target, i.e., the classification or regression scheme, is considered to change continuously while the system is trained from a stream of labeled data. We extend and apply methods borrowed from statistical physics which have been used frequently for the exact description of training dynamics in stationary environments. Extensions of the approach allow for the computation of typical learning curves in the presence of concept drift in a variety of model situations. First results are presented and discussed for stochastic drift processes in classification and regression problems. They indicate that LVQ is capable of tracking a classification scheme under drift to a non-trivial extent. Furthermore, we show that concept drift can cause the persistence of sub-optimal plateau states in gradient based training of layered neural networks for regression.
Open AccessStatistical Mechanics of On-Line Learning Under Concept Drift
We introduce a modeling framework for the investigation of on-line machine learning processes in non-stationary environments. We exemplify the approach in terms of two specific model situations: In the first, we consider the learning of a classification scheme from clustered data by means of prototype-based Learning Vector Quantization (LVQ). In the second, we study the training of layered neural networks with sigmoidal activations for the purpose of regression. In both cases, the target, i.e., the classification or regression scheme, is considered to change continuously while the system is trained from a stream of labeled data. We extend and apply methods borrowed from statistical physics which have been used frequently for the exact description of training dynamics in stationary environments. Extensions of the approach allow for the computation of typical learning curves in the presence of concept drift in a variety of model situations. First results are presented and discussed for stochastic drift processes in classification and regression problems. They indicate that LVQ is capable of tracking a classification scheme under drift to a non-trivial extent. Furthermore, we show that concept drift can cause the persistence of sub-optimal plateau states in gradient based training of layered neural networks for regression.
- 1 July 2018
- Published by Elsevier in Neurocomputing
- Vol. 298, 69-79
Interpretation of linear classifiers by means of feature relevance bounds
- 1 July 2018
- Published by Elsevier in Neurocomputing
- Vol. 298, 69-79
Interpretation of linear classifiers by means of feature relevance bounds
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Effects of variability in synthetic training data on convolutional neural networks for 3D head reconstruction
Convolutional neural networks have recently shown great success in computer vision. They are able to automatically learn complicated mappings, often reaching human or super-human performance. However, a lack of labeled data can preclude the training of such networks. This is the case in the reconstruction of 3-dimensional human heads from 2-dimensional photographs. Approaching the problem backwards, starting from 3-dimensional heads and using photo-realistic rendering, one can create any number of training data to tackle the problem. This way, fine control over the data allows for new insights into how a convolutional neural network interprets data and how variability in the training and test data affect its performance. We perform a systematic analysis in order to determine how the presence of different types of variability in the training data affects the generalization properties of the network for 3-dimensional head reconstruction.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Effects of variability in synthetic training data on convolutional neural networks for 3D head reconstruction
Convolutional neural networks have recently shown great success in computer vision. They are able to automatically learn complicated mappings, often reaching human or super-human performance. However, a lack of labeled data can preclude the training of such networks. This is the case in the reconstruction of 3-dimensional human heads from 2-dimensional photographs. Approaching the problem backwards, starting from 3-dimensional heads and using photo-realistic rendering, one can create any number of training data to tackle the problem. This way, fine control over the data allows for new insights into how a convolutional neural network interprets data and how variability in the training and test data affect its performance. We perform a systematic analysis in order to determine how the presence of different types of variability in the training data affects the generalization properties of the network for 3-dimensional head reconstruction.
- 11 August 2017
- Published by Springer Nature in Neural Processing Letters
- Vol. 48 (2) , 669-689
Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces
- 11 August 2017
- Published by Springer Nature in Neural Processing Letters
- Vol. 48 (2) , 669-689
Time Series Prediction for Graphs in Kernel and Dissimilarity Spaces
- 13 August 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 251-258
Local Reject Option for Deterministic Multi-class SVM
- 13 August 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 251-258
Local Reject Option for Deterministic Multi-class SVM