Koji Hukushima
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
Research Subjects
Research Interests
Koji Hukushima has a total of 123 co-authors. Here are the top co-authors by number of shared publications:
Hajime Takayama
Institute for Solid State Physics, University of Tokyo, 5-1-5 Kashiwa-no-ha, Kashiwa, Chiba 277-8581
11 shared publications- Hajime Yoshino
Osaka University
11 shared publications H. Takayama
Institute for Solid State Physics, University of Tokyo, Kashiwa-no-ha 5-1-5, Kashiwa, 277-8581, Japan
10 shared publications- Yoshihiko Nishikawa
Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan
8 shared publications - Ayaka Sakata
Department of Statistical Inference & Mathematics The Institute of Statistical Mathematics Midori-cho 190-8562 Tachikawa Tokyo Japan
6 shared publications - Ryo Tamura
National Institute for Materials Science
6 shared publications
Latest Publications
- Open Access
- 2 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Tensor-network population annealing
We propose a hybrid sampling method, tensor-network population annealing (TNPA), which combines tensor-network (TN) initialization with population annealing (PA). We apply this method to the two-dimensional ± J Edwards-Anderson Ising spin glass. The approach is motivated by the limitations of existing methods: TN-based samplers can become numerically unstable in frustrated spin systems at low temperatures, whereas conventional PA requires a long annealing schedule when started from the high-temperature limit. In TNPA, TN contractions are used only within a reliable temperature range to generate initial configurations that are close to the equilibrium distribution. The subsequent low-temperature equilibration is then carried out by PA. To stabilize the initialization process, we introduce a diagnostic based on the effective sample size that adaptively selects the initialization temperature. The proposed framework provides a practical and physically motivated route to low-temperature sampling by combining the complementary strengths of TN and PA.
- 2 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Open AccessTensor-network population annealing
We propose a hybrid sampling method, tensor-network population annealing (TNPA), which combines tensor-network (TN) initialization with population annealing (PA). We apply this method to the two-dimensional ± J Edwards-Anderson Ising spin glass. The approach is motivated by the limitations of existing methods: TN-based samplers can become numerically unstable in frustrated spin systems at low temperatures, whereas conventional PA requires a long annealing schedule when started from the high-temperature limit. In TNPA, TN contractions are used only within a reliable temperature range to generate initial configurations that are close to the equilibrium distribution. The subsequent low-temperature equilibration is then carried out by PA. To stabilize the initialization process, we introduce a diagnostic based on the effective sample size that adaptively selects the initialization temperature. The proposed framework provides a practical and physically motivated route to low-temperature sampling by combining the complementary strengths of TN and PA.
- Open Access
- 16 October 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (4)
Phase transitions in computation time of Brownian circuits
Brownian circuits perform computations using stochastic transitions driven by thermal fluctuations. While the energetic costs of such fluctuation-driven computation have been extensively studied within stochastic thermodynamics, much less is known about its computational complexity, in particular, how computation time scales with circuit size. In this work, the computation time for explicitly designed Brownian circuits is numerically investigated via the first-passage time to a completed state. For arithmetic circuits such as adders, varying the forward transition rate induces a sharp change in the scaling behavior of the mean computation time with circuit size, from linear to exponential. This change can be interpreted as an easy-hard transition in computational time complexity. The transition suggests that, for meaningful computational tasks, achieving efficient polynomial-time computation generally requires a finite forward bias corresponding to a nonzero energy input. As a counterexample, we show that arbitrary logical operations can be reduced to an effective one-dimensional stochastic process in which the zero-bias limit lies within the computationally efficient (easy) regime. However, achieving such a one-dimensional normal form unavoidably leads to an exponential increase in circuit size. These results reveal a fundamental trade-off between computation time, circuit size, and energy input in Brownian circuits and demonstrate that phase transitions in time complexity provide a natural framework for characterizing the cost of fluctuation-driven computation.
- 16 October 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (4)
Open AccessPhase transitions in computation time of Brownian circuits
Brownian circuits perform computations using stochastic transitions driven by thermal fluctuations. While the energetic costs of such fluctuation-driven computation have been extensively studied within stochastic thermodynamics, much less is known about its computational complexity, in particular, how computation time scales with circuit size. In this work, the computation time for explicitly designed Brownian circuits is numerically investigated via the first-passage time to a completed state. For arithmetic circuits such as adders, varying the forward transition rate induces a sharp change in the scaling behavior of the mean computation time with circuit size, from linear to exponential. This change can be interpreted as an easy-hard transition in computational time complexity. The transition suggests that, for meaningful computational tasks, achieving efficient polynomial-time computation generally requires a finite forward bias corresponding to a nonzero energy input. As a counterexample, we show that arbitrary logical operations can be reduced to an effective one-dimensional stochastic process in which the zero-bias limit lies within the computationally efficient (easy) regime. However, achieving such a one-dimensional normal form unavoidably leads to an exponential increase in circuit size. These results reveal a fundamental trade-off between computation time, circuit size, and energy input in Brownian circuits and demonstrate that phase transitions in time complexity provide a natural framework for characterizing the cost of fluctuation-driven computation.
- 1 June 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (21)
Structure-resolved free-energy estimation of the 38-atom Lennard-Jones cluster via population annealing
We systematically investigate the thermodynamic landscape of the 38-atom Lennard-Jones cluster LJ38 using Population Annealing (PA), a method suited for systems with challenging double-funnel energy landscapes. By employing an adaptive temperature schedule, we demonstrate that thermodynamic observables, such as internal energy and heat capacity, converge robustly when the population size is sufficiently large. To gain deeper insights into the competing basins, we introduce an integrated framework that combines PA reweighting factors with structure-resolved analysis. Using quenched configurations characterized by potential energy and Steinhardt’s bond-orientational order parameters, we identify three structural basins, face-centered cubic-like, icosahedral, and liquid-like, via dimensionality reduction and clustering. This framework enables the direct computation of structure-resolved free energy differences from population fractions, providing a quantitative mapping of the thermodynamic competition between the funnels. The resulting structural crossovers are consistent with the heat-capacity peak, demonstrating PA as a promising and scalable framework for structure-resolved thermodynamics in complex molecular systems.
- 1 June 2026
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 164 (21)
Structure-resolved free-energy estimation of the 38-atom Lennard-Jones cluster via population annealing
We systematically investigate the thermodynamic landscape of the 38-atom Lennard-Jones cluster LJ38 using Population Annealing (PA), a method suited for systems with challenging double-funnel energy landscapes. By employing an adaptive temperature schedule, we demonstrate that thermodynamic observables, such as internal energy and heat capacity, converge robustly when the population size is sufficiently large. To gain deeper insights into the competing basins, we introduce an integrated framework that combines PA reweighting factors with structure-resolved analysis. Using quenched configurations characterized by potential energy and Steinhardt’s bond-orientational order parameters, we identify three structural basins, face-centered cubic-like, icosahedral, and liquid-like, via dimensionality reduction and clustering. This framework enables the direct computation of structure-resolved free energy differences from population fractions, providing a quantitative mapping of the thermodynamic competition between the funnels. The resulting structural crossovers are consistent with the heat-capacity peak, demonstrating PA as a promising and scalable framework for structure-resolved thermodynamics in complex molecular systems.
- Open Access
- 7 October 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (4) , 045306
Ratio divergence learning using target energy in restricted Boltzmann machines: Beyond Kullback-Leibler divergence learning
We propose ratio divergence (RD) learning for discrete energy-based models, a method that utilizes both training data and a tractable target energy function. We apply RD learning to restricted Boltzmann machines (RBMs), which are a minimal model that satisfies the universal approximation theorem for discrete distributions. RD learning combines the strength of both forward and reverse Kullback–Leibler divergence (KLD) learning, effectively addressing the “notorious” issues of underfitting with the forward KLD and mode collapse with the reverse KLD. Since the summation of forward and reverse KLD seems to be sufficient to combine the strength of both approaches, we include this learning method as a direct baseline in numerical experiments to evaluate its effectiveness. Numerical experiments demonstrate that RD learning outperforms other learning methods in terms of energy function fitting, mode-covering, and learning stability across various discrete energy-based models. Moreover, the performance gaps between RD learning and the other learning methods become more pronounced as the dimensions of target models increase.
- 7 October 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (4) , 045306
Open AccessRatio divergence learning using target energy in restricted Boltzmann machines: Beyond Kullback-Leibler divergence learning
We propose ratio divergence (RD) learning for discrete energy-based models, a method that utilizes both training data and a tractable target energy function. We apply RD learning to restricted Boltzmann machines (RBMs), which are a minimal model that satisfies the universal approximation theorem for discrete distributions. RD learning combines the strength of both forward and reverse Kullback–Leibler divergence (KLD) learning, effectively addressing the “notorious” issues of underfitting with the forward KLD and mode collapse with the reverse KLD. Since the summation of forward and reverse KLD seems to be sufficient to combine the strength of both approaches, we include this learning method as a direct baseline in numerical experiments to evaluate its effectiveness. Numerical experiments demonstrate that RD learning outperforms other learning methods in terms of energy function fitting, mode-covering, and learning stability across various discrete energy-based models. Moreover, the performance gaps between RD learning and the other learning methods become more pronounced as the dimensions of target models increase.
- Open Access
- 13 February 2025
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 12, 1507250
Damage spreading and coupling in spin glasses and hard spheres
We study the connection between damage spreading, a phenomenon long discussed in the physics literature, and the coupling of Markov chains, a technique used to bound the mixing time. We discuss in parallel the Edwards–Anderson spin-glass model and the hard-disk system, focusing on how coupling provides bounds on the extension of the paramagnetic and liquid phases. We also work out the connection between path coupling and damage spreading. Numerically, the scaling analysis of the mean coupling time determines a critical point between fast and slow couplings. The exact relationship between fast coupling and disordered phases has not been established rigorously, but we suggest that it will ultimately enhance our understanding of phase behavior in disordered systems.
- 13 February 2025
- Published by Frontiers Media SA in Frontiers in Physics
- Vol. 12, 1507250
Open AccessDamage spreading and coupling in spin glasses and hard spheres
We study the connection between damage spreading, a phenomenon long discussed in the physics literature, and the coupling of Markov chains, a technique used to bound the mixing time. We discuss in parallel the Edwards–Anderson spin-glass model and the hard-disk system, focusing on how coupling provides bounds on the extension of the paramagnetic and liquid phases. We also work out the connection between path coupling and damage spreading. Numerically, the scaling analysis of the mean coupling time determines a critical point between fast and slow couplings. The exact relationship between fast coupling and disordered phases has not been established rigorously, but we suggest that it will ultimately enhance our understanding of phase behavior in disordered systems.
- 15 January 2025
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 94 (1)
Bayesian Estimation of Thin-film X-ray Laue Oscillation Using Markov Chain Monte Carlo Method
- 15 January 2025
- Published by Physical Society of Japan in Journal of the Physical Society of Japan
- Vol. 94 (1)
Bayesian Estimation of Thin-film X-ray Laue Oscillation Using Markov Chain Monte Carlo Method
- Open Access
Damage spreading and coupling in spin glasses and hard spheres
We study the connection between damage spreading, a phenomenon long discussed in the physics literature, and the coupling of Markov chains, a technique used to bound the mixing time. We discuss in parallel the Edwards-Anderson spin glass model and the hard-disk system, focusing on how coupling provides insights into the region of fast coupling within the paramagnetic and liquid phases. We also work out the connection between path coupling and damage spreading. Numerically, the scaling analysis of the mean coupling time determines a critical point between fast and slow couplings. The exact relationship between fast coupling and disordered phases has not been established rigorously, but we suggest that it will ultimately enhance our understanding of phase behavior in disordered systems.
Open AccessDamage spreading and coupling in spin glasses and hard spheres
We study the connection between damage spreading, a phenomenon long discussed in the physics literature, and the coupling of Markov chains, a technique used to bound the mixing time. We discuss in parallel the Edwards-Anderson spin glass model and the hard-disk system, focusing on how coupling provides insights into the region of fast coupling within the paramagnetic and liquid phases. We also work out the connection between path coupling and damage spreading. Numerically, the scaling analysis of the mean coupling time determines a critical point between fast and slow couplings. The exact relationship between fast coupling and disordered phases has not been established rigorously, but we suggest that it will ultimately enhance our understanding of phase behavior in disordered systems.
- Open Access
Ratio Divergence Learning Using Target Energy in Restricted Boltzmann Machines: Beyond Kullback--Leibler Divergence Learning
We propose ratio divergence (RD) learning for discrete energy-based models, a method that utilizes both training data and a tractable target energy function. We apply RD learning to restricted Boltzmann machines (RBMs), which are a minimal model that satisfies the universal approximation theorem for discrete distributions. RD learning combines the strength of both forward and reverse Kullback-Leibler divergence (KLD) learning, effectively addressing the "notorious" issues of underfitting with the forward KLD and mode-collapse with the reverse KLD. Since the summation of forward and reverse KLD seems to be sufficient to combine the strength of both approaches, we include this learning method as a direct baseline in numerical experiments to evaluate its effectiveness. Numerical experiments demonstrate that RD learning significantly outperforms other learning methods in terms of energy function fitting, mode-covering, and learning stability across various discrete energy-based models. Moreover, the performance gaps between RD learning and the other learning methods become more pronounced as the dimensions of target models increase.
Open AccessRatio Divergence Learning Using Target Energy in Restricted Boltzmann Machines: Beyond Kullback--Leibler Divergence Learning
We propose ratio divergence (RD) learning for discrete energy-based models, a method that utilizes both training data and a tractable target energy function. We apply RD learning to restricted Boltzmann machines (RBMs), which are a minimal model that satisfies the universal approximation theorem for discrete distributions. RD learning combines the strength of both forward and reverse Kullback-Leibler divergence (KLD) learning, effectively addressing the "notorious" issues of underfitting with the forward KLD and mode-collapse with the reverse KLD. Since the summation of forward and reverse KLD seems to be sufficient to combine the strength of both approaches, we include this learning method as a direct baseline in numerical experiments to evaluate its effectiveness. Numerical experiments demonstrate that RD learning significantly outperforms other learning methods in terms of energy function fitting, mode-covering, and learning stability across various discrete energy-based models. Moreover, the performance gaps between RD learning and the other learning methods become more pronounced as the dimensions of target models increase.
- Open Access
Statistical Mechanics of Min-Max Problems
Min-max optimization problems, also known as saddle point problems, have attracted significant attention due to their applications in various fields, such as fair beamforming, generative adversarial networks (GANs), and adversarial learning. However, understanding the properties of these min-max problems has remained a substantial challenge. This study introduces a statistical mechanical formalism for analyzing the equilibrium values of min-max problems in the high-dimensional limit, while appropriately addressing the order of operations for min and max. As a first step, we apply this formalism to bilinear min-max games and simple GANs, deriving the relationship between the amount of training data and generalization error and indicating the optimal ratio of fake to real data for effective learning. This formalism provides a groundwork for a deeper theoretical analysis of the equilibrium properties in various machine learning methods based on min-max problems and encourages the development of new algorithms and architectures.
Open AccessStatistical Mechanics of Min-Max Problems
Min-max optimization problems, also known as saddle point problems, have attracted significant attention due to their applications in various fields, such as fair beamforming, generative adversarial networks (GANs), and adversarial learning. However, understanding the properties of these min-max problems has remained a substantial challenge. This study introduces a statistical mechanical formalism for analyzing the equilibrium values of min-max problems in the high-dimensional limit, while appropriately addressing the order of operations for min and max. As a first step, we apply this formalism to bilinear min-max games and simple GANs, deriving the relationship between the amount of training data and generalization error and indicating the optimal ratio of fake to real data for effective learning. This formalism provides a groundwork for a deeper theoretical analysis of the equilibrium properties in various machine learning methods based on min-max problems and encourages the development of new algorithms and architectures.
- Open Access
- 26 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033216
Statistical properties of probabilistic context-sensitive grammars
Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains. Despite their utility, the distributions that the grammar can express are limited to those in which the distribution of a subtree depends only on its root and not on its context. This limitation presents a challenge for modeling various real-world phenomena, such as natural languages. To overcome this limitation, a probabilistic context-sensitive grammar (PCSG) is introduced, where the distribution of a subtree depends on its context. Numerical analysis of a PCSG reveals that the distribution of a symbol does not constitute a qualitative difference from that in the context-free case, but mutual information does. Furthermore, a novel metric introduced to directly quantify the breaking of this limitation detects a distinct difference between PCFGs and PCSGs. This metric, applicable to an arbitrary distribution of a tree, allows for further investigation and characterization of various tree structures that PCFGs cannot express. Published by the American Physical Society 2024
- 26 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033216
Open AccessStatistical properties of probabilistic context-sensitive grammars
Probabilistic context-free grammars (PCFGs), which are commonly used to generate trees randomly, have been well analyzed theoretically, leading to applications in various domains. Despite their utility, the distributions that the grammar can express are limited to those in which the distribution of a subtree depends only on its root and not on its context. This limitation presents a challenge for modeling various real-world phenomena, such as natural languages. To overcome this limitation, a probabilistic context-sensitive grammar (PCSG) is introduced, where the distribution of a subtree depends on its context. Numerical analysis of a PCSG reveals that the distribution of a symbol does not constitute a qualitative difference from that in the context-free case, but mutual information does. Furthermore, a novel metric introduced to directly quantify the breaking of this limitation detects a distinct difference between PCFGs and PCSGs. This metric, applicable to an arbitrary distribution of a tree, allows for further investigation and characterization of various tree structures that PCFGs cannot express. Published by the American Physical Society 2024