Annika Betken
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Annika Betken has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Giorgio Micali
Department of Applied Mathematics, University of Twente 1 , 7500 AE Enschede
3 shared publications - Herold Dehling
Faculty of Mathematics Ruhr-Universität Bochum
2 shared publications - Hongwei Wen
University of Twente University of Twente University of Twente
2 shared publications - Johannes Schmidt-Hieber
Department of Applied Mathematics, University of Twente, Enschede, Netherlands
2 shared publications - Clement Lezane1 shared publication
Marie-Christine Düker
Https://ror.org/00f7hpc57 FAU Erlangen-Nürnberg
1 shared publication
Latest Publications
- Open Access
- 15 August 2025
- Published by Springer Nature in TEST
- Vol. 34 (4) , 927-980
Ordinal pattern-based change point detection
The ordinal patterns of a fixed number of consecutive values in a time series are the spatial ordering of these values. Counting how often a specific ordinal pattern occurs in a time series provides important insights into the properties of the time series. In this work, we prove the asymptotic normality of the relative frequency of ordinal patterns for time series with linear increments. Moreover, we apply ordinal patterns to detect changes in the distribution of a time series.
- 15 August 2025
- Published by Springer Nature in TEST
- Vol. 34 (4) , 927-980
Open AccessOrdinal pattern-based change point detection
The ordinal patterns of a fixed number of consecutive values in a time series are the spatial ordering of these values. Counting how often a specific ordinal pattern occurs in a time series provides important insights into the properties of the time series. In this work, we prove the asymptotic normality of the relative frequency of ordinal patterns for time series with linear increments. Moreover, we apply ordinal patterns to detect changes in the distribution of a time series.
- Open Access
- 22 July 2025
- Published by Cambridge University Press (CUP) in Econometric Theory
- Vol. 42 (4) , 1-50
HIGHER-ORDER APPROXIMATION FOR UNCERTAINTY QUANTIFICATION IN TIME-SERIES ANALYSIS
For time series with high temporal correlation, the empirical process converges rather slowly to its limiting distribution. Many statistics in change-point analysis, goodness-of-fit testing, and uncertainty quantification admit a representation as functionals of the empirical process and therefore inherit its slow convergence. As a result, inference based on the asymptotic distribution of those quantities is significantly affected by relatively small sample sizes. We assess the quality of higher-order approximations (HOAs) of the empirical process by deriving the asymptotic distribution of the corresponding error terms. Based on the limiting distribution of the higher-order terms, we propose a novel approach to calculate confidence intervals for statistical quantities such as the median. In a simulation study, we compare coverage rates and lengths of these confidence intervals with those based on the asymptotic distribution of the empirical process and highlight some benefits of HOAs of the empirical process.
- 22 July 2025
- Published by Cambridge University Press (CUP) in Econometric Theory
- Vol. 42 (4) , 1-50
Open AccessHIGHER-ORDER APPROXIMATION FOR UNCERTAINTY QUANTIFICATION IN TIME-SERIES ANALYSIS
For time series with high temporal correlation, the empirical process converges rather slowly to its limiting distribution. Many statistics in change-point analysis, goodness-of-fit testing, and uncertainty quantification admit a representation as functionals of the empirical process and therefore inherit its slow convergence. As a result, inference based on the asymptotic distribution of those quantities is significantly affected by relatively small sample sizes. We assess the quality of higher-order approximations (HOAs) of the empirical process by deriving the asymptotic distribution of the corresponding error terms. Based on the limiting distribution of the higher-order terms, we propose a novel approach to calculate confidence intervals for statistical quantities such as the median. In a simulation study, we compare coverage rates and lengths of these confidence intervals with those based on the asymptotic distribution of the empirical process and highlight some benefits of HOAs of the empirical process.
- Open Access
On the Robustness of Kernel Ridge Regression Using the Cauchy Loss Function
Robust regression aims to develop methods for estimating an unknown regression function in the presence of outliers, heavy-tailed distributions, or contaminated data, which can severely impact performance. Most existing theoretical results in robust regression assume that the noise has a finite absolute mean, an assumption violated by certain distributions, such as Cauchy and some Pareto noise. In this paper, we introduce a generalized Cauchy noise framework that accommodates all noise distributions with finite moments of any order, even when the absolute mean is infinite. Within this framework, we study the \textit{kernel Cauchy ridge regressor} (\textit{KCRR}), which minimizes a regularized empirical Cauchy risk to achieve robustness. To derive the $L_2$-risk bound for KCRR, we establish a connection between the excess Cauchy risk and $L_2$-risk for sufficiently large scale parameters of the Cauchy loss, which reveals that these two risks are equivalent. Furthermore, under the assumption that the regression function satisfies Hölder smoothness, we derive excess Cauchy risk bounds for KCRR, showing improved performance as the scale parameter decreases. By considering the twofold effect of the scale parameter on the excess Cauchy risk and its equivalence with the $L_2$-risk, we establish the almost minimax-optimal convergence rate for KCRR in terms of $L_2$-risk, highlighting the robustness of the Cauchy loss in handling various types of noise. Finally, we validate the effectiveness of KCRR through experiments on both synthetic and real-world datasets under diverse noise corruption scenarios.
Open AccessOn the Robustness of Kernel Ridge Regression Using the Cauchy Loss Function
Robust regression aims to develop methods for estimating an unknown regression function in the presence of outliers, heavy-tailed distributions, or contaminated data, which can severely impact performance. Most existing theoretical results in robust regression assume that the noise has a finite absolute mean, an assumption violated by certain distributions, such as Cauchy and some Pareto noise. In this paper, we introduce a generalized Cauchy noise framework that accommodates all noise distributions with finite moments of any order, even when the absolute mean is infinite. Within this framework, we study the \textit{kernel Cauchy ridge regressor} (\textit{KCRR}), which minimizes a regularized empirical Cauchy risk to achieve robustness. To derive the $L_2$-risk bound for KCRR, we establish a connection between the excess Cauchy risk and $L_2$-risk for sufficiently large scale parameters of the Cauchy loss, which reveals that these two risks are equivalent. Furthermore, under the assumption that the regression function satisfies Hölder smoothness, we derive excess Cauchy risk bounds for KCRR, showing improved performance as the scale parameter decreases. By considering the twofold effect of the scale parameter on the excess Cauchy risk and its equivalence with the $L_2$-risk, we establish the almost minimax-optimal convergence rate for KCRR in terms of $L_2$-risk, highlighting the robustness of the Cauchy loss in handling various types of noise. Finally, we validate the effectiveness of KCRR through experiments on both synthetic and real-world datasets under diverse noise corruption scenarios.
- Open Access
Ordinal Patterns Based Change Points Detection
The ordinal patterns of a fixed number of consecutive values in a time series is the spatial ordering of these values. Counting how often a specific ordinal pattern occurs in a time series provides important insights into the properties of the time series. In this work, we prove the asymptotic normality of the relative frequency of ordinal patterns for time series with linear increments. Moreover, we apply ordinal patterns to detect changes in the distribution of a time series.
Open AccessOrdinal Patterns Based Change Points Detection
The ordinal patterns of a fixed number of consecutive values in a time series is the spatial ordering of these values. Counting how often a specific ordinal pattern occurs in a time series provides important insights into the properties of the time series. In this work, we prove the asymptotic normality of the relative frequency of ordinal patterns for time series with linear increments. Moreover, we apply ordinal patterns to detect changes in the distribution of a time series.
- Open Access
Median of Forests for Robust Density Estimation
Robust density estimation refers to the consistent estimation of the density function even when the data is contaminated by outliers. We find that existing forest density estimation at a certain point is inherently resistant to the outliers outside the cells containing the point, which we call \textit{non-local outliers}, but not resistant to the rest \textit{local outliers}. To achieve robustness against all outliers, we propose an ensemble learning algorithm called \textit{medians of forests for robust density estimation} (\textit{MFRDE}), which adopts a pointwise median operation on forest density estimators fitted on subsampled datasets. Compared to existing robust kernel-based methods, MFRDE enables us to choose larger subsampling sizes, sacrificing less accuracy for density estimation while achieving robustness. On the theoretical side, we introduce the local outlier exponent to quantify the number of local outliers. Under this exponent, we show that even if the number of outliers reaches a certain polynomial order in the sample size, MFRDE is able to achieve almost the same convergence rate as the same algorithm on uncontaminated data, whereas robust kernel-based methods fail. On the practical side, real data experiments show that MFRDE outperforms existing robust kernel-based methods. Moreover, we apply MFRDE to anomaly detection to showcase a further application.
Open AccessMedian of Forests for Robust Density Estimation
Robust density estimation refers to the consistent estimation of the density function even when the data is contaminated by outliers. We find that existing forest density estimation at a certain point is inherently resistant to the outliers outside the cells containing the point, which we call \textit{non-local outliers}, but not resistant to the rest \textit{local outliers}. To achieve robustness against all outliers, we propose an ensemble learning algorithm called \textit{medians of forests for robust density estimation} (\textit{MFRDE}), which adopts a pointwise median operation on forest density estimators fitted on subsampled datasets. Compared to existing robust kernel-based methods, MFRDE enables us to choose larger subsampling sizes, sacrificing less accuracy for density estimation while achieving robustness. On the theoretical side, we introduce the local outlier exponent to quantify the number of local outliers. Under this exponent, we show that even if the number of outliers reaches a certain polynomial order in the sample size, MFRDE is able to achieve almost the same convergence rate as the same algorithm on uncontaminated data, whereas robust kernel-based methods fail. On the practical side, real data experiments show that MFRDE outperforms existing robust kernel-based methods. Moreover, we apply MFRDE to anomaly detection to showcase a further application.
- Open Access
Differentially Private Algorithms for Linear Queries via Stochastic Convex Optimization
This article establishes a method to answer a finite set of linear queries on a given dataset while ensuring differential privacy. To achieve this, we formulate the corresponding task as a saddle-point problem, i.e. an optimization problem whose solution corresponds to a distribution minimizing the difference between answers to the linear queries based on the true distribution and answers from a differentially private distribution. Against this background, we establish two new algorithms for corresponding differentially private data release: the first is based on the differentially private Frank-Wolfe method, the second combines randomized smoothing with stochastic convex optimization techniques for a solution to the saddle-point problem. While previous works assess the accuracy of differentially private algorithms with reference to the empirical data distribution, a key contribution of our work is a more natural evaluation of the proposed algorithms' accuracy with reference to the true data-generating distribution.
Open AccessDifferentially Private Algorithms for Linear Queries via Stochastic Convex Optimization
This article establishes a method to answer a finite set of linear queries on a given dataset while ensuring differential privacy. To achieve this, we formulate the corresponding task as a saddle-point problem, i.e. an optimization problem whose solution corresponds to a distribution minimizing the difference between answers to the linear queries based on the true distribution and answers from a differentially private distribution. Against this background, we establish two new algorithms for corresponding differentially private data release: the first is based on the differentially private Frank-Wolfe method, the second combines randomized smoothing with stochastic convex optimization techniques for a solution to the saddle-point problem. While previous works assess the accuracy of differentially private algorithms with reference to the empirical data distribution, a key contribution of our work is a more natural evaluation of the proposed algorithms' accuracy with reference to the true data-generating distribution.
- Open Access
A Bootstrap Test for Independence of Time Series Based on the Distance Covariance
We present a test for independence of two strictly stationary time series based on a bootstrap procedure for the distance covariance. Our test detects any kind of dependence between the two time series within an arbitrary maximum lag $L$. In simulation studies, our test outperforms alternative testing procedures. In proving the validity of the underlying bootstrap procedure, we generalise bounds for the Wasserstein distance between an empirical measure and its marginal distribution under the assumption of $\alpha$-mixing. Previous results of this kind only existed for i.i.d. processes.Open AccessA Bootstrap Test for Independence of Time Series Based on the Distance Covariance
We present a test for independence of two strictly stationary time series based on a bootstrap procedure for the distance covariance. Our test detects any kind of dependence between the two time series within an arbitrary maximum lag $L$. In simulation studies, our test outperforms alternative testing procedures. In proving the validity of the underlying bootstrap procedure, we generalise bounds for the Wasserstein distance between an empirical measure and its marginal distribution under the assumption of $\alpha$-mixing. Previous results of this kind only existed for i.i.d. processes. - Open Access
Test for independence of long-range dependent time series using distance covariance
We apply the concept of distance covariance for testing independence of two long-range dependent time series. As test statistic we propose a linear combination of empirical distance cross-covariances. We derive the asymptotic distribution of the test statistic, and we show consistency against arbitrary alternatives. The asymptotic theory developed in this paper is based on a novel non-central limit theorem for stochastic processes with values in an $L^2$-Hilbert space. This limit theorem is of general theoretical interest which goes beyond the context of this article. Subject to the dependence in the data, the standardization and the limit distributions of the proposed test statistic vary. Since the limit distributions are unknown, we propose a subsampling procedure to determine the critical values for the proposed test, and we provide a proof for the validity of subsampling. In a simulation study, we investigate the finite-sample behavior of our test, and we compare its performance to tests based on the empirical cross-covariances. As an application of our results we analyze the cross-dependencies between mean monthly discharges of three rivers.
Open AccessTest for independence of long-range dependent time series using distance covariance
We apply the concept of distance covariance for testing independence of two long-range dependent time series. As test statistic we propose a linear combination of empirical distance cross-covariances. We derive the asymptotic distribution of the test statistic, and we show consistency against arbitrary alternatives. The asymptotic theory developed in this paper is based on a novel non-central limit theorem for stochastic processes with values in an $L^2$-Hilbert space. This limit theorem is of general theoretical interest which goes beyond the context of this article. Subject to the dependence in the data, the standardization and the limit distributions of the proposed test statistic vary. Since the limit distributions are unknown, we propose a subsampling procedure to determine the critical values for the proposed test, and we provide a proof for the validity of subsampling. In a simulation study, we investigate the finite-sample behavior of our test, and we compare its performance to tests based on the empirical cross-covariances. As an application of our results we analyze the cross-dependencies between mean monthly discharges of three rivers.
- Open Access
Higher-order approximation for uncertainty quantification in time series analysis
For time series with high temporal correlation, the empirical process converges rather slowly to its limiting distribution. Many statistics in change-point analysis, goodness-of-fit testing and uncertainty quantification admit a representation as functionals of the empirical process and therefore inherit its slow convergence. Inference based on the asymptotic distribution of those quantities becomes highly impacted by relatively small sample sizes. We assess the quality of higher-order approximations of the empirical process by deriving the asymptotic distribution of the corresponding error terms. Based on the limiting distribution of the higher-order terms, we propose a novel approach to calculate confidence regions for statistical quantities such as the median. In a simulation study, we compare coverage rate and size of our confidence regions with those based on the asymptotic distribution of the empirical process and highlight some of our method's benefits.
Open AccessHigher-order approximation for uncertainty quantification in time series analysis
For time series with high temporal correlation, the empirical process converges rather slowly to its limiting distribution. Many statistics in change-point analysis, goodness-of-fit testing and uncertainty quantification admit a representation as functionals of the empirical process and therefore inherit its slow convergence. Inference based on the asymptotic distribution of those quantities becomes highly impacted by relatively small sample sizes. We assess the quality of higher-order approximations of the empirical process by deriving the asymptotic distribution of the corresponding error terms. Based on the limiting distribution of the higher-order terms, we propose a novel approach to calculate confidence regions for statistical quantities such as the median. In a simulation study, we compare coverage rate and size of our confidence regions with those based on the asymptotic distribution of the empirical process and highlight some of our method's benefits.