Christoph Jansen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Christoph Jansen has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Georg Schollmeyer
Department of Statistics Ludiwg-Maximilians-Universität München Munich Germany
9 shared publications - Thomas Augustin
Ludwig-Maximilians-University of Munich
8 shared publications Georg Schollmeyer
Department of Statistics LMU Munich Ludwigsstr. 33 80539 Munich Germany
2 shared publications- Hannah Blocher
Department of Statistics Ludwig-Maximilians-Universität München Ludwigstr. 33 80539 München Germany
2 shared publications Thomas Augustin
Department of Statistics LMU Munich Ludwigsstr. 33 80539 Munich Germany
2 shared publications- Christine Nussbaum
Department for General Psychology and Cognitive Neuroscience, Friedrich Schiller University Jena, 07743 Jena, Germany
1 shared publication
Latest Publications
- 15 July 2026
- Published by Elsevier in Information Sciences
- Vol. 757
Empirical decision theory
- 10 August 2024
- Published by Springer Nature
- p. 110-117
Semi-supervised Learning Guided by the Generalized Bayes Rule Under Soft Revision
- 10 August 2024
- Published by Springer Nature
- p. 110-117
Semi-supervised Learning Guided by the Generalized Bayes Rule Under Soft Revision
- Open Access
- 7 March 2024
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 169
Comparing machine learning algorithms by union-free generic depth
- 7 March 2024
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 169
Open AccessComparing machine learning algorithms by union-free generic depth
- Open Access
Statistical Comparisons of Classifiers by Generalized Stochastic Dominance
Although being a crucial question for the development of machine learning algorithms, there is still no consensus on how to compare classifiers over multiple data sets with respect to several criteria. Every comparison framework is confronted with (at least) three fundamental challenges: the multiplicity of quality criteria, the multiplicity of data sets and the randomness of the selection of data sets. In this paper, we add a fresh view to the vivid debate by adopting recent developments in decision theory. Based on so-called preference systems, our framework ranks classifiers by a generalized concept of stochastic dominance, which powerfully circumvents the cumbersome, and often even self-contradictory, reliance on aggregates. Moreover, we show that generalized stochastic dominance can be operationalized by solving easy-to-handle linear programs and moreover statistically tested employing an adapted two-sample observation-randomization test. This yields indeed a powerful framework for the statistical comparison of classifiers over multiple data sets with respect to multiple quality criteria simultaneously. We illustrate and investigate our framework in a simulation study and with a set of standard benchmark data sets.
Open AccessStatistical Comparisons of Classifiers by Generalized Stochastic Dominance
Although being a crucial question for the development of machine learning algorithms, there is still no consensus on how to compare classifiers over multiple data sets with respect to several criteria. Every comparison framework is confronted with (at least) three fundamental challenges: the multiplicity of quality criteria, the multiplicity of data sets and the randomness of the selection of data sets. In this paper, we add a fresh view to the vivid debate by adopting recent developments in decision theory. Based on so-called preference systems, our framework ranks classifiers by a generalized concept of stochastic dominance, which powerfully circumvents the cumbersome, and often even self-contradictory, reliance on aggregates. Moreover, we show that generalized stochastic dominance can be operationalized by solving easy-to-handle linear programs and moreover statistically tested employing an adapted two-sample observation-randomization test. This yields indeed a powerful framework for the statistical comparison of classifiers over multiple data sets with respect to multiple quality criteria simultaneously. We illustrate and investigate our framework in a simulation study and with a set of standard benchmark data sets.
- 19 May 2023
- Published by Springer Nature
- p. 45-57
Multi-target Decision Making Under Conditions of Severe Uncertainty
- 19 May 2023
- Published by Springer Nature
- p. 45-57
Multi-target Decision Making Under Conditions of Severe Uncertainty
- Open Access
In all LikelihoodS: How to Reliably Select Pseudo-Labeled Data for Self-Training in Semi-Supervised Learning
Self-training is a simple yet effective method within semi-supervised learning. The idea is to iteratively enhance training data by adding pseudo-labeled data. Its generalization performance heavily depends on the selection of these pseudo-labeled data (PLS). In this paper, we aim at rendering PLS more robust towards the involved modeling assumptions. To this end, we propose to select pseudo-labeled data that maximize a multi-objective utility function. The latter is constructed to account for different sources of uncertainty, three of which we discuss in more detail: model selection, accumulation of errors and covariate shift. In the absence of second-order information on such uncertainties, we furthermore consider the generic approach of the generalized Bayesian alpha-cut updating rule for credal sets. As a practical proof of concept, we spotlight the application of three of our robust extensions on simulated and real-world data. Results suggest that in particular robustness w.r.t. model choice can lead to substantial accuracy gains.
Open AccessIn all LikelihoodS: How to Reliably Select Pseudo-Labeled Data for Self-Training in Semi-Supervised Learning
Self-training is a simple yet effective method within semi-supervised learning. The idea is to iteratively enhance training data by adding pseudo-labeled data. Its generalization performance heavily depends on the selection of these pseudo-labeled data (PLS). In this paper, we aim at rendering PLS more robust towards the involved modeling assumptions. To this end, we propose to select pseudo-labeled data that maximize a multi-objective utility function. The latter is constructed to account for different sources of uncertainty, three of which we discuss in more detail: model selection, accumulation of errors and covariate shift. In the absence of second-order information on such uncertainties, we furthermore consider the generic approach of the generalized Bayesian alpha-cut updating rule for credal sets. As a practical proof of concept, we spotlight the application of three of our robust extensions on simulated and real-world data. Results suggest that in particular robustness w.r.t. model choice can lead to substantial accuracy gains.
- 9 August 2022
- Published by Springer Nature
- p. 319-346
Quantifying Degrees of E-admissibility in Decision Making with Imprecise Probabilities
- 9 August 2022
- Published by Springer Nature
- p. 319-346
Quantifying Degrees of E-admissibility in Decision Making with Imprecise Probabilities
- 4 July 2022
- Published by Springer Nature
- p. 17-30
Statistical Models for Partial Orders Based on Data Depth and Formal Concept Analysis
- 4 July 2022
- Published by Springer Nature
- p. 17-30
Statistical Models for Partial Orders Based on Data Depth and Formal Concept Analysis
- 4 July 2022
- Published by Springer Nature
- p. 729-742
Decision Making with State-Dependent Preference Systems
- 4 July 2022
- Published by Springer Nature
- p. 729-742
Decision Making with State-Dependent Preference Systems
- Open Access
Information efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty
In this paper we propose efficient methods for elicitation of complexly structured preferences and utilize these in problems of decision making under (severe) uncertainty. Based on the general framework introduced in Jansen, Schollmeyer and Augustin (2018, Int. J. Approx. Reason), we now design elicitation procedures and algorithms that enable decision makers to reveal their underlying preference system (i.e. two relations, one encoding the ordinal, the other the cardinal part of the preferences) while having to answer as few as possible simple ranking questions. Here, two different approaches are followed. The first approach directly utilizes the collected ranking data for obtaining the ordinal part of the preferences, while their cardinal part is constructed implicitly by measuring meta data on the decision maker's consideration times. In contrast, the second approach explicitly elicits also the cardinal part of the decision maker's preference system, however, only an approximate version of it. This approximation is obtained by additionally collecting labels of preference strength during the elicitation procedure. For both approaches, we give conditions under which they produce the decision maker's true preference system and investigate how their efficiency can be improved. For the latter purpose, besides data-free approaches, we also discuss ways for effectively guiding the elicitation procedure if data from previous elicitation rounds is available. Finally, we demonstrate how the proposed elicitation methods can be utilized in problems of decision under (severe) uncertainty. Precisely, we show that under certain conditions optimal decisions can be found without fully specifying the preference system.
Open AccessInformation efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty
In this paper we propose efficient methods for elicitation of complexly structured preferences and utilize these in problems of decision making under (severe) uncertainty. Based on the general framework introduced in Jansen, Schollmeyer and Augustin (2018, Int. J. Approx. Reason), we now design elicitation procedures and algorithms that enable decision makers to reveal their underlying preference system (i.e. two relations, one encoding the ordinal, the other the cardinal part of the preferences) while having to answer as few as possible simple ranking questions. Here, two different approaches are followed. The first approach directly utilizes the collected ranking data for obtaining the ordinal part of the preferences, while their cardinal part is constructed implicitly by measuring meta data on the decision maker's consideration times. In contrast, the second approach explicitly elicits also the cardinal part of the decision maker's preference system, however, only an approximate version of it. This approximation is obtained by additionally collecting labels of preference strength during the elicitation procedure. For both approaches, we give conditions under which they produce the decision maker's true preference system and investigate how their efficiency can be improved. For the latter purpose, besides data-free approaches, we also discuss ways for effectively guiding the elicitation procedure if data from previous elicitation rounds is available. Finally, we demonstrate how the proposed elicitation methods can be utilized in problems of decision under (severe) uncertainty. Precisely, we show that under certain conditions optimal decisions can be found without fully specifying the preference system.