# Outlier-Robust Convex Segmentation

Source: [Outlier-Robust Convex Segmentation](<https://www.sota2.com/research/paper/68fa61961e209131ce9f4dc1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:01:28.850Z

Authors: Itamar Katz, Koby Crammer

Published: 2014-11-17T14:59:25.000Z

## Abstract

We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness to outliers is evaluated on two real-world tasks related to speech segmentation. Our algorithms outperform baseline segmentation algorithms.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1411.4503>)

[PDF](<https://arxiv.org/pdf/1411.4503.pdf>)
