Ayaka Sakata
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ayaka Sakata has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Koji Hukushima
The University of Tokyo
6 shared publications - Yoshiyuki Kabashima
The University of Tokyo
6 shared publications Kunihiko Kaneko
Center for Complex Systems Biology Universal Biology Institute University of Tokyo 153-8902 Komaba Tokyo Japan
5 shared publications- Kunihiko Kaneko
Niels Bohr Institute University of Copenhagen Blegdamsvej 17 2100 Copenhagen Denmark
5 shared publications - Tomoyuki Obuchi
Kyoto University
4 shared publications - Yingying Xu
Department of Computer Science, School of Science, Aalto University, PO Box 15400, FI-00076 Aalto, Finland
2 shared publications
Latest Publications
- 1 September 2026
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2026 (9) , 093403
Perfect reconstruction of sparse signals using nonconvexity control and one-step RSB message passing
We consider sparse signal reconstruction via minimization of the smoothly clipped absolute deviation penalty, and develop one-step replica-symmetry-breaking (1RSB) extensions of approximate message passing (AMP), termed 1RSB-AMP. Starting from the 1RSB formulation of belief propagation, we derive explicit update rules of 1RSB-AMP together with the corresponding state evolution (1RSB-SE) equations. A detailed comparison shows that 1RSB-AMP and 1RSB-SE agree remarkably well at the macroscopic level, even in parameter regions where replica-symmetric (RS) AMP, termed RS-AMP, diverges and where the 1RSB description itself is not expected to be thermodynamically exact. Fixed-point analysis of 1RSB-SE reveals a phase diagram consisting of success, failure, and diverging phases, as in the RS case. However, the diverging-region boundary now depends on the Parisi parameter due to the 1RSB ansatz, and we propose a new criterion—minimizing the size of the diverging region—rather than the conventional zero-complexity condition, to determine its value. Combining this criterion with the nonconvexity-control protocol proposed in a previous RS study improves the algorithmic limit of perfect reconstruction compared with RS-AMP. Numerical solutions of 1RSB-SE and experiments with 1RSB-AMP confirm that this improved limit is achieved in practice, though the gain is modest and remains slightly inferior to the Bayes-optimal threshold. We also report the behavior of thermodynamic quantities—overlaps, free entropy, complexity, and the non-self-averaging susceptibility—that characterize the 1RSB phase in this problem.
- 1 September 2026
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2026 (9) , 093403
Perfect reconstruction of sparse signals using nonconvexity control and one-step RSB message passing
We consider sparse signal reconstruction via minimization of the smoothly clipped absolute deviation penalty, and develop one-step replica-symmetry-breaking (1RSB) extensions of approximate message passing (AMP), termed 1RSB-AMP. Starting from the 1RSB formulation of belief propagation, we derive explicit update rules of 1RSB-AMP together with the corresponding state evolution (1RSB-SE) equations. A detailed comparison shows that 1RSB-AMP and 1RSB-SE agree remarkably well at the macroscopic level, even in parameter regions where replica-symmetric (RS) AMP, termed RS-AMP, diverges and where the 1RSB description itself is not expected to be thermodynamically exact. Fixed-point analysis of 1RSB-SE reveals a phase diagram consisting of success, failure, and diverging phases, as in the RS case. However, the diverging-region boundary now depends on the Parisi parameter due to the 1RSB ansatz, and we propose a new criterion—minimizing the size of the diverging region—rather than the conventional zero-complexity condition, to determine its value. Combining this criterion with the nonconvexity-control protocol proposed in a previous RS study improves the algorithmic limit of perfect reconstruction compared with RS-AMP. Numerical solutions of 1RSB-SE and experiments with 1RSB-AMP confirm that this improved limit is achieved in practice, though the gain is modest and remains slightly inferior to the Bayes-optimal threshold. We also report the behavior of thermodynamic quantities—overlaps, free entropy, complexity, and the non-self-averaging susceptibility—that characterize the 1RSB phase in this problem.
- Open Access
- 26 December 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (4) , 043296
Evolutionary shaping of low-dimensional path facilitates robust and plastic switching between phenotypes
Biological systems must be robust for stable functioning against perturbations, but robustness alone is insufficient. The ability to switch between appropriate states (phenotypes) in response to different conditions is essential for biological functions, as observed in allosteric enzymes and motor proteins. How are robustness and plasticity simultaneously acquired through evolution? In an attempt to answer this question, we examine the evolution of genotypes that realize plastic switching between two endpoint phenotypes upon external inputs as well as stationary expressions of phenotypes. Here, we introduce a statistical physics model consisting of spins, with active sites and regulatory sites, which are distinct from each other. In our model, we represent the phenotype and genotype as spin configurations and spin-spin interactions, respectively. The fitness for selection is given by the spin configuration, whose behavior is governed by the genotypes. Specifically, the fitness for selection is given so that it takes a higher value as more active sites take two requested spin configurations depending on the states of the regulatory sites. The remaining spins do not directly affect the fitness, but they interact with other spins. We numerically evolve the matrices of spin-spin interactions (genotypes) by changing them with mutations and selection of those with higher fitness. Our numerical simulations show that characteristic genotypes with higher fitness evolve slightly above the phase transition temperature between replica-symmetric and replica-symmetry-breaking phase in spin-glass theory. These genotypes shape the two spin configurations separately depending on the regulation. Each phenotype is primarily represented by the first or second eigenmode of the genotypes. Smooth switching between the two phenotypes is achieved by following a one-dimensional quarter-circle that connects them. Upon changes in regulations, spin configurations are attracted to this path, which allows for robust and plastic switching between the two phenotypes. The statistical physics analysis based on the two eigenmodes shows that the free energy landscape has a valley along the one-dimensional quarter-circle switching path. Robust attraction to the path is achieved through the evolution of the interactions within nonactive and nonregulatory spin sites, which themselves do not contribute to fitness. Our findings indicate that the compatibility between robustness and plasticity is acquired by the evolution of low dimensionality in the phenotype space, which will be relevant to the understanding of the robust function of protein as well as material design.
- 26 December 2023
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 5 (4) , 043296
Open AccessEvolutionary shaping of low-dimensional path facilitates robust and plastic switching between phenotypes
Biological systems must be robust for stable functioning against perturbations, but robustness alone is insufficient. The ability to switch between appropriate states (phenotypes) in response to different conditions is essential for biological functions, as observed in allosteric enzymes and motor proteins. How are robustness and plasticity simultaneously acquired through evolution? In an attempt to answer this question, we examine the evolution of genotypes that realize plastic switching between two endpoint phenotypes upon external inputs as well as stationary expressions of phenotypes. Here, we introduce a statistical physics model consisting of spins, with active sites and regulatory sites, which are distinct from each other. In our model, we represent the phenotype and genotype as spin configurations and spin-spin interactions, respectively. The fitness for selection is given by the spin configuration, whose behavior is governed by the genotypes. Specifically, the fitness for selection is given so that it takes a higher value as more active sites take two requested spin configurations depending on the states of the regulatory sites. The remaining spins do not directly affect the fitness, but they interact with other spins. We numerically evolve the matrices of spin-spin interactions (genotypes) by changing them with mutations and selection of those with higher fitness. Our numerical simulations show that characteristic genotypes with higher fitness evolve slightly above the phase transition temperature between replica-symmetric and replica-symmetry-breaking phase in spin-glass theory. These genotypes shape the two spin configurations separately depending on the regulation. Each phenotype is primarily represented by the first or second eigenmode of the genotypes. Smooth switching between the two phenotypes is achieved by following a one-dimensional quarter-circle that connects them. Upon changes in regulations, spin configurations are attracted to this path, which allows for robust and plastic switching between the two phenotypes. The statistical physics analysis based on the two eigenmodes shows that the free energy landscape has a valley along the one-dimensional quarter-circle switching path. Robust attraction to the path is achieved through the evolution of the interactions within nonactive and nonregulatory spin sites, which themselves do not contribute to fitness. Our findings indicate that the compatibility between robustness and plasticity is acquired by the evolution of low dimensionality in the phenotype space, which will be relevant to the understanding of the robust function of protein as well as material design.
- Open Access
- 15 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (9) , 5902-5920
Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing
We study the inference problem in the noisy group testing to identify defective items from the perspective of the decision theory. We introduce Bayesian inference and consider the Bayesian optimal setting in which the true generative process of the test results is known. We demonstrate the adequacy of the posterior marginal probability in the Bayesian optimal setting as a diagnostic variable based on the area under the curve (AUC). Using the posterior marginal probability, we derive the general expression of the optimal cutoff value that yields the minimum expected risk function. Furthermore, we evaluate the performance of the Bayesian group testing without knowing the true states of the items: defective or non-defective. By introducing an analytical method from statistical physics, we derive the receiver operating characteristics curve, and quantify the corresponding AUC under the Bayesian optimal setting. The obtained analytical results precisely describes the actual performance of the belief propagation algorithm defined for single samples when the number of items is sufficiently large.
- 15 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (9) , 5902-5920
Open AccessDecision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing
We study the inference problem in the noisy group testing to identify defective items from the perspective of the decision theory. We introduce Bayesian inference and consider the Bayesian optimal setting in which the true generative process of the test results is known. We demonstrate the adequacy of the posterior marginal probability in the Bayesian optimal setting as a diagnostic variable based on the area under the curve (AUC). Using the posterior marginal probability, we derive the general expression of the optimal cutoff value that yields the minimum expected risk function. Furthermore, we evaluate the performance of the Bayesian group testing without knowing the true states of the items: defective or non-defective. By introducing an analytical method from statistical physics, we derive the receiver operating characteristics curve, and quantify the corresponding AUC under the Bayesian optimal setting. The obtained analytical results precisely describes the actual performance of the belief propagation algorithm defined for single samples when the number of items is sufficiently large.
- Open Access
Evolutionary Shaping of Low-Dimensional Path Facilitates Robust and Plastic Switching Between Phenotypes
Biological systems must be robust for stable function against perturbations, but robustness alone is not sufficient. The ability to switch between appropriate states (phenotypes) in response to different conditions is essential for biological functions. How are robustness and plasticity simultaneously acquired through evolution? We examine the evolution of genotypes that realize plastic switching between two phenotypes upon external inputs, as well as stationary expressions of phenotypes. We introduce a statistical physics model consisting of spins, with active and regulatory sites, which are distinct from each other. We represent the phenotype and genotype as spin configurations and the spin-spin interactions, respectively. The fitness for selection is given so that it takes a higher value as more of the active sites take two requested spin configurations depending on the regulation. We numerically evolve the interaction matrix by changing them with mutations and selection of those with higher fitness. Our numerical simulations show that characteristic genotypes evolve slightly above the transition temperature between replica symmetric and replica symmetry breaking phase. These genotypes shape two spin configurations separately depending on the regulation, where the two phenotypes are dominantly represented by the genotypes' first and second eigenmodes, and smooth switching of two phenotypes are achieved by following a one-dimensional path connecting the two phenotypes. Upon changes in regulations, spin configurations are attracted to this path, which allows for robust and plastic switching between the two phenotypes. The statistical-physics analysis show that the free energy landscape has a valley along the switching path. Our finding indicates that the compatibility of the robustness and plasticity is acquired by the evolution of the low-dimensionality in the phenotype space.
Open AccessEvolutionary Shaping of Low-Dimensional Path Facilitates Robust and Plastic Switching Between Phenotypes
Biological systems must be robust for stable function against perturbations, but robustness alone is not sufficient. The ability to switch between appropriate states (phenotypes) in response to different conditions is essential for biological functions. How are robustness and plasticity simultaneously acquired through evolution? We examine the evolution of genotypes that realize plastic switching between two phenotypes upon external inputs, as well as stationary expressions of phenotypes. We introduce a statistical physics model consisting of spins, with active and regulatory sites, which are distinct from each other. We represent the phenotype and genotype as spin configurations and the spin-spin interactions, respectively. The fitness for selection is given so that it takes a higher value as more of the active sites take two requested spin configurations depending on the regulation. We numerically evolve the interaction matrix by changing them with mutations and selection of those with higher fitness. Our numerical simulations show that characteristic genotypes evolve slightly above the transition temperature between replica symmetric and replica symmetry breaking phase. These genotypes shape two spin configurations separately depending on the regulation, where the two phenotypes are dominantly represented by the genotypes' first and second eigenmodes, and smooth switching of two phenotypes are achieved by following a one-dimensional path connecting the two phenotypes. Upon changes in regulations, spin configurations are attracted to this path, which allows for robust and plastic switching between the two phenotypes. The statistical-physics analysis show that the free energy landscape has a valley along the switching path. Our finding indicates that the compatibility of the robustness and plasticity is acquired by the evolution of the low-dimensionality in the phenotype space.
- Open Access
- 27 January 2023
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 56 (4) , 043001
Prediction errors for penalized regressions based on generalized approximate message passing
We discuss the prediction accuracy of assumed statistical models in terms of prediction errors for the generalized linear model and penalized maximum likelihood methods. We derive the forms of estimators for the prediction errors, such asCpcriterion, information criteria, and leave-one-out cross validation (LOOCV) error, using the generalized approximate message passing (GAMP) algorithm and replica method. These estimators coincide with each other when the number of model parameters is sufficiently small; however, there is a discrepancy between them in particular in the parameter region where the number of model parameters is larger than the data dimension. In this paper, we review the prediction errors and corresponding estimators, and discuss their differences. In the framework of GAMP, we show that the information criteria can be expressed by using the variance of the estimates. Further, we demonstrate how to approach LOOCV error from the information criteria by utilizing the expression provided by GAMP.
- 27 January 2023
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 56 (4) , 043001
Open AccessPrediction errors for penalized regressions based on generalized approximate message passing
We discuss the prediction accuracy of assumed statistical models in terms of prediction errors for the generalized linear model and penalized maximum likelihood methods. We derive the forms of estimators for the prediction errors, such asCpcriterion, information criteria, and leave-one-out cross validation (LOOCV) error, using the generalized approximate message passing (GAMP) algorithm and replica method. These estimators coincide with each other when the number of model parameters is sufficiently small; however, there is a discrepancy between them in particular in the parameter region where the number of model parameters is larger than the data dimension. In this paper, we review the prediction errors and corresponding estimators, and discuss their differences. In the framework of GAMP, we show that the information criteria can be expressed by using the variance of the estimates. Further, we demonstrate how to approach LOOCV error from the information criteria by utilizing the expression provided by GAMP.
- Open Access
Prediction Errors for Penalized Regressions based on Generalized Approximate Message Passing
We discuss the prediction accuracy of assumed statistical models in terms of prediction errors for the generalized linear model and penalized maximum likelihood methods. We derive the forms of estimators for the prediction errors, such as $C_p$ criterion, information criteria, and leave-one-out cross validation (LOOCV) error, using the generalized approximate message passing (GAMP) algorithm and replica method. These estimators coincide with each other when the number of model parameters is sufficiently small; however, there is a discrepancy between them in particular in the parameter region where the number of model parameters is larger than the data dimension. In this paper, we review the prediction errors and corresponding estimators, and discuss their differences. In the framework of GAMP, we show that the information criteria can be expressed by using the variance of the estimates. Further, we demonstrate how to approach LOOCV error from the information criteria by utilizing the expression provided by GAMP.Open AccessPrediction Errors for Penalized Regressions based on Generalized Approximate Message Passing
We discuss the prediction accuracy of assumed statistical models in terms of prediction errors for the generalized linear model and penalized maximum likelihood methods. We derive the forms of estimators for the prediction errors, such as $C_p$ criterion, information criteria, and leave-one-out cross validation (LOOCV) error, using the generalized approximate message passing (GAMP) algorithm and replica method. These estimators coincide with each other when the number of model parameters is sufficiently small; however, there is a discrepancy between them in particular in the parameter region where the number of model parameters is larger than the data dimension. In this paper, we review the prediction errors and corresponding estimators, and discuss their differences. In the framework of GAMP, we show that the information criteria can be expressed by using the variance of the estimates. Further, we demonstrate how to approach LOOCV error from the information criteria by utilizing the expression provided by GAMP. - Open Access
- 1 September 2021
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2021 (9) , 093401
Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
We consider a reconstruction problem of sparse signals from a smaller number of measurements than the dimension formulated as a minimization problem of nonconvex sparse penalties: smoothly clipped absolute deviations and minimax concave penalties. The nonconvexity of these penalties is controlled by nonconvexity parameters, and the ℓ 1 penalty is contained as a limit with respect to these parameters. The analytically-derived reconstruction limit overcomes that of the ℓ 1 limit and is also expected to overcome the algorithmic limit of the Bayes-optimal setting when the nonconvexity parameters have suitable values. However, for small nonconvexity parameters, where the reconstruction of the relatively dense signals is theoretically expected, the algorithm known as approximate message passing (AMP), which is closely related to the analysis, cannot achieve perfect reconstruction leading to a gap from the analysis. Using the theory of state evolution, it is clarified that this gap can be understood on the basis of the shrinkage in the basin of attraction to the perfect reconstruction and also the divergent behavior of AMP in some regions. A part of the gap is mitigated by controlling the shapes of nonconvex penalties to guide the AMP trajectory to the basin of the attraction.
- 1 September 2021
- Published by IOP Publishing in Journal of Statistical Mechanics: Theory and Experiment
- Vol. 2021 (9) , 093401
Open AccessPerfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
We consider a reconstruction problem of sparse signals from a smaller number of measurements than the dimension formulated as a minimization problem of nonconvex sparse penalties: smoothly clipped absolute deviations and minimax concave penalties. The nonconvexity of these penalties is controlled by nonconvexity parameters, and the ℓ 1 penalty is contained as a limit with respect to these parameters. The analytically-derived reconstruction limit overcomes that of the ℓ 1 limit and is also expected to overcome the algorithmic limit of the Bayes-optimal setting when the nonconvexity parameters have suitable values. However, for small nonconvexity parameters, where the reconstruction of the relatively dense signals is theoretically expected, the algorithm known as approximate message passing (AMP), which is closely related to the analysis, cannot achieve perfect reconstruction leading to a gap from the analysis. Using the theory of state evolution, it is clarified that this gap can be understood on the basis of the shrinkage in the basin of attraction to the perfect reconstruction and also the divergent behavior of AMP in some regions. A part of the gap is mitigated by controlling the shapes of nonconvex penalties to guide the AMP trajectory to the basin of the attraction.
- Open Access
Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
We consider compressed sensing formulated as a minimization problem of nonconvex sparse penalties, Smoothly Clipped Absolute deviation (SCAD) and Minimax Concave Penalty (MCP). The nonconvexity of these penalties is controlled by nonconvexity parameters, and L1 penalty is contained as a limit with respect to these parameters. The analytically derived reconstruction limit overcomes that of L1 and the algorithmic limit in the Bayes-optimal setting, when the nonconvexity parameters have suitable values. However, for small nonconvexity parameters, where the reconstruction of the relatively dense signals is theoretically guaranteed, the corresponding approximate message passing (AMP) cannot achieve perfect reconstruction. We identify that the shrinks in the basin of attraction to the perfect reconstruction causes the discrepancy between the AMP and corresponding theory using state evolution. A part of the discrepancy is resolved by introducing the control of the nonconvexity parameters to guide the AMP trajectory to the basin of the attraction.
Open AccessPerfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
We consider compressed sensing formulated as a minimization problem of nonconvex sparse penalties, Smoothly Clipped Absolute deviation (SCAD) and Minimax Concave Penalty (MCP). The nonconvexity of these penalties is controlled by nonconvexity parameters, and L1 penalty is contained as a limit with respect to these parameters. The analytically derived reconstruction limit overcomes that of L1 and the algorithmic limit in the Bayes-optimal setting, when the nonconvexity parameters have suitable values. However, for small nonconvexity parameters, where the reconstruction of the relatively dense signals is theoretically guaranteed, the corresponding approximate message passing (AMP) cannot achieve perfect reconstruction. We identify that the shrinks in the basin of attraction to the perfect reconstruction causes the discrepancy between the AMP and corresponding theory using state evolution. A part of the discrepancy is resolved by introducing the control of the nonconvexity parameters to guide the AMP trajectory to the basin of the attraction.
- Open Access
- 5 February 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 103 (2) , 022110
Active pooling design in group testing based on Bayesian posterior prediction
For identifying infected patients in a population, group testing is an effective method to reduce the number of tests and correct test errors. In group testing, tests are performed on pools of specimens collected from patients, where the number of pools is lower than that of patients. The performance of group testing considerably depends on the design of pools and algorithms that are used for inferring the infected patients from the test outcomes. In this paper, an adaptive design method of pools based on the predictive distribution is proposed in the framework of Bayesian inference. The proposed method, executed using a belief propagation algorithm, results in more accurate identification of the infected patients compared with the group testing performed on random pools determined in advance.
- 5 February 2021
- Published by American Physical Society (APS) in Physical Review E
- Vol. 103 (2) , 022110
Open AccessActive pooling design in group testing based on Bayesian posterior prediction
For identifying infected patients in a population, group testing is an effective method to reduce the number of tests and correct test errors. In group testing, tests are performed on pools of specimens collected from patients, where the number of pools is lower than that of patients. The performance of group testing considerably depends on the design of pools and algorithms that are used for inferring the infected patients from the test outcomes. In this paper, an adaptive design method of pools based on the predictive distribution is proposed in the framework of Bayesian inference. The proposed method, executed using a belief propagation algorithm, results in more accurate identification of the infected patients compared with the group testing performed on random pools determined in advance.
- Open Access
Active pooling design in group testing based on Bayesian posterior prediction
In identifying infected patients in a population, group testing is an effective method to reduce the number of tests and correct the test errors. In the group testing procedure, tests are performed on pools of specimens collected from patients, where the number of pools is lower than that of patients. The performance of group testing heavily depends on the design of pools and algorithms that are used in inferring the infected patients from the test outcomes. In this paper, an adaptive design method of pools based on the predictive distribution is proposed in the framework of Bayesian inference. The proposed method executed using the belief propagation algorithm results in more accurate identification of the infected patients, as compared to the group testing performed on random pools determined in advance.
Open AccessActive pooling design in group testing based on Bayesian posterior prediction
In identifying infected patients in a population, group testing is an effective method to reduce the number of tests and correct the test errors. In the group testing procedure, tests are performed on pools of specimens collected from patients, where the number of pools is lower than that of patients. The performance of group testing heavily depends on the design of pools and algorithms that are used in inferring the infected patients from the test outcomes. In this paper, an adaptive design method of pools based on the predictive distribution is proposed in the framework of Bayesian inference. The proposed method executed using the belief propagation algorithm results in more accurate identification of the infected patients, as compared to the group testing performed on random pools determined in advance.