EDBT 2026 Demo / reviewers in the wild / expert
Tamara Fernandez
dblp:191/6683
· DBLP profile ↗
6ranked-venue papers
5as 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 · 6 · 5 first-author · 2 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
5 papers |
Learning theory · 40% Kernel, tree and ensemble methods · 31% Probabilistic and Bayesian machine learning · 29% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel-based testing |
1.6 | 2 | 2025 | Composite Goodness-of-fit Tests with Kernels · J. Mach. Learn. Res. 2025 A General Framework for the Analysis of Kernel-based Tests · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
goodness-of-fit testing |
1.3 | 2 | 2025 | Composite Goodness-of-fit Tests with Kernels · J. Mach. Learn. Res. 2025 Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data · ICML 2020 |
Machine learning › Learning theory
hypothesis testing |
1.3 | 2 | 2025 | Composite Goodness-of-fit Tests with Kernels · J. Mach. Learn. Res. 2025 A kernel test for quasi-independence · NeurIPS 2020 |
Machine learning › Kernel, tree and ensemble methods
kernel methods |
1.2 | 2 | 2024 | A General Framework for the Analysis of Kernel-based Tests · J. Mach. Learn. Res. 2024 Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data · ICML 2020 |
Machine learning › Learning theory
statistical learning theory |
1.2 | 2 | 2024 | A General Framework for the Analysis of Kernel-based Tests · J. Mach. Learn. Res. 2024 Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data · ICML 2020 |
Machine learning › Learning theory › statistical learning theory
asymptotic analysis |
0.8 | 1 | 2024 | A General Framework for the Analysis of Kernel-based Tests · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › divergence measure
kernel stein discrepancy |
0.4 | 1 | 2020 | Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data · ICML 2020 |
Machine learning › Learning theory › hypothesis testing
nonparametric hypothesis testing |
0.4 | 1 | 2020 | A kernel test for quasi-independence · NeurIPS 2020 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process |
0.2 | 1 | 2016 | Gaussian Processes for Survival Analysis · NIPS 2016 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
survival analysis |
0.2 | 1 | 2016 | Gaussian Processes for Survival Analysis · NIPS 2016 |
Bioinformatics and computational biology
survival analysis |
0.1 | 1 | 2020 | Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data · ICML 2020 |
Methods — techniques the papers use, named apart from their topics
maximum mean discrepancy · 1.7wild bootstrap · 0.9parametric bootstrap · 0.9minimum distance estimation · 0.9stein's method · 0.9kernelized stein discrepancy · 0.9v-statistics · 0.8u-statistics · 0.8reproducing kernel hilbert space · 0.8random functionals · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Composite Goodness-of-fit Tests with KernelsabstractWe propose kernel-based hypothesis tests for the challenging composite testing problem, where we are interested in whether the data comes from any distribution in some parametric family. Our tests make use of minimum distance estimators based on kernel-based distances such as the maximum mean discrepancy. As our main result, we show that we are able to estimate the parameter and conduct our test on the same data (without data splitting), while maintaining a correct test level. We also prove that the popular wild bootstrap will lead to an overly conservative test, and show that the parametric bootstrap is consistent and can lead to significantly improved performance in practice. Our approach is illustrated on a range of problems, including testing for goodness-of-fit of a non-parametric density model, and an intractable generative model of a biological cellular network. Oscar Key, Arthur Gretton, François-Xavier Briol, Tamara Fernandez |
J. Mach. Learn. Res. | 4 |
| 2024 | A General Framework for the Analysis of Kernel-based TestsabstractKernel-based tests provide a simple yet effective framework that uses the theory of reproducing kernel Hilbert spaces to design non-parametric testing procedures. In this paper, we propose new theoretical tools that can be used to study the asymptotic behaviour of kernel-based tests in various data scenarios and in different testing problems. Unlike current approaches, our methods avoid working with U and V-statistics expansions that usually lead to lengthy and tedious computations and asymptotic approximations. Instead, we work directly with random functionals on the Hilbert space to analyse kernel-based tests. By harnessing the use of random functionals, our framework leads to much cleaner analyses, involving less tedious computations. Additionally, it offers the advantage of accommodating pre-existing knowledge regarding test-statistics as many of the random functionals considered in applications are known statistics that have been studied comprehensively. To demonstrate the efficacy of our approach, we thoroughly examine two categories of kernel tests, along with three specific examples of kernel tests, including a novel kernel test for conditional independence testing. Tamara Fernandez, Nicolas Rivera |
J. Mach. Learn. Res. | 1 |
| 2020 | Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event DataabstractSurvival Analysis and Reliability Theory are concerned with the analysis of time-to-event data, in which observations correspond to waiting times until an event of interest such as death from a particular disease or failure of a component in a mechanical system. This type of data is unique due to the presence of censoring, a type of missing data that occurs when we do not observe the actual time of the event of interest but, instead, we have access to an approximation for it given by random interval in which the observation is known to belong. Most traditional methods are not designed to deal with censoring, and thus we need to adapt them to censored time-to-event data. In this paper, we focus on non-parametric goodness-of-fit testing procedures based on combining the Stein’s method and kernelized discrepancies. While for uncensored data, there is a natural way of implementing a kernelized Stein discrepancy test, for censored data there are several options, each of them with different advantages and disadvantages. In this paper, we propose a collection of kernelized Stein discrepancy tests for time-to-event data, and we study each of them theoretically and empirically; our experimental results show that our proposed methods perform better than existing tests, including previous tests based on a kernelized maximum mean discrepancy. Tamara Fernandez, Nicolas Rivera, Arthur Gretton |
ICML | 1 |
| 2020 | A kernel test for quasi-independenceabstractWe consider settings in which the data of interest correspond to pairs of ordered times, e.g, the birth times of the first and second child, the times at which a new user creates an account and makes the first purchase on a website, and the entry and survival times of patients in a clinical trial. In these settings, the two times are not independent (the second occurs after the first), yet it is still of interest to determine whether there exists significant dependence "beyond" their ordering in time. We refer to this notion as "quasi-(in)dependence." For instance, in a clinical trial, to avoid biased selection, we might wish to verify that recruitment times are quasi-independent of survival times, where dependencies might arise due to seasonal effects. In this paper, we propose a nonparametric statistical test of quasi-independence. Our test considers a potentially infinite space of alternatives, making it suitable for complex data where the nature of the possible quasi-dependence is not known in advance. Standard parametric approaches are recovered as special cases, such as the classical conditional Kendall's tau, and log-rank tests. The tests apply in the right-censored setting: an essential feature in clinical trials, where patients can withdraw from the study. We provide an asymptotic analysis of our test-statistic, and demonstrate in experiments that our test obtains better power than existing approaches, while being more computationally efficient. Tamara Fernandez, Marc Ditzhaus, Arthur Gretton |
NeurIPS | 1 |
| 2019 | A maximum-mean-discrepancy goodness-of-fit test for censored dataabstractWe introduce a kernel-based goodness-of-fit test for censored data, where observations may be missing in random time intervals: a common occurrence in clinical trials and industrial life-testing. The test statistic is straightforward to compute, as is the test threshold, and we establish consistency under the null. Unlike earlier approaches such as the Log-rank test, we make no assumptions as to how the data distribution might differ from the null, and our test has power against a very rich class of alternatives. In experiments, our test outperforms competing approaches for periodic and Weibull hazard functions (where risks are time dependent), and does not show the failure modes of tests that rely on user defined features. Moreover, in cases where classical tests are provably most powerful, our test performs almost as well, while being more general. Tamara Fernandez, Arthur Gretton |
AISTATS | 1 |
| 2016 | Gaussian Processes for Survival AnalysisabstractWe introduce a semi-parametric Bayesian model for survival analysis. The model is centred on a parametric baseline hazard, and uses a Gaussian process to model variations away from it nonparametrically, as well as dependence on covariates. As opposed to many other methods in survival analysis, our framework does not impose unnecessary constraints in the hazard rate or in the survival function. Furthermore, our model handles left, right and interval censoring mechanisms common in survival analysis. We propose a MCMC algorithm to perform inference and an approximation scheme based on random Fourier features to make computations faster. We report experimental results on synthetic and real data, showing that our model performs better than competing models such as Cox proportional hazards, ANOVA-DDP and random survival forests. Tamara Fernandez, Nicolas Rivera, Yee Whye Teh |
NIPS | 1 |