activity
20112023
most citedAleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methods

1.7k citations · 1.8k across the 18 of their papers we have counts for

collaborators

20 papers

stat.ML2023★ 2 cited

Conditional validity of heteroskedastic conformal regression

Nicolas Dewolf, Bernard De Baets, Willem Waegeman

Conformal prediction, and split conformal prediction as a specific implementation, offer a distribution-free approach to estimating prediction intervals with statistical guarantees…

cs.LG2023★ 3 cited

On Second-Order Scoring Rules for Epistemic Uncertainty Quantification

Viktor Bengs, Eyke Hüllermeier, Willem Waegeman

It is well known that accurate probabilistic predictors can be trained through empirical risk minimisation with proper scoring rules as loss functions. While such learners capture…

cs.LG2022

Hyperparameter optimization in deep multi-target prediction

Dimitrios Iliadis, Marcel Wever, Bernard De Baets +1

As a result of the ever increasing complexity of configuring and fine-tuning machine learning models, the field of automated machine learning (AutoML) has emerged over the past dec…

stat.ML2022

On the Calibration of Probabilistic Classifier Sets

Thomas Mortier, Viktor Bengs, Eyke Hüllermeier +2

Multi-class classification methods that produce sets of probabilistic classifiers, such as ensemble learning methods, are able to model aleatoric and epistemic uncertainty. Aleator…

cs.LG2022★ 1 cited

Set-valued prediction in hierarchical classification with constrained representation complexity

Thomas Mortier, Eyke Hüllermeier, Krzysztof Dembczyński +1

Set-valued prediction is a well-known concept in multi-class classification. When a classifier is uncertain about the class label for a test instance, it can predict a set of class…

cs.LG2022★ 6 cited

Pitfalls of Epistemic Uncertainty Quantification through Loss Minimisation

Viktor Bengs, Eyke Hüllermeier, Willem Waegeman

Uncertainty quantification has received increasing attention in machine learning in the recent past. In particular, a distinction between aleatoric and epistemic uncertainty has be…

stat.ML2021★ 63 cited

Valid prediction intervals for regression problems

Nicolas Dewolf, Bernard De Baets, Willem Waegeman

Over the last few decades, various methods have been proposed for estimating prediction intervals in regression settings, including Bayesian methods, ensemble methods, direct inter…

cs.LG2021

Multi-target prediction for dummies using two-branch neural networks

Dimitrios Iliadis, Bernard De Baets, Willem Waegeman

Multi-target prediction (MTP) serves as an umbrella term for machine learning tasks that concern the simultaneous prediction of multiple target variables. Classical instantiations…

cs.LG2019★ 1.7k cited

Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methods

Eyke Hüllermeier, Willem Waegeman

The notion of uncertainty is of major importance in machine learning and constitutes a key element of machine learning methodology. In line with the statistical tradition, uncertai…

cs.LG2019

Efficient Set-Valued Prediction in Multi-Class Classification

Thomas Mortier, Marek Wydmuch, Krzysztof Dembczyński +2

In cases of uncertainty, a multi-class classifier preferably returns a set of candidate classes instead of predicting a single class label with little guarantee. More precisely, th…

stat.ML2018★ 1 cited

Multi-Target Prediction: A Unifying View on Problems and Methods

Willem Waegeman, Krzysztof Dembczynski, Eyke Huellermeier

Multi-target prediction (MTP) is concerned with the simultaneous prediction of multiple target variables of diverse type. Due to its enormous application potential, it has develope…

stat.ML2018★ 1 cited

A Comparative Study of Pairwise Learning Methods based on Kernel Ridge Regression

Michiel Stock, Tapio Pahikkala, Antti Airola +2

Many machine learning problems can be formulated as predicting labels for a pair of objects. Problems of that kind are often referred to as pairwise learning, dyadic prediction or…

cs.IR2016★ 1 cited

Exact and efficient top-K inference for multi-target prediction by querying separable linear relational models

Michiel Stock, Krzysztof Dembczynski, Bernard De Baets +1

Many complex multi-target prediction problems that concern large target spaces are characterised by a need for efficient prediction strategies that avoid the computation of predict…

cs.LG2016★ 9 cited

Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method

Michiel Stock, Tapio Pahikkala, Antti Airola +2

Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as…

cs.LG2015★ 3 cited

Spectral Analysis of Symmetric and Anti-Symmetric Pairwise Kernels

Tapio Pahikkala, Markus Viljanen, Antti Airola +1

We consider the problem of learning regression functions from pairwise data when there exists prior knowledge that the relation to be learned is symmetric or anti-symmetric. Such p…

cs.LG2014★ 4 cited

A two-step learning approach for solving full and almost full cold start problems in dyadic prediction

Tapio Pahikkala, Michiel Stock, Antti Airola +3

Dyadic prediction methods operate on pairs of objects (dyads), aiming to infer labels for out-of-sample dyads. We consider the full and almost full cold start problem in dyadic pre…

cs.LG2014

Identification of functionally related enzymes by learning-to-rank methods

Michiel Stock, Thomas Fober, Eyke Hüllermeier +6

Enzyme sequences and structures are routinely used in the biological sciences as queries to search for functionally related enzymes in online databases. To this end, one usually de…

stat.ML2013★ 3 cited

On the Bayes-optimality of F-measure maximizers

Willem Waegeman, Krzysztof Dembczynski, Arkadiusz Jachnik +2

The F-measure, which has originally been introduced in information retrieval, is nowadays routinely used as a performance metric for problems such as binary classification, multi-l…

cs.LG2012★ 1 cited

Efficient Regularized Least-Squares Algorithms for Conditional Ranking on Relational Data

Tapio Pahikkala, Antti Airola, Michiel Stock +2

In domains like bioinformatics, information retrieval and social network analysis, one can find learning tasks where the goal consists of inferring a ranking of objects, conditione…

stat.ML2011★ 25 cited

A kernel-based framework for learning graded relations from data

Willem Waegeman, Tapio Pahikkala, Antti Airola +3

Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations betwe…