Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.0167

The random Tukey depth

J. A. Cuesta-Albertos·A. Nieto-Reyes
View original source ↗Read source document ↗Export metadata ↓

Abstract

The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires the consideration of all possible one-dimensional projections. In this paper we propose a random depth which approximates the Tukey depth. It only takes into account a finite number of one-dimensional projections which are chosen at random. Thus, this random depth requires a very small computation time even in high dimensional spaces. Moreover, it is easily extended to cover the functional framework. We present some simulations indicating how many projections should be considered depending on the sample size and on the dimension of the sample space. We also compare this depth with some others proposed in the literature. It is noteworthy that the random depth, based on a very low number of projections, obtains results very similar to those obtained with other depths.

Explore related subjects

stat.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. A. Cuesta-Albertos, A. Nieto-Reyes. 2007-07-02. The random Tukey depth. https://arxiv.org/abs/0707.0167

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A perturbation theory for Feynman-Kac models and their particle interpretations

We develop a perturbation analysis of Feynman--Kac models, describing how local errors introduced at each step of the Feynman--Kac recursion propagate over time. Under general conditions on the potential functions and the Markov transitions, which are shown to hold for a large class of state-space models, we prove that the global error for any time horizon $T\geq 1$ is bounded by $C\,Δ_T\log(1+Δ_T^{-1})$, where $Δ_T$ is the largest local error; this bound holds both for the prediction and the updated models. These conditions require no Lyapunov function and no stability of the Markov transitions, and allow for non-compact state spaces: confinement is provided by the potential functions. Our perturbation bounds hold in total variation and in the Kolmogorov norm; for the latter, we extend the Hardy--Krause variation and the Koksma--Hlawka inequality to unbounded domains. Our perturbation theory is applied to derive time-uniform bounds for linearized Kalman filters, Euler schemes for partially observed diffusions and nudged state-space models, as well as high-probability error bounds, uniform over whole trajectories, for particle filters and, more generally, for mean field particle methods such as sequential Monte Carlo and diffusion Monte Carlo algorithms.

stat.CO↗
arXiv2026

conformalForecast: An R package for sequential conformal prediction in time series

Reliable uncertainty quantification is central to modern forecasting. Conformal prediction offers model-agnostic intervals with coverage guarantee under exchangeability, but existing software often targets general prediction problems or individual time series procedures rather than integrated workflows for multistep forecasting applications. We introduce conformalForecast, an open-source R package for constructing, updating, and evaluating conformal prediction intervals for multistep time series forecasts. The package separates point forecasting from calibration, accepts forecasts from diverse sources through a common interface, and preserves horizon-specific forecast errors and calibration states. It implements several conformal calibration schemes spanning empirical-quantile, feedback-based, and dependence-aware approaches, together with tools for assessing coverage, interval width, and interval scores over time and across horizons. Fitted objects can be extended as new observations arrive while retaining previously issued intervals and avoiding recomputation at earlier forecast origins. An application to short-term electricity price forecasting across five Australian regions illustrates the workflow. Aggregate coverage is generally close to the nominal level, while rolling coverage and interval efficiency vary across methods and horizons. In the reported experiment, incremental updating reproduces full-reconstruction intervals under identical forecasting and calibration settings while substantially reducing computation. conformalForecast provides a reproducible and extensible framework linking conformal methodology with sequential forecasting practice.

stat.CO↗
arXiv2026

Multivariate Lévy Adaptive B-Spline Regression

We propose Multivariate Lévy Adaptive B-Spline Regression (MLABS), a Bayesian nonparametric regression model designed to capture nonlinear effects, interactions, and locally varying features of multivariate functions. MLABS represents the regression function as a random sum of low-order tensor-product B-spline basis functions under a finite Lévy random measure prior. The resulting representation adapts to the complexity and local structure of the regression function while favoring a sparse basis representation. For posterior inference, we develop a reversible-jump Markov chain Monte Carlo (MCMC) algorithm with Bayesian backfitting, collapsed trans-dimensional updates, and residual-guided proposals. These computational strategies are designed to improve posterior exploration across basis configurations of varying dimensions and structures. We also establish approximation bounds for functions with low-order interactions and heterogeneous smoothness. These bounds relate approximation accuracy to the number of basis terms. Simulation studies show that MLABS achieves competitive predictive performance across a wide range of regression settings, including high-dimensional problems. MLABS also demonstrates robust predictive performance across benchmark real datasets. In an environmental-mixture application, it attains predictive accuracy comparable to Bayesian kernel machine regression at substantially lower computational cost.

stat.CO↗