Abstract
The path algorithm of the fused lasso signal approximator is known to fail in finding change points when monotonically increasing or decreasing blocks exist in the mean vector. In this paper, we first understand why the standard path algorithm by Hoefling (2010) fails in the primal optimization problem. We then propose a modified path algorithm for the consistent recovery of the change points and study its properties theoretically and numerically.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
