Asymptotic dynamics of alternating minimization for bilinear regression

Abstract This study investigates the dynamics of alternating minimization (AM) applied to a bilinear regression task with normally distributed covariates, under the asymptotic system size limit where the number of parameters and observations diverge at the same rate. This is achieved by employing the replica method to a multi-temperature glassy system which unfolds the algorithm’s time evolution. Our results show that the dynamics can be described effectively by a two-dimensional discrete stochastic process, where each step depends on all previous time steps, revealing the structure of the memory dependence in the evolution of AM. The theoretical framework developed in this work can be applied to the analysis of various iterative algorithms, extending beyond the scope of AM.

Authors

Publication Details

Journal
Journal of Statistical Mechanics Theory and Experiment
Published
2025-05-01
DOI
https://doi.org/10.1088/1742-5468/add1ce
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Asymptotic dynamics of alternating minimization for bilinear regression

Koki Okajima, T. Takahashi
Journal of Statistical Mechanics Theory and Experiment
Sparse and Compressive Sensing Techniques
article

Asymptotic dynamics of alternating minimization for bilinear regression

Koki Okajima, T. Takahashi
article en

Abstract

Abstract This study investigates the dynamics of alternating minimization (AM) applied to a bilinear regression task with normally distributed covariates, under the asymptotic system size limit where the number of parameters and observations diverge at the same rate. This is achieved by employing the replica method to a multi-temperature glassy system which unfolds the algorithm’s time evolution. Our results show that the dynamics can be described effectively by a two-dimensional discrete stochastic process, where each step depends on all previous time steps, revealing the structure of the memory dependence in the evolution of AM. The theoretical framework developed in this work can be applied to the analysis of various iterative algorithms, extending beyond the scope of AM.

Journal of Statistical Mechanics Theory and ExperimentVol. 2025(5)
Openalex Percentile: Top 87%
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.