Data Depth as a Risk

• URL: http://arxiv.org/abs/2507.08518v1
• Date: Fri, 11 Jul 2025 12:05:03 GMT
• Title: Data Depth as a Risk
• Authors: Arturo Castellanos, Pavlo Mozharovskyi,
• Abstract summary: We show that the halfspace depth can also be regarded as the minimum loss of a set of classifiers for a specific labelling of the points.<n>This new angle naturally leads to a family of "loss" depths, extending to well-studied classifiers such as, e.g., SVM or logistic regression.
• Score: 3.046315755726937
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Data depths are score functions that quantify in an unsupervised fashion how central is a point inside a distribution, with numerous applications such as anomaly detection, multivariate or functional data analysis, arising across various fields. The halfspace depth was the first depth to aim at generalising the notion of quantile beyond the univariate case. Among the existing variety of depth definitions, it remains one of the most used notions of data depth. Taking a different angle from the quantile point of view, we show that the halfspace depth can also be regarded as the minimum loss of a set of classifiers for a specific labelling of the points. By changing the loss or the set of classifiers considered, this new angle naturally leads to a family of "loss depths", extending to well-studied classifiers such as, e.g., SVM or logistic regression, among others. This framework directly inherits computational efficiency of existing machine learning algorithms as well as their fast statistical convergence rates, and opens the data depth realm to the high-dimensional setting. Furthermore, the new loss depths highlight a connection between the dataset and the right amount of complexity or simplicity of the classifiers. The simplicity of classifiers as well as the interpretation as a risk makes our new kind of data depth easy to explain, yet efficient for anomaly detection, as is shown by experiments.

Related papers

• A Dataset for Semantic Segmentation in the Presence of Unknowns [49.795683850385956]
  Existing datasets allow evaluation of only knowns or unknowns - but not both.<n>We propose a novel anomaly segmentation dataset, ISSU, that features a diverse set of anomaly inputs from cluttered real-world environments.<n>The dataset is twice larger than existing anomaly segmentation datasets.
  arXiv  Detail & Related papers  (2025-03-28T10:31:01Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• SemHint-MD: Learning from Noisy Semantic Labels for Self-Supervised Monocular Depth Estimation [19.229255297016635]
  Self-supervised depth estimation can be trapped in a local minimum due to the gradient-locality issue of the photometric loss. We present a framework to enhance depth by leveraging semantic segmentation to guide the network to jump out of the local minimum.
  arXiv  Detail & Related papers  (2023-03-31T17:20:27Z)
• Adaptive Data Depth via Multi-Armed Bandits [6.29475963948119]
  We develop an instance-adaptive algorithm for data depth computation. We focus on simplicial depth, developed by Liu (1990), which has emerged as a promising notion of depth. We show that we can reduce the complexity of identifying the deepest point in the data set from $O(nd)$ to $tildeO(nd-(d-1)alpha/2)$, where $tildeO$ suppresses logarithmic factors.
  arXiv  Detail & Related papers  (2022-11-08T03:44:22Z)
• Anomaly detection using data depth: multivariate case [3.046315755726937]
  Anomaly detection is a branch of data analysis and machine learning. Data depth is a statistical function that measures belongingness of any point of the space to a data set. This article studies data depth as an efficient anomaly detection tool, assigning abnormality labels to observations with lower depth values.
  arXiv  Detail & Related papers  (2022-10-06T12:14:25Z)
• Towards Domain-agnostic Depth Completion [28.25756709062647]
  Existing depth completion methods are often targeted at a specific sparse depth type and generalize poorly across task domains. We present a method to complete sparse/semi-dense, noisy, and potentially low-resolution depth maps obtained by various range sensors. Our method shows superior cross-domain generalization ability against state-of-the-art depth completion methods.
  arXiv  Detail & Related papers  (2022-07-29T04:10:22Z)
• Depth Completion using Plane-Residual Representation [84.63079529738924]
  We introduce a novel way of interpreting depth information with the closest depth plane label $p$ and a residual value $r$, as we call it, Plane-Residual (PR) representation. By interpreting depth information in PR representation and using our corresponding depth completion network, we were able to acquire improved depth completion performance with faster computation.
  arXiv  Detail & Related papers  (2021-04-15T10:17:53Z)
• Scalable Vector Gaussian Information Bottleneck [19.21005180893519]
  We study a variation of the problem, called scalable information bottleneck, in which the encoder outputs multiple descriptions of the observation. We derive a variational inference type algorithm for general sources with unknown distribution; and show means of parametrizing it using neural networks.
  arXiv  Detail & Related papers  (2021-02-15T12:51:26Z)
• BiDet: An Efficient Binarized Object Detector [96.19708396510894]
  We propose a binarized neural network learning method called BiDet for efficient object detection. Our BiDet fully utilizes the representational capacity of the binary neural networks for object detection by redundancy removal. Our method outperforms the state-of-the-art binary neural networks by a sizable margin.
  arXiv  Detail & Related papers  (2020-03-09T08:16:16Z)
• Depthwise Non-local Module for Fast Salient Object Detection Using a Single Thread [136.2224792151324]
  We propose a new deep learning algorithm for fast salient object detection. The proposed algorithm achieves competitive accuracy and high inference efficiency simultaneously with a single CPU thread.
  arXiv  Detail & Related papers  (2020-01-22T15:23:48Z)
• Single Image Depth Estimation Trained via Depth from Defocus Cues [105.67073923825842]
  Estimating depth from a single RGB image is a fundamental task in computer vision. In this work, we rely, instead of different views, on depth from focus cues. We present results that are on par with supervised methods on KITTI and Make3D datasets and outperform unsupervised learning approaches.
  arXiv  Detail & Related papers  (2020-01-14T20:22:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.