The Meta-controlled Boltzmann machine was proposed by J. Watada et. al for solving the optimal quadratic programming problem. It is shown that this model converges more efficiently than a conventional Boltzmann machine. In this paper, we propose a modified version of this model and compare it with the original model in solving a quadratic programming problem, the portfolio selection problem. Tóm tắt. Mô h̀ınh Meta-controlled Boltzmann machine du.o. . c dè̂ xuất bo . ’ i J. Watada và cô.ng su . . nhằm gia’ i quyết bài toán tối u.u bâ.c hai. Các nghiên cú .u dã chú.ng to’ rằng mô h̀ınh này hô. i tu. nhanh ho.n mô h̀ınh Boltzmann chuâ’n. Trong bài này, chúng tôi dè̂ xuất mô h̀ınh mó.i và so sánh vó.i mô h̀ınh cũ vè̂ hiê.u năng trong viê.c gia’ i mô.t bài toán tối u .u bâ.c hai, bài toán dà̂u tu . vốn.
[1]
H. Konno,et al.
A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES
,
1992
.
[2]
John J. Hopfield,et al.
Neural networks and physical systems with emergent collective computational abilities
,
1999
.
[3]
Geoffrey E. Hinton,et al.
A Learning Algorithm for Boltzmann Machines
,
1985,
Cogn. Sci..
[4]
R. Bharath,et al.
Neural Network Computing
,
1994
.
[5]
Takahiro Inoue,et al.
A New Stochastic Binary Neural Network Based on Hopfield Model and Its Application
,
2002
.
[6]
Simon Haykin,et al.
Neural Networks: A Comprehensive Foundation
,
1998
.