Use `KernSeg` with model selection as described in JMLR paper
See original GitHub issueSylvain Arlot, Alain Celisse and Zaid Harchaoui provide theory and a heuristic for model selection with KernSeg
in their paper A Kernel Multiple Change-point Algorithm via Model Selection. See 3.3.2, Theorem 2 and appendix B.3.
The penalty they propose does not scale linearly with the number of change points, so sadly it is incompatible with the current implementation. Furthermore the heuristic they propose requires knowledge of the respective losses for a set of possible numbers of split points, which currently (to my best understanding) cannot be recovered without expensive refits.
It would be great if this could be added.
Issue Analytics
- State:
- Created 2 years ago
- Comments:7 (4 by maintainers)
Top Results From Across the Web
Use of the Zero-Norm with Linear Models and Kernel Methods
Applications we investigate which aid our discussion include variable and feature selection on biological microarray data, and multicategory classification.
Read more >SimpleMKL - Journal of Machine Learning Research
In this paper, we address the MKL problem through a weighted 2-norm regularization formulation with an addi- tional constraint on the weights that...
Read more >JMLR Volume 12 - Journal of Machine Learning Research
Bayesian Generalized Kernel Mixed Models: Zhihua Zhang, Guang Dai, ... Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader ...
Read more >JMLR Volume 22 - Journal of Machine Learning Research
On the Optimality of Kernel-Embedding Based Goodness-of-Fit Tests: Krishnakumar ... A Unified Sample Selection Framework for Output Noise Filtering: An ...
Read more >JMLR Volume 20 - Journal of Machine Learning Research
Using Simulation to Improve Sample-Efficiency of Bayesian Optimization for Bipedal Robots ... A Kernel Multiple Change-point Algorithm via Model Selection.
Read more >Top Related Medium Post
No results found
Top Related StackOverflow Question
No results found
Troubleshoot Live Code
Lightrun enables developers to add logs, metrics and snapshots to live code - no restarts or redeploys required.
Start FreeTop Related Reddit Thread
No results found
Top Related Hackernoon Post
No results found
Top Related Tweet
No results found
Top Related Dev.to Post
No results found
Top Related Hashnode Post
No results found
Top GitHub Comments
If you are up for it, that would be great. The idea would be to do a didactic example of this heuristics (in the spirit of this example but with simulated data).
You only need to create a Jupyter notebook in
docs/examples
and we’ll take care of the integration to the docs.Thanks @deepcharles and @oboulant for the input and thank you for working on
ruptures
.I believe the following code implements the heuristic defined in the JMLR paper:
Let me know if you would like to add this to the existing package. I could then open a PR.