AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

A Sharp Error Analysis for the Fused Lasso, with Application to Approximate Changepoint Screening

Kevin Lin, James L Sharpnack, Alessandro Rinaldo, Ryan J Tibshirani

NeurIPS 2017 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use sharper analysis (lower interpolant) with tuning λ=(nWn)^{1/4} for fused lassofused lasso · sparse changepoints, s0=O(1), evenly spacedexpected squared error rateImproved
Fused lasso rate is suboptimal vs. Guntuboyina et al. (2017) sharper log n/n ratefused lasso error analysis · sparse changepoints, s0=O(1), Wn=Θ(n)expected squared error rateNo clear effect
Extend fused lasso analysis to exponential family (Poisson, binomial) data with bounded parametersfused lasso exponential family extension · Poisson/binomial changepoint dataexpected squared error rateMixed
Post-process fused lasso changepoints with Haar-like filter to discard spurious changepointsfused lasso estimated changepoints · approximate changepoint recovery, s0=O(1)Hausdorff distance boundImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy