Renewable Lasso without Batch-Number Constraints: A Gradient-Enhanced Approach

Junzhuo Gao, Ling Peng, Xu Guo, Heng Lian
6/10/2026
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

We study online estimation for high-dimensional generalized linear models with streaming data. First, for the non-distributed setting, we propose a gradient-enhanced surrogate loss that approximates the cumulative loss using only historical summaries, which modifies and improves upon the existing renewable estimation approach for the same model in the high-dimensional setting, and removes the batch-number constraint in previous studies. We then extend the method to distributed streaming data under the master-client architecture, where batches are partitioned across sites and only summaries (gradient vectors) are exchanged. Instead of directing applying the popular method of Jordan et al. (2019) to the surrogate quadratic loss, our adjusted approach does not require the clients to compute the full surrogate loss. We derive non-asymptotic error bounds under the high-dimensional scaling, without the stringent constraint on the number of batches in the previous studies. Simulation results under linear and logistic models, together with a real-data application, show improved accuracy over existing renewable estimators.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{gao2026renewable,
  title  = {Renewable Lasso without Batch-Number Constraints: A Gradient-Enhanced Approach},
  author = {Junzhuo Gao and Ling Peng and Xu Guo and Heng Lian},
  year   = {2026},
  eprint = {2606.11738},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.11738v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.11738.svg)](https://codeofpaper.com/paper/2606.11738)

Discussion