Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization

Regularization choice changes the recovery phase diagrams of annealing-based binary compressed sensing. We develop a regularization-selection method that combines systematic parameter search with random forest regression. Under noiseless Gaussian measurements with known sparsity, reference parameters are selected from a candidate grid by minimizing mean squared reconstruction error over repeated simulated annealing (SA) trials. The fitted model predicts these reference values from signal dimension, sampling ratio, and sparsity. With predicted regularization, the SA recovery transition broadly follows the asymptotic reference boundary for box-constrained [Formula: see text] recovery at the larger signal dimensions examined. Without retraining, the same predictor supplies identical regularization values to SA and a quantum–classical hybrid solver. On matched problem instances, the hybrid solver yields smaller mean squared reconstruction errors than SA in parts of the evaluated parameter space. The resulting rule reuses the searched information for subsequent reconstruction without repeating candidate searches at each setting. The results quantify empirical performance under the stated finite candidate grid and solver settings; they do not constitute a solver-independent recovery guarantee or a time-to-solution comparison.

Authors

Institutions

Publication Details

Journal
Journal of the Physical Society of Japan
Published
2026-11-17
DOI
https://doi.org/10.7566/jpsj.95.124006
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization

Masayuki Ohzeki, Xiaoxin Huang
Journal of the Physical Society of Japan
Sparse and Compressive Sensing Techniques
article

Phase Transition in Binary Compressed Sensing via Annealing with Adaptive Regularization

Masayuki Ohzeki, Xiaoxin Huang
article en

Abstract

Regularization choice changes the recovery phase diagrams of annealing-based binary compressed sensing. We develop a regularization-selection method that combines systematic parameter search with random forest regression. Under noiseless Gaussian measurements with known sparsity, reference parameters are selected from a candidate grid by minimizing mean squared reconstruction error over repeated simulated annealing (SA) trials. The fitted model predicts these reference values from signal dimension, sampling ratio, and sparsity. With predicted regularization, the SA recovery transition broadly follows the asymptotic reference boundary for box-constrained [Formula: see text] recovery at the larger signal dimensions examined. Without retraining, the same predictor supplies identical regularization values to SA and a quantum–classical hybrid solver. On matched problem instances, the hybrid solver yields smaller mean squared reconstruction errors than SA in parts of the evaluated parameter space. The resulting rule reuses the searched information for subsequent reconstruction without repeating candidate searches at each setting. The results quantify empirical performance under the stated finite candidate grid and solver settings; they do not constitute a solver-independent recovery guarantee or a time-to-solution comparison.

Journal of the Physical Society of JapanVol. 95(12)
Tohoku University (JP), Institute of Science Tokyo (JP)
Cabinet Office, Government of Japan, Japan Science and Technology Agency
Sparse and Compressive Sensing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon