Fast Min-ϵ Segmented Regression using Constant-Time Segment Merging
No confident code implementation found for this paper. 2 possible matches can be shown below.
No confident code implementation found for this paper. 2 possible matches can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model
EQA-MX: Embodied Question Answering using Multimodal Expression
One-Shot Compression of Large Edge-Exchangeable Graphs using Bits-Back Coding
Efficient Training of Language Models using Few-Shot Learning
MiraGe: Editable 2D Images using Gaussian Splatting
AssistGUI: Task-Oriented PC Graphical User Interface Automation
@article{ler2026fast,
title = {Fast Min-ϵ Segmented Regression using Constant-Time Segment Merging},
author = {Ansgar Lößer and Max Schlecht and F. Schintke and Joel Witzke and Matthias Weidlich and Björn Scheuermann},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:48a2d076dee5f5d997e05ad34cb1f91509b533cc},
journal = {ICML 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/48a2d076dee5f5d997e05ad34cb1f91509b533cc)