Muneki Yasuda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Muneki Yasuda has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Kaiji Sekimoto
Graduate School of Science and Engineering, Yamagata University
9 shared publications Kazuyuki Tanaka
Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan
7 shared publications- Chako Takahashi
Graduate School of Science and Engineering, Yamagata University
5 shared publications - Seung-Il Cho
Graduate School of Science and Engineering, Yamagata University
4 shared publications Shun Kataoka
Faculty of Commerce, Otaru University of Commerce
4 shared publications- Michio Yokoyama
Graduate School of Science and Engineering, Yamagata University
3 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 17 (3) , 679-691
EB-RANSAC: Random sample consensus based on energy-based model
Random sample consensus (RANSAC), which is based on a repetitive sampling from a given dataset, is one of the most popular robust estimation methods. In this study, an energy-based model (EBM) for robust estimation that has a similar scheme to RANSAC, energy-based RANSAC (EB-RANSAC), is proposed. EB-RANSAC is applicable to a wide range of estimation problems similar to RANSAC. However, unlike RANSAC, EB-RANSAC does not require a troublesome sampling procedure and has only one hyperparameter. The effectiveness of EB-RANSAC is numerically demonstrated in two applications: a linear regression and maximum likelihood estimation.
- 1 January 2026
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 17 (3) , 679-691
Open AccessEB-RANSAC: Random sample consensus based on energy-based model
Random sample consensus (RANSAC), which is based on a repetitive sampling from a given dataset, is one of the most popular robust estimation methods. In this study, an energy-based model (EBM) for robust estimation that has a similar scheme to RANSAC, energy-based RANSAC (EB-RANSAC), is proposed. EB-RANSAC is applicable to a wide range of estimation problems similar to RANSAC. However, unlike RANSAC, EB-RANSAC does not require a troublesome sampling procedure and has only one hyperparameter. The effectiveness of EB-RANSAC is numerically demonstrated in two applications: a linear regression and maximum likelihood estimation.
- 16 November 2025
- Published by Springer Nature
- p. 405-418
Marginal Probability Maximization on Restricted Boltzmann Machines Based on Blocked Sampling
- 16 November 2025
- Published by Springer Nature
- p. 405-418
Marginal Probability Maximization on Restricted Boltzmann Machines Based on Blocked Sampling
- 15 September 2025
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 94 (9)
Effective Method for Inverse Ising Problem under Missing Observations in Restricted Boltzmann Machines
- 15 September 2025
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 94 (9)
Effective Method for Inverse Ising Problem under Missing Observations in Restricted Boltzmann Machines
- 26 February 2025
- Published by Elsevier in Neural Networks
- Vol. 187, 107297
Dataset-free weight-initialization on restricted Boltzmann machine
- 26 February 2025
- Published by Elsevier in Neural Networks
- Vol. 187, 107297
Dataset-free weight-initialization on restricted Boltzmann machine
- Open Access
- 1 January 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 16 (3) , 410-421
Exact solvable deep Boltzmann machine
In training and inference in a deep Boltzmann machine (DBM), the evaluation of the free energy is crucial. Due to combinatorial explosion, its evaluation is computationally infeasible. We investigate the free energy evaluation of the DBM based on the Bethe free energy representation, which is related to the belief propagation algorithm. This representation significantly reduces the computational cost of the evaluation and enables the exact computation of the free energy in a slim DBM, i.e., a DBM with small-sized layers. Finally, we discuss the properties of the free energy in slim DBMs based on numerical and analytical methods.
- 1 January 2025
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 16 (3) , 410-421
Open AccessExact solvable deep Boltzmann machine
In training and inference in a deep Boltzmann machine (DBM), the evaluation of the free energy is crucial. Due to combinatorial explosion, its evaluation is computationally infeasible. We investigate the free energy evaluation of the DBM based on the Bethe free energy representation, which is related to the belief propagation algorithm. This representation significantly reduces the computational cost of the evaluation and enables the exact computation of the free energy in a slim DBM, i.e., a DBM with small-sized layers. Finally, we discuss the properties of the free energy in slim DBMs based on numerical and analytical methods.
- Open Access
- 16 April 2024
- Published by Springer Nature in Behaviormetrika
- Vol. 52 (1) , 5-23
Gaussian-discrete restricted Boltzmann machine with sparse-regularized hidden layer
Overfitting is a critical concern in machine learning, particularly when the representation capabilities of learning models surpass the complexities present in the training datasets. To mitigate overfitting, curtailing the representation power of the model through suitable techniques such as regularization is necessary. In this study, a sparse-regularization method for Gaussian–Discrete restricted Boltzmann machines (GDRBMs) is considered. A GDRBM is a variant of restricted Boltzmann machines that comprises a continuous visible layer and discrete hidden layer. In the proposed model, sparse GDRBM (S-GDRBM), a sparse prior that encourages sparse representations of the hidden layer is employed. The strength of the prior (i.e., the sparse-regularization strength) can be tuned within the standard scenario of maximum likelihood learning; that is, the strength can be adaptively tuned based on the complexities of the datasets during training. We validated the proposed S-GDRBM using numerical experiments.
- 16 April 2024
- Published by Springer Nature in Behaviormetrika
- Vol. 52 (1) , 5-23
Open AccessGaussian-discrete restricted Boltzmann machine with sparse-regularized hidden layer
Overfitting is a critical concern in machine learning, particularly when the representation capabilities of learning models surpass the complexities present in the training datasets. To mitigate overfitting, curtailing the representation power of the model through suitable techniques such as regularization is necessary. In this study, a sparse-regularization method for Gaussian–Discrete restricted Boltzmann machines (GDRBMs) is considered. A GDRBM is a variant of restricted Boltzmann machines that comprises a continuous visible layer and discrete hidden layer. In the proposed model, sparse GDRBM (S-GDRBM), a sparse prior that encourages sparse representations of the hidden layer is employed. The strength of the prior (i.e., the sparse-regularization strength) can be tuned within the standard scenario of maximum likelihood learning; that is, the strength can be adaptively tuned based on the complexities of the datasets during training. We validated the proposed S-GDRBM using numerical experiments.
- Open Access
Improving Interpretability of Scores in Anomaly Detection Based on Gaussian-Bernoulli Restricted Boltzmann Machine
Gaussian-Bernoulli restricted Boltzmann machines (GBRBMs) are often used for semi-supervised anomaly detection, where they are trained using only normal data points. In GBRBM-based anomaly detection, normal and anomalous data are classified based on a score that is identical to an energy function of the marginal GBRBM. However, the classification threshold is difficult to set to an appropriate value, as this score cannot be interpreted. In this study, we propose a measure that improves score's interpretability based on its cumulative distribution, and establish a guideline for setting the threshold using the interpretable measure. The results of numerical experiments show that the guideline is reasonable when setting the threshold solely using normal data points. Moreover, because identifying the measure involves computationally infeasible evaluation of the minimum score value, we also propose an evaluation method for the minimum score based on simulated annealing, which is widely used for optimization problems. The proposed evaluation method was also validated using numerical experiments.
Open AccessImproving Interpretability of Scores in Anomaly Detection Based on Gaussian-Bernoulli Restricted Boltzmann Machine
Gaussian-Bernoulli restricted Boltzmann machines (GBRBMs) are often used for semi-supervised anomaly detection, where they are trained using only normal data points. In GBRBM-based anomaly detection, normal and anomalous data are classified based on a score that is identical to an energy function of the marginal GBRBM. However, the classification threshold is difficult to set to an appropriate value, as this score cannot be interpreted. In this study, we propose a measure that improves score's interpretability based on its cumulative distribution, and establish a guideline for setting the threshold using the interpretable measure. The results of numerical experiments show that the guideline is reasonable when setting the threshold solely using normal data points. Moreover, because identifying the measure involves computationally infeasible evaluation of the minimum score value, we also propose an evaluation method for the minimum score based on simulated annealing, which is widely used for optimization problems. The proposed evaluation method was also validated using numerical experiments.
- Open Access
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 273-283
Quasi-free energy evaluation of Gaussian-Bernoulli restricted Boltzmann machine for anomaly detection
A Gaussian-Bernoulli restricted Boltzmann machine (GBRBM) is often used in semi-supervised anomaly detection (AD), in which the GBRBM is trained using only normal data points. The GBRBM-based AD is performed based on a score that is identical with an energy function of the marginalized GBRBM. However, it is difficult to set a threshold of the score for discriminating between a normal and an anomaly to an appropriate value because we do not equip a valid interpretation for the score value. To gain the interpretation, we focus on features of the score: the average, variance, and minimum values; and propose a sampling-based method for evaluating the features. Numerical experiments demonstrate that the proposed method can evaluate these three quantities with a high accuracy.
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 273-283
Open AccessQuasi-free energy evaluation of Gaussian-Bernoulli restricted Boltzmann machine for anomaly detection
A Gaussian-Bernoulli restricted Boltzmann machine (GBRBM) is often used in semi-supervised anomaly detection (AD), in which the GBRBM is trained using only normal data points. The GBRBM-based AD is performed based on a score that is identical with an energy function of the marginalized GBRBM. However, it is difficult to set a threshold of the score for discriminating between a normal and an anomaly to an appropriate value because we do not equip a valid interpretation for the score value. To gain the interpretation, we focus on features of the score: the average, variance, and minimum values; and propose a sampling-based method for evaluating the features. Numerical experiments demonstrate that the proposed method can evaluate these three quantities with a high accuracy.
- Open Access
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 217-225
Effective sampling on Gaussian-Bernoulli restricted Boltzmann machines
Gaussian-Bernoulli restricted Boltzmann machine (GBRBM) is a bipartite-type Markov random field consisting of two types of layers, namely, visible and hidden layers, and it can treat continuous data points. For the implementation of GBRBM (e,g, for learning and inference), the evaluation of the expectations of variables is critical; however, this is difficult because of the problem of combinatorial explosion. In this study, we propose an effective method for expectation evaluation on a (canonicalized) GBRBM based on spatial Monte Carlo integration and marginalized-space Gibbs sampling (mGS). Here, mGS is a collapsed-Gibbs-sampling version of the layer-wise blocked Gibbs sampling method and it can reduce the relaxation times of Gibbs sampling. The results of numerical experiments demonstrate the effectiveness of the proposed method.
- 1 January 2024
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 15 (2) , 217-225
Open AccessEffective sampling on Gaussian-Bernoulli restricted Boltzmann machines
Gaussian-Bernoulli restricted Boltzmann machine (GBRBM) is a bipartite-type Markov random field consisting of two types of layers, namely, visible and hidden layers, and it can treat continuous data points. For the implementation of GBRBM (e,g, for learning and inference), the evaluation of the expectations of variables is critical; however, this is difficult because of the problem of combinatorial explosion. In this study, we propose an effective method for expectation evaluation on a (canonicalized) GBRBM based on spatial Monte Carlo integration and marginalized-space Gibbs sampling (mGS). Here, mGS is a collapsed-Gibbs-sampling version of the layer-wise blocked Gibbs sampling method and it can reduce the relaxation times of Gibbs sampling. The results of numerical experiments demonstrate the effectiveness of the proposed method.
- Open Access
- 1 January 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 14 (2) , 207-214
Discriminative restricted Boltzmann machine with trainable sparsity
Discriminative restricted Boltzmann machine (DRBM) is a probabilistic three-layered neural network, consisting of the input, hidden, and output layers, that helps to solve classification problems. This study attempts to improve the generalization property of the DRBM. Regularization methods such as L1 or L2 regularizations can be used to control the representation power of a learning model and suppress over-fitting to a dataset. To control the representation power of the DRBM, an alternative regularization approach is proposed, in which sparse regularization is imposed on the values of the hidden variables of the DRBM. In the resultant model, the sparse regularization controls the effective size of the hidden layer of the DRBM. Unlike standard regularization methods, in the proposed model, parameters that control the sparsity strength are trainable. The method is validated through numerical experiments based on benchmark datasets.
- 1 January 2023
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in Nonlinear Theory and Its Applications, IEICE
- Vol. 14 (2) , 207-214
Open AccessDiscriminative restricted Boltzmann machine with trainable sparsity
Discriminative restricted Boltzmann machine (DRBM) is a probabilistic three-layered neural network, consisting of the input, hidden, and output layers, that helps to solve classification problems. This study attempts to improve the generalization property of the DRBM. Regularization methods such as L1 or L2 regularizations can be used to control the representation power of a learning model and suppress over-fitting to a dataset. To control the representation power of the DRBM, an alternative regularization approach is proposed, in which sparse regularization is imposed on the values of the hidden variables of the DRBM. In the resultant model, the sparse regularization controls the effective size of the hidden layer of the DRBM. Unlike standard regularization methods, in the proposed model, parameters that control the sparsity strength are trainable. The method is validated through numerical experiments based on benchmark datasets.