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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lukas Haverbeck

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

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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
Learning theory · 50% Kernel, tree and ensemble methods · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical estimation › confidence set construction
confidence bounds
0.912025
Kernel conditional tests from learning-theoretic bounds · NeurIPS 2025
Machine learning › Learning theory
hypothesis testing
0.912025
Kernel conditional tests from learning-theoretic bounds · NeurIPS 2025
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.912025
Kernel conditional tests from learning-theoretic bounds · NeurIPS 2025
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel ridge regression
0.912025
Kernel conditional tests from learning-theoretic bounds · NeurIPS 2025

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

kernel mean embedding · 0.9conditional independence testing · 0.9bootstrapping · 0.9
YearPublicationVenuePosition
2025 Kernel conditional tests from learning-theoretic bounds
abstract
We propose a framework for hypothesis testing on conditional probability distributions, which we then use to construct *statistical tests of functionals of conditional distributions*. These tests identify the inputs where the functionals differ with high probability, and include tests of conditional moments or two-sample tests. Our key idea is to transform confidence bounds of a learning method into a test of conditional expectations. We instantiate this principle for kernel ridge regression (KRR) with subgaussian noise. An intermediate data embedding then enables more general tests — including *conditional two-sample tests* — via kernel mean embeddings of distributions. To have guarantees in this setting, we generalize existing pointwise-in-time or time-uniform confidence bounds for KRR to previously-inaccessible yet essential cases such as infinite-dimensional outputs with non-trace-class kernels. These bounds also circumvent the need for independent data, allowing for instance online sampling. To make our tests readily applicable in practice, we introduce bootstrapping schemes leveraging the parametric form of testing thresholds identified in theory to avoid tuning inaccessible parameters. We illustrate the tests on examples, including one in process monitoring and comparison of dynamical systems. Overall, our results establish a comprehensive foundation for conditional testing on functionals, from theoretical guarantees to an algorithmic implementation, and advance the state of the art on confidence bounds for vector-valued least squares estimation.
Pierre-François Massiani, Christian Fiedler, Lukas Haverbeck, Friedrich Solowjow, Sebastian Trimpe
NeurIPS3
2025 Viability of Future Actions: Robust Safety in Reinforcement Learning via Entropy Regularization
Pierre-François Massiani, Alexander von Rohr, Lukas Haverbeck, Sebastian Trimpe
ECML/PKDD (6)3