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.

Ádám Jung

dblp:404/6572 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Trustworthy machine learning · 40% Probabilistic and Bayesian machine learning · 40% Learning paradigms · 20%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › uncertainty estimation
aleatoric uncertainty
0.912025
Distribution-Free Data Uncertainty for Neural Network Regression · ICLR 2025
Machine learning › Learning paradigms › supervised learning
neural network regression
0.912025
Distribution-Free Data Uncertainty for Neural Network Regression · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
probabilistic regression
0.912025
Distribution-Free Data Uncertainty for Neural Network Regression · ICLR 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Distribution-Free Data Uncertainty for Neural Network Regression · ICLR 2025

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

sample-based approximation · 0.9continuous ranked probability score · 0.9
YearPublicationVenuePosition
2025 Distribution-Free Data Uncertainty for Neural Network Regression
abstract
Quantifying uncertainty is an essential part of predictive modeling, especially in the context of high-stakes decision-making. While classification output includes data uncertainty by design in the form of class probabilities, the regression task generally aims only to predict the expected value of the target variable. Probabilistic extensions often assume parametric distributions around the expected value, optimizing the likelihood over the resulting explicit densities. However, using parametric distributions can limit practical applicability, making it difficult for models to capture skewed, multi-modal, or otherwise complex distributions. In this paper, we propose optimizing a novel nondeterministic neural network regression architecture for loss functions derived from a sample-based approximation of the continuous ranked probability score (CRPS), enabling a truly distribution-free approach by learning to sample from the target's aleatoric distribution, rather than predicting explicit densities. Our approach allows the model to learn well-calibrated, arbitrary uni- and multivariate output distributions. We evaluate the method on a variety of synthetic and real-world tasks, including uni- and multivariate problems, function inverse approximation, and standard regression uncertainty benchmarks. Finally, we make all experiment code publicly available.
Domokos Kelen, Ádám Jung, Péter Kersch, András A. Benczúr
ICLR2