The group fused Lasso for multiple change-point detection

We present the group fused Lasso for detection of multiple change-points shared by a set of co-occurring one-dimensional signals. Change-points are detected by approximating the original signals with a constraint on the multidimensional total variation, leading to piecewise-constant approximations. Fast algorithms are proposed to solve the resulting optimization problems, either exactly or approximately. Conditions are given for consistency of both algorithms as the number of signals increases, and empirical evidence is provided to support the results on simulated and array comparative genomic hybridization data.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00602121
Author Bleakley, Kevin, Vert, Jean-Philippe
Maintainer CCSD
Last Updated November 17, 2026, 15:11 (UTC)
Created November 17, 2026, 15:11 (UTC)
Identifier hal-00602121
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Model selection in statistical learning (SELECT) ; Laboratoire de Mathématiques d'Orsay (LMO) ; Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de Saclay ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
creator Bleakley, Kevin
date 2011-06-21T00:00:00
harvest_object_id ae77c549-a1a8-4998-ac08-9d24f8feee1d
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2026-07-28T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/1106.4199
set_spec type:UNDEFINED