Gii thut kin v p dng trong vic xc nh ma trn trng s ca mng Neuron

On the Ant Colony Optimization for Training Neural Network

Nguyn Xun Tng

Abstract: The paper presents Ant Colony System (ACS)an Algorithm introduced by Dorigo M.et al(1991).An ACS variant called ACOg,b, min is analyzed and show that in some conditions,it converges to global optimum in probability ->1.In part 3 we introduce ACS-framwork for finding weight matric of Neural Networks.

Nm 2002 M.Dorigo v T.Stzle chng minh c tnh hi t ca hai bin th quan trng nht ca Aco l Max Min Ant System v ASC [12]. iu ny khin cho Aco c mt c s l thuyt vng vng v m ra mt lot cc nghin cu y ha hn v cc tham s iu khin trong Aco. Sau y chng ta s xem xt pht biu hnh thc ca bi ton, gii thut v tnh hi t ca gii thut. Cho 1 b (S, f, ) trong S: tp hp cc li gii - ng c vin f: Hm nh gi f: S->R : cc iu kin rng buc Cn tm li gii ti u S* tho f(S*) min Trong Aco bi ton ti u t hp (S, f, ) c gii quyt qua s gm cc thnh phn sau: Tp hu hn C = {C1, C2 ... CNc}cc nh cn duyt trong qu trnh tm kim. Tp hu hn X cc trng thi kt qu c th tm c ca bi ton trong qu trnh tm kim x X = <Ci, Cj, ..., Ck ...> Tp S cc li gii - ng c vin l b phn ca X (S X) Tp S*

I. GII THIU ACS V PHT BIU HNH THC BI TON TI U T HP Trong vng 10 nm gn y, c nhiu bi ton ti u t hp c gii quyt bng h cc thut ton kin (Ant Algorithm). Thut ton kin m phng hnh vi ca n kin trong t nhin nhm tm kim ng i ngn nht gia t kin v ngun thc n da trn mt mi(Pheromone) m cc con kin li trn ng i(xem[1],[2],[3]). Hiu qu ca thut ton kin c th hin khi so snh vi cc thut ton ni ting khc nh GA, Simulated Annealing, Tabu-Search. Ngi ta p dng rt thnh cng cc thut ton kin trong cc bi ton ti u nh Bi ton ngi a th,bi ton gn,bi ton t mu th,bi ton lp lch... Tuy nhin v mt l thuyt, c rt t cc cng trnh nghin cu nhm a ra cc nh gi v hiu qu ca thut ton. Tnh hnh ny c thay i khi ln u tin nm 2000 Gutjahz chng minh c tnh hi t ca mt phng n Aco Graph-Based Ant System (GBAS). W.J Gutjahz chng minh rng trong mt s iu kin nht nh GBAS hi t n li gii ti u vi xc sut tim cn n 1 vi chnh xc tu (xem [7], [8]). Tuy nhin GBAS cha c mt p dng c th no trn thc t nn cc kt qu ny thun tu ch c ngha l thuyt.

% X X cc trng thi tho mn

S* : tp cc li gii ti u

% X

v S* S

Da vo cc thnh phn k trn, cc tc t - kin (agents) s xy dng cc li gii bng cch thc hin cc di chuyn qua cc nh ca th G = (C, L, T) trong cc nh c gn cc gi tr thuc C, L l

cung ni cc cp nh (khng c nh c lp), T l tp cc pheromone trn L. Khi u, mi mt agents c phn b ngu nhin trn cc nh ca G, sau chn mt nh no lm nh trong qu trnh dch chuyn. Qu trnh chm dt khi mi nh u c duyt qua. Vic chn nh trong qu trnh di chuyn ca kin ph thuc nng Pheromone trn cc cung. iu kin c p dng bo m cc li gii - ng c vin tho mn cc iu kin ban u. Sau khi cc agents hon thnh qu trnh di chuyn, qu trnh cp nht pheromone c thc hin. Mt cch hnh thc, qu trnh bao gm cc th tc xy dng cc li gii - ng c vin c m t nh sau: ANT_ SOLUTION _CONSTRUCTION

cung 0 < g(s) < l hm S R+, f (s) < f(s) g(s) g(s) g l hm nghch bin vi f. Th tc khi to INITIALIZE

% To mt li gii bt k s X

:= s

(i, j), (i, j) := 0 i vi mi agent Chn 1 nh bt k c1 lm nh xut pht k := 1; xk = <c1> Trong 0, min 0 < + Gii thut ny vi vic cp nht pheromone theo li gii ti u ton cc tm c v mc Pheromone trn mi cung c duy tr lun ln hn min c k hiu l ACOgb, min. II. CC NH L HI T CA ACOGB MIN Trong [12] T. Sttzle v M. Dorigo chng minh tnh hi t ca ACS.Lc chng minh nh sau:

% While (xk X and xk S) do ti mi bc sau khi thit lp xk = <C1, C2, ..., Ck> chn nh tip theo Ck+1 theo biu thc ngu nhin: P(Ck+1 = C T, xk)
(ck , c) / (ck , y ) yC = 0
Nu (ck , c ) J ck Cc trng hp khc

1 B 1: i, j: lim (t ) g ( s* ) ij max =
t

% Trong tham s tho 0 < < + v xk+1 X . Ti thi im Jck= , kin s chm dt qu trnh tm li gii v b loi b.
Khi mi agents thc hin xong th tc ANT SOLUTION CONSTRUCTION, th tc cp nht

Chng minh: S lng Pheromone c tng trn mi cung (i, j) sau bc bt k l g(s*). Sau bc 1, s Pheromone trn mt cung lun nh hn (1 - ).0 + g(s*). Sau bc 2, gi tr < (1 - )2.0 + (1 - ).g(s*) + g(s*) ...... Sau bc t ta c:

Pheromone c bt u. Gi th s l li gii tt nht tnh n trc thi im xy ra bc t, v trong bc t ta tm c li gii tt nht st. Tng ng hai li gii ny c hai kt qu ca hm nh gi f( s ) v f (st) dng trong th tc cp nht Pheromone nh sau:
PHEROMONE _UPDATE (i, j): (i, j) := (1 - ) . (i, j)

ijmax (t) = (1- )t . 0 + (1- ) t-i . g(s*)

i=1

nu f (st) < f( s ) th

s : st

Vi 0<<1: ijmax tim cn n 1 g ( s* ) = max

(i, j) s : (i, j) := (i, j) + g( s )

(i, j): (i, j) := max {min, (i, j)} : 0 < < 1 l h s gim Pheromone sau mi bc. min kim sot mc Pheromone nh nht trn mi

B 2: Nu li gii ti u s c tm ra th: (i, j) S*:

t * lim ij (t)= max =

g ( s* )

Trong *ij l s Pheromone trn cung (i, j) s* Chng minh: Khi mt li gii ti u s c tm ra ij(t) min v do vic cp nht Pheromone theo li gii ti u ton cc nn *ij tng lin tc. Chng minh b 2 ging nh chng minh b 1, trong ta thay 0 bng *i,j (t*), trong t* l bc tm c li gii ti u u tin.
* *

php ti u u tin, nng Pheromone trn cc cung thuc li gii ti u ln hn nng ti cc cung khc.Chng minh chi tit xem [12] T nh l 2 d dng suy ra t thi im t > t* + t0, cc agents khi chn cc cung xy dng nn S* cn la chn cc cung c nng mi ln nht. nh l 3: Sau khi thut ton tm c mt li gii ti u, i vi mi (i, j) S* ta c
t

nh l 1: Gi s P (t) l xc xut thut ton tm c mt li gii ti u trong t bc lp u tin. Khi vi nh tu v vi t ln ta c:

P*(t) 1- v
t

lim ij (t) = min

lim P* (t ) = 1

Chng minh: S lng Pheromone trn mi cung lun tho mn 0 < min < nij max nn xc sut mt cung c chn pmin lun ln hn 0. Ta lun c bt ng thc:

Chng minh: Nu (i,j) S*, sau khi tm c li gii ti u, (i,j) khng c b sung pheromone m ch bay hi mt lng .(i,j) sau mi bc. Tuy nhin gi tr ij(t) min. Vy lim i , j (t ) = min
t

pmin p

min =

min ( N c 1) m ax + min

Trn thc t ngi ta chng minh rng vi t> t* + t1, (i,j) S*, ij(t) = min. Vi t = ln min ln max 1

Trong Nc l lc lng ca tp C. Khi tt c cc phng n S (c th bao gm c li gii ti u s* S

*

ln (1 )

c to ra vi xc sut

n pmin , n l s

III. HUN LUYN TRNG S CA MNG NEURAL (NN) BNG GII THUT KIN Trong vic thit k mng Neural c hai vn ln cho cc nh thit k. l thit k cu trc mng v thit lp ma trn trng s cho cu trc . Vic xc nh ma trn trng s ca NN c vai tr v cng quan trng v mi phng n thit k u phi s dng mt thut ton hun luyn trng s la chn cc kt ni trong NN. Hin nay ngi ta p dng rng ri mt s phng php hun luyn trng s, trong ni bt nht l thut ton lan truyn ngc sai s (BP), gii thut di truyn (GA), thut ton gi luyn kim (AS). Cc thut ton BP, GA c in thng tm c li gii cc b nn qu trnh tm cc phng n cho php tm kim ti u ton cc vn ang tip tc c nghin cu. Trong phn ny, chng ti trnh by v vic p dng Antgb, min tm ma trn trng s. Cng nh thut ton c trnh by phn 2, cc tc t - kin (Agents) s di chuyn qua tng nt ca NN theo t l Pheromone trn tng cung lin kt cc nt. Sau khi

node thnh phn ca li gii. V chng ta cn tm xc xut tm c mt li gii ti u trong t bc lp u tin nn ta c:

p *(t) = 1 (1 - p )t
Trong (1 -

p )t l xc xut khng tm c li p *(t) s ln hn 1- vi nh

lim p* (t ) = 1

gii ti u t bc lp. Khi cho t ln, tu v

t

nh l 2: Gi s li gii ti u u tin c tm thy bc t* . Khi tn ti gi tr t0 tho mn ij(t) > kl(t) (i, j) S*, (k, l) L (k, l)

s*,

t0 =

1 , t > t* + t 0

Sau t0 bc lp k t thi im t* tm c gii

cc Agents duyt qua ton b cc nt, t l pheromone c cp nht theo kt qu sai s nh nht tm c. 1. tng trn c c th ho nh sau: Gi s c D trng s cn phi hun luyn. K hiu WPi l tp cc gi tr c th ca tham s Pi (1 i D). Cho mt s lng M agents ln lt duyt qua D tp WPi theo th t mi ln chn mt gi tr thuc WPi theo quy tc la chn cho trc. Khi mi Agents duyt xong, chng s tr v v tr ban u theo ng i v cho bay hi mt lng Pheromone nht nh. Sau cc trng s tng ng vi sai s nh nht tm c s c tng mt Pheromone theo nguyn tc ca th tc PHEROMONE-UPDATE. Qu trnh tm kim s kt thc khi iu kin chm dt tm kim c tho mn ( Sai s ca mng nh hn mt gi tr no cho trc hoc thut ton t s vng lp nht nh. 2. Thut ton trn c m t c th nh sau: 1. Khi to: Gn s lng Pheromone

mng NN tm hm sai s. Vic cp nht tin hnh theo nguyn tc cc tham s thuc mng cho kt qu tt nht s c tng Pheromone.

PherPi = PherPi +

Const Error

Trong Const l h s xc nh cng cp nht Pheromone v Error = Max Vn Vexp

n =1 K

Trong K l s mu th, Vn l gi tr do NN tr v v Vexp l gi tr mu cho trc ca b d liu hun luyn. R rng nguyn tc cp nht ny tho mn iu kin trong th tc PHEROMONE UPDATE ti phn (2):
0 < g(s) < + v f (s) < f(s) g(s) g (s)

5. Cc bc t 1 - 4 s c tip tc n khi cc agent chn c b trng s thch hp cho mng Neural. IV. NG DNG Mng Neuron c nhiu ng dng trong ngnh vin thng. Mt s bi ton chn ng trong mng, d on v iu khin lu lng, chn on tc nghn... c th gii quyt vi s h tr ca mng Neuron. Sau y chng ti chn mt ng dng in hnh: Trong qu trnh kim tra cht lng dch v ADSL, ngi ta quan tm n 11 thng s: Gii hn SNR, tc ti xung ln nht, tc ti xung thc t, suy hao, tn s ca i dy, s bit trn 1 ton, SNR/ton... Tuy nhin khng phi my o no cng o c y cc thng s ny. Vn t ra l: Vi mt nhm thng s nht nh o c, lm th no d bo c thng s suy hao theo ng dy. y chng ti chn mng truyn thng 10 nt vo v mt nt ra. S nt n l 50. Mng c hun luyn vi b d liu 5000 bn ghi trn cc i cp khc nhau. Cc tham s c luyn vi 25 kin vi tham s Pher, Evap v Cons tng ng 1,0 ; 0,01; 0,8. Kt qu sau hun luyn cho ta ph thuc ca tham s suy hao ca ng dy theo tn s. Kt qu ny p dng tt xc nh suy hao nu bit tham s tn s.

Pher PjWP

cho mi thnh phn Pj WPi (1 i D). Khi tt c cc gi tr Pj WPi c gn, chuyn qua th tc chn gi tr. 2. Chn gi tr: Agent bt u t chn phn t trong mi tp

WP1

WPD

WPi

theo quy tc

Prob Pj (WPi ) =

jN ( Pi )

Pher Pj (WPi ) Pher Pj (WPi )

Trong tham s Pj WP t ca

3. Bay hi: Khi tt c cc agents chn xong cc phn

WPi

ti bc 2, mi thnh phn Pj ca mi

WPi

c bt i mt lng Pj := Pj - Evap.

4. Sau khi tt c cc phn t ca mi WPi gim mt lng Evap, mi gi tr c chn s c a vo

Biu suy hao tn hiu

50 45 40 35 30 25 20 15 10 5

Suy hao

Tn s(kHz)
0 0 200 400 600 800 1000 1200 1400

Hnh 1: Biu suy hao truyn dn

V. KT LUN V CC HNG NGHIN CU TIP THEO Nh trnh by trong phn II, gii thut kin cho php ta tm c li gii ti u vi xc sut bng 1. Tuy nhin, chng ta u bit nhng thut ton nh vy thng c thi gian thc hin rt ln. V vy mt hng ci tin l lai ghp gii thut kin vi mt thut ton cho ra kt qu ti u cc b(V d GA n gin). S lai ghp s nh sau:
Hun luyn trng s

ACO

GA

Li gii

Trao i kt qu

Li gii

Hnh 2: S lai ghp ACO GA

Nh vy GA s nhanh chng tm ra cc kt qu ti u cc b v chuyn kt qu cho ACO tip tc x l nhm tm ra cc li gii ti u ton cc.iu ny s lm gim thi gian tm kim nu chung ta ch s dng ring ACO. TI LIU THAM KHO
[1] M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and

F. Glover, editor, New Ideas in Optimization, papes 11-32. McGraw Hill, London, UK, 1999. [2] M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for discrete optimiization. Artificial Life, 5(2):137 172, 1999. [3] M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1):53-66, 1997. [4] M. Dorigo, V. Maniezzo, and A. Colorni. Positive feedback as search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnio di Milano, Italy, 1991. [5] M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, ans Cybernetics Part B, 26(1)29-41, 1996. [6] M. Dorigo and T. Sttxle. The ant colony optimization metaheuristic: Algorithms, applications and advances. Technical Report IRIDIA/2000-32, IRRIDIA, Universit Libre de Bruxelles, Belgium, 2000. [7] W. Gutjahr. ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters, 82(3):145-153, 2002. [8] W. J.Gutjahr. A generalized convergence result fot the graph-based Ant System metaheuristic. Technical Report 99-09, Department of Statistics and Decision Support Systems, University of Vienna, Austria, 1999. [9] W. J. Gutjahr. A graph-based Ant System and its convergence. Future Generation Computer Systems, 16(8):8733-888, 2000. [10] Hong Xun Hun and inh Trung Hong. On the Ant Colony System for Postman problem. Tp ch khoa hc-i hc quc gia H Ni t.XVIII, n 1,2002 pp29-37 [11] T. Sttzle and H. H. Hoos. The Max-Min Ant System and local search for the traveling salesman problem. In T. Bck, Z. Michalewicz, and X. Yao, editors, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC97), pages 309-314. IEEE Press, Piscataway, NJ, 1997. [12] T. Sttzle and M. Dorigo. A Short convergence proof for a class of ant colony Optimization Algorithms. IEEE Transactions on Evolutionary Computation, 2002 Ngy nhn bi: 15/09/2005

S LC TC GI NGUYN XUN TNG Sinh ngy 13/04/1964 Tt nghip i hc Bch khoa H ni khoa in t vin thng nm 1996. Thc s cng ngh thng tin nm 2003 ti i hc Quc gia H ni. Hin ang cng tc ti: Trung tm Tin hc, Bu in H Ni. Hng nghin cu: Mng Neural, Stochastic optimization problems, K thut d bo. Email: