MuLaConf: Multi-label Conformal Prediction

Kostas Katsios, Harris Papadopoulos
Proceedings of the Fifteenth Symposium on Conformal and Probabilistic Prediction with Applications, PMLR 329:689-709, 2026.

Abstract

This paper presents MuLaConf, a Scikit-Learn-compatible Python package that implements Inductive (or Split) Conformal Prediction for multi-label classification tasks. Conformal Prediction is a rigorous machine learning framework for constructing prediction regions with coverage guarantees under the minimal assumption of data exchangeability. In multi-label classification, the Powerset Scoring approach explicitly computes p-values for all possible label combinations. However, it often yields un informatively large prediction sets. MuLaConf addresses this by defining nonconformity measures in the error vector space. This allows users to utilize either the Mahalanobis distance to capture label correlations or the standard Euclidean Norm. Furthermore, the package incorporates structural penalties, based on Hamming distance and label-set cardinality, to significantly reduce prediction set sizes while strictly maintaining theoretical coverage. To overcome the exponential computational complexity of the powerset space, MuLaConf leverages PyTorch-accelerated tensor operations and a memory management mechanism. Finally, its modular architecture features lazy evaluation, enabling the on-the-fly updating of distance measures and penalty weights without the need to retrain the underlying machine learning models. Together, these features make MuLaConf a practical tool for reliable uncertainty quantification in multi-label settings and a foundation for future research in Conformal Prediction.

Cite this Paper


BibTeX
@InProceedings{pmlr-v329-katsios26a, title = {MuLaConf: Multi-label Conformal Prediction}, author = {Katsios, Kostas and Papadopoulos, Harris}, booktitle = {Proceedings of the Fifteenth Symposium on Conformal and Probabilistic Prediction with Applications}, pages = {689--709}, year = {2026}, editor = {Ahlberg, Ernst and Johansson, Ulf and Boström, Henrik and Carlevaro, Alberto and Hallberg Szabadváry, Johan and Carlsson, Lars}, volume = {329}, series = {Proceedings of Machine Learning Research}, month = {02--04 Sep}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v329/main/assets/katsios26a/katsios26a.pdf}, url = {https://proceedings.mlr.press/v329/katsios26a.html}, abstract = {This paper presents MuLaConf, a Scikit-Learn-compatible Python package that implements Inductive (or Split) Conformal Prediction for multi-label classification tasks. Conformal Prediction is a rigorous machine learning framework for constructing prediction regions with coverage guarantees under the minimal assumption of data exchangeability. In multi-label classification, the Powerset Scoring approach explicitly computes p-values for all possible label combinations. However, it often yields un informatively large prediction sets. MuLaConf addresses this by defining nonconformity measures in the error vector space. This allows users to utilize either the Mahalanobis distance to capture label correlations or the standard Euclidean Norm. Furthermore, the package incorporates structural penalties, based on Hamming distance and label-set cardinality, to significantly reduce prediction set sizes while strictly maintaining theoretical coverage. To overcome the exponential computational complexity of the powerset space, MuLaConf leverages PyTorch-accelerated tensor operations and a memory management mechanism. Finally, its modular architecture features lazy evaluation, enabling the on-the-fly updating of distance measures and penalty weights without the need to retrain the underlying machine learning models. Together, these features make MuLaConf a practical tool for reliable uncertainty quantification in multi-label settings and a foundation for future research in Conformal Prediction.} }
Endnote
%0 Conference Paper %T MuLaConf: Multi-label Conformal Prediction %A Kostas Katsios %A Harris Papadopoulos %B Proceedings of the Fifteenth Symposium on Conformal and Probabilistic Prediction with Applications %C Proceedings of Machine Learning Research %D 2026 %E Ernst Ahlberg %E Ulf Johansson %E Henrik Boström %E Alberto Carlevaro %E Johan Hallberg Szabadváry %E Lars Carlsson %F pmlr-v329-katsios26a %I PMLR %P 689--709 %U https://proceedings.mlr.press/v329/katsios26a.html %V 329 %X This paper presents MuLaConf, a Scikit-Learn-compatible Python package that implements Inductive (or Split) Conformal Prediction for multi-label classification tasks. Conformal Prediction is a rigorous machine learning framework for constructing prediction regions with coverage guarantees under the minimal assumption of data exchangeability. In multi-label classification, the Powerset Scoring approach explicitly computes p-values for all possible label combinations. However, it often yields un informatively large prediction sets. MuLaConf addresses this by defining nonconformity measures in the error vector space. This allows users to utilize either the Mahalanobis distance to capture label correlations or the standard Euclidean Norm. Furthermore, the package incorporates structural penalties, based on Hamming distance and label-set cardinality, to significantly reduce prediction set sizes while strictly maintaining theoretical coverage. To overcome the exponential computational complexity of the powerset space, MuLaConf leverages PyTorch-accelerated tensor operations and a memory management mechanism. Finally, its modular architecture features lazy evaluation, enabling the on-the-fly updating of distance measures and penalty weights without the need to retrain the underlying machine learning models. Together, these features make MuLaConf a practical tool for reliable uncertainty quantification in multi-label settings and a foundation for future research in Conformal Prediction.
APA
Katsios, K. & Papadopoulos, H.. (2026). MuLaConf: Multi-label Conformal Prediction. Proceedings of the Fifteenth Symposium on Conformal and Probabilistic Prediction with Applications, in Proceedings of Machine Learning Research 329:689-709 Available from https://proceedings.mlr.press/v329/katsios26a.html.

Related Material