English

biniLasso: Automated cut-point detection via sparse cumulative binarization

Methodology 2026-02-13 v3

Abstract

We present biniLasso and its sparse variant (sparse biniLasso), novel methods for prognostic analysis of high-dimensional survival data that enable detection of multiple cut-points per feature. Our approach leverages the Cox proportional hazards model with two key innovations: (1) a cumulative binarization scheme with L1L_1-penalized coefficients operating on context-dependent cut-point candidates, and (2) for sparse biniLasso, additional uniLasso regularization to enforce sparsity while preserving univariate coefficient patterns. These innovations yield substantially improved interpretability, computational efficiency (4-11x faster than existing approaches), and prediction performance. Through extensive simulations, we demonstrate superior performance in cut-point detection, particularly in high-dimensional settings. Application to three genomic cancer datasets from TCGA confirms the methods' practical utility, with both variants showing enhanced risk prediction accuracy compared to conventional techniques.

Keywords

Cite

@article{arxiv.2503.16687,
  title  = {biniLasso: Automated cut-point detection via sparse cumulative binarization},
  author = {Abdollah Safari and Hamed Halisaz and Peter Loewen},
  journal= {arXiv preprint arXiv:2503.16687},
  year   = {2026}
}
R2 v1 2026-06-28T22:29:02.112Z