cs.LGMar 1, 2026

Nonconvex Latent Optimally Partitioned Block-Sparse Recovery via Log-Sum and Minimax Concave Penalties

Authors: Takanobu Furuhashi, Hiroki Kuroda, Masahiro Yukawa, Qibin Zhao, Hidekata Hontani, Tatsuya Yokota

Organizations: Nagoya Institute of Technology, Nagoya, Japan · Nagaoka University of Technology, Niigata, Japan · Keio University, Yokohama, Japan · RIKEN Center for Advanced Intelligence Project, Tokyo, Japan

Abstract

We propose two nonconvex regularization methods, LogLOP-l2/l1 and AdaLOP-l2/l1, for recovering block-sparse signals with unknown block partitions. These methods address the underestimation bias of existing convex approaches by extending log-sum penalty and the Minimax Concave Penalty (MCP) to the block-sparse domain via novel variational formulations. Unlike Generalized Moreau Enhancement (GME) and Bayesian methods dependent on the squared-error data fidelity term, our proposed methods are compatible with a broad range of data fidelity terms. We develop efficient Alternating Direction Method of Multipliers (ADMM)-based algorithms for these formulations that exhibit stable empirical convergence. Numerical experiments on synthetic data, angular power spectrum estimation, and denoising of nanopore currents demonstrate that our methods outperform state-of-the-art baselines in estimation accuracy.

Explore similar work

CardsList
  1. Deep Unfolded Latent Optimally Partitioned-l2/l1 Networks for Data-driven Block-Sparse Recovery

    Jun 10, 2026Takanobu Furuhashi, Hidekata Hontani, Qibin Zhao +1Sparse RecoveryDeep Unfolding

  2. Demixing Sparse Signals from Nonlinear Observations using Generalized Non-convex Regularization

    Jul 12, 2026Raziyeh TakbiriSparse RecoveryNonconvex Optimization

  3. A Unified Fractional Regularization Framework for Sparse Recovery

    Apr 25, 2026Yinhao Zhao, Yaohua Hu, Hao WangSparse RecoveryNonconvex Optimization