Evaluation of simple performance measures for tuning SVM hyperparameters
|
|
- Wendy Dean
- 6 years ago
- Views:
Transcription
1 Evaluaton of smple performance measures for tunng SVM hyperparameters Kabo Duan, S Sathya Keerth, Aun Neow Poo Department of Mechancal Engneerng, Natonal Unversty of Sngapore, 0 Kent Rdge Crescent, 960, Sngapore Abstract Choosng optmal hyperparameters for support vector machnes s an mportant step n SVM desgn. Ths s usually done by mnmzng ether an estmate of generalzaton error or some other related performance measures. In ths paper, we emprcally study the usefulness of several smple performance measures that are very nexpensve to compute. The results pont out whch of these performance measures are adequate functonals for tunng SVM hyperparameters. For SVMs wth L soft-margn formulaton, none of the smple measures yelds a performance as good as k-fold cross-valdaton. Keywords: Support vector machne; Model selecton; Generalzaton error estmate; Performance measure; Hyperparameter tunng. Introducton Support vector machnes (SVMs) [] are extensvely used as a classfcaton tool n a varety of areas. They map the nput ( x ) nto a hgh dmensonal feature space ( z = φ(x) ) and construct an optmal hyperplane defned by w z b = 0 to separate examples from the two classes. For SVMs wth L soft-margn formulaton, ths s done by solvng the prmal problem: mn w + C ξ (P) s.t. y ( w z b) ξ, ξ > 0 where x s the -th example, y s the class label value whch s ether + or. (Throughout the paper, l wll denote the number of examples.) Ths problem s computatonally solved usng the soluton of ts dual form: mn f ( α ) = α (, ) α y y k x x α (D) s.t. 0 α C ; y = 0 α where k( x, x) = φ( x) φ( x) s the kernel functon that performs the nonlnear mappng. Popular kernel functons are: x x Gaussan kernel: k( x, x) = exp( ) σ d Polynomal kernel: k ( x, x) = ( + x x) To obtan a good performance, some parameters n SVMs have to be chosen carefully. These parameters nclude: the regularzaton parameter C, whch determnes the tradeoff between mnmzng the tranng error and mnmzng model complexty;
2 parameter (σ or d ) of the kernel functon that mplctly defnes the nonlnear mappng from nput space to some hgh dmensonal feature space. (In ths paper we partcularly focus on the Gaussan kernel.) These hgher level parameters are usually referred as hyperparameters. Tunng these hyperparameters s usually done by mnmzng the estmated generalzaton error such as the k-fold cross-valdaton error or the leave-one-out (LOO) error. Whle k-fold cross-valdaton error requres the soluton of several SVMs, LOO error requres the soluton of many (n the order of the number of examples) SVMs. For effcency, t s useful to have smpler estmates that, though crude, are very nexpensve to compute. Durng the past few years, several such smple estmates have been proposed. The man am of ths paper s to emprcally study the usefulness of these smple estmates as measures for tunng the SVM hyperparameters. The rest of the paper s organzed as follows. A bref revew of the performance measures s gven n secton. The settngs of the computatonal experments are descrbed n secton 3. The expermental results are analyzed and dscussed n secton 4. Fnally, some concludng remarks are made n secton 5. Performance Measures In ths secton, we brefly revew the estmates (performance measures) mentoned above.. K-fold Cross-Valdaton and LOO Cross-valdaton s a popular technque for estmatng generalzaton error and there are several versons. In k-fold cross-valdaton, the tranng data s randomly splt nto k mutually exclusve subsets (the folds) of approxmately equal sze. The SVM decson rule s obtaned usng k of the subsets and then tested on the subset left out. Ths procedure s repeated k tmes and n ths fashon each subset s used for testng once. Averagng the test error over the k trals gves an estmate of the expected generalzaton error. LOO can be vewed as an extreme form of k-fold cross-valdaton n whch k s equal to the number of examples. In LOO, one example s left out for testng each tme, and so the tranng and testng are repeated l tmes. It s known [9] that the LOO procedure gves an almost unbased estmate of the expected generalzaton error. K-fold cross-valdaton and LOO are applcable to arbtrary learnng algorthms. In the case of SVM, t s not necessary to run the LOO procedure on all l examples and strateges are avalable n the lterature to speed up the procedure. In spte of that, for tunng SVM hyperparameters, LOO s stll very expensve.. X-Alpha Bound In [7], Joachms developed the followng estmate, whch s an upper bound on the error rate of leave-one-out procedure. Ths estmate can be computed usng α from the soluton of SVM dual problem (D) and ξ from the soluton of SVM prmal problem (P):
3 Err = card { : ( R ξα α + ξ ) } () l Here card denotes cardnalty and R s an upper bound on c k( x, x) c + R for all x, x and some constant c. We refer to the estmate n () as the X-Alpha bound..3 Approxmate Span Bound Vapnk et al [3] ntroduced a new concept called span of support vectors. Based on ths new concept, they developed a new technque called span-rule (specally for SVMs) to approxmate the LOO estmate. The span-rule not only provdes a good functonal for SVM hyperparameter selecton, but also better reflects the actual error rate. The followng upper bound on LOO error was also proposed n [3]: n ) = * N S max( D, C α m LOO + () l l * n where: N LOO s the number of errors n LOO procedure; = α s the summaton of Lagrange multplers α taken over support vectors of the frst category (those for whch 0 < α < C ); m s the number of support vectors of the second category (those for whch α = C ); S s the span of support vectors (see [3] for the defnton of S ); D s the dameter of the smallest sphere contanng the tranng ponts n the feature space; and the Lagrange multplers α are obtaned from the tranng of SVM on the whole tranng data of sze l. Although the rght-hand sde bound n () has a smple form, t s expensve to compute the span S. The bound can be further smplfed by replacng S wth D SV, the dameter of the smallest sphere n the feature space contanng the support vectors of the frst category. It was proved n [3] that S D. Thus, we get SV n ) = * N DSV max( D, C α m LOO + (3) l l The rght-hand sde of () s referred as the span bound. Snce the bound n (3) s a looser bound than the span bound, we refer to t as the approxmate span bound..4 VC Bound SVMs are based on the dea of structural rsk mnmzaton ntroduced by statstcal learnng theory []. For the two-class classfcaton problem, the learnng machne s actually defned by a set of functons f ( x, α), whch perform a mappng from nput pattern x to class label y {, + }. A partcular choce of the adustable parameter α gves a traned machne. Suppose a set of tranng examples ( x, y),,( x l, yl ) are drawn from some unknown probablty dstrbuton P ( x, y). Then, the expected test error for a traned machne s: R( α) = y f ( x, α) dp( x, y) The quantty R (α ) s called expected rsk. Emprcal rsk s defned as the measured mean error rate on the tranng set: 3
4 l Remp = = y f ( x, α ) l For a partcular choce of α, wth probablty η ( 0 η ), the followng bound holds []: h(log(l / h) + ) log( η / 4) R( α) Remp ( α) + (4) l where h s the VC-dmenson of a set of functons f ( x, α) and t descrbes the capacty of the set of functons. The rght-hand sde of (4) s referred as rsk bound. The second term of the rsk bound s usually referred as the VC confdence. For a gven learnng task, the Structural Rsk Mnmzaton Prncple [] chooses the parameter α so that the rsk bound s mnmal. The man dffculty n applyng the rsk bound s that t s dffcult to determne the VC-dmenson of the set of functons. For SVMs, a VC bound was proposed n [] by approxmatng the VC-dmenson n (4) by a loose bound on t: h D w + (5) The rght-hand sde of (5) s a loose bound on VC-dmenson and, f we use ths bound to approxmate h, sometmes we may get nto a stuaton where l h s so small that the term nsde the square root n (4) may become negatve. To avod ths problem, we do the followng. Snce h s also bounded by l +, we smply set h to l + whenever D w + exceeds l +..5 Radus-Margn Bound For SVMs wth hard-margn formulaton, t was shown by Vapnk et al [3] that the followng bound holds: LOO Err D w (6) 4l where w s the weght vector computed by SVM tranng and D s the dameter of the smallest sphere that contans all the tranng examples n the feature space. The rght-hand sde of (6) s usually referred as the radus-margn bound. The SVM problem wth L soft-margn formulaton can be converted to the hardmargn SVM problem wth a slghtly modfed kernel functon [4]. Chapelle et al [3] explored the computaton of gradent of D and w, and ther results make these gradent computaton very easy. In ther experment, they mnmze radus margn bound usng gradent descent technque and the results showed that radus-margn bound could act as a good functonal to tune the degree of polynomal kernel. In ths paper, we wll study the usefulness of D w as a functonal to tune the hyperparameters of SVM wth Gaussan kernel (both L soft-margn formulaton and L soft-margn formulaton). 4
5 3 Computatonal Experments The purpose of our experments s to see how good the varous estmates (bounds) are for tunng the hyperparameters of SVMs. In ths paper, we manly focus on SVMs wth Gaussan kernel. For one gven estmator, goodness s evaluated by comparng the true mnmum of the test error wth the test error at the optmal hyperparameter set found by mnmzng the estmate. We dd the smulatons on fve benchmark datasets: Banana, Image, Splce, Waveform and Tree. General nformaton about the datasets s gven n Table. The detaled nformaton of the frst four datasets can be found n [0]. The Tree dataset was orgnally used by Baley et al [] and was formed from a geologcal remote sensng data; It has two classes: one conssts of patterns of trees, and the other conssts of non-tree patterns. Note that each of the datasets has a large number of test examples so that performance on the test set, the test error, can be taken as an accurate reflecton of generalzaton performance. Table. General nformaton about the datasets Datasets Number of nput Number of tranng Number of test varables examples examples Banana Image Splce Waveform Tree One experment was set up for SVM wth L soft-margn formulaton. The smple performance measures we tested n ths experment are: 5-fold cross-valdaton error, X-Alpha bound, VC bound, approxmate span bound and D w. As we mentoned n secton, the SVM problem wth L soft-margn formulaton can be converted to the hard-margn SVM problem wth a slghtly modfed kernel functon. For SVM hard-margn formulaton, the radus-margn bound can be appled. So, we set up an experment to see how good the radus-margn bound ( D w ) s for the L soft-margn formulaton, partcularly wth Gaussan kernel. In the above two experments, frst we fx the regularzaton parameter C at some value and vary the wdth of Gaussan kernel σ n a large range, and then we fx the value of σ and vary the value of C. The fxed values of C and σ are chosen so that the combnaton acheves a test error close to the smallest test error rate. Tables -5 descrbe the performance of the varous estmates. Both test error rates and the hyperparameter values at the mnma of dfferent estmates are shown there. However, we must pont out that we only searched n a fnte range of the hyperparameter space and hence the mnma are confned to ths fnte range. Due to lack of space, we gve detaled plots of the estmates as functons of C and σ, only for the Image dataset (Fgures 4). The plots for the other datasets show smlar varatons wth respect to the two hyperparameters. We make the plots of other datasets avalable at: In order to show the varatons of dfferent estmates n one fgure, normalzaton was done on 5
6 the estmates when necessary. Snce what we really concern s how the varaton of the estmate relates to the varaton of the test error rather than how ther values are related, ths normalzaton does no harm. Another experment was set up to see how the sze of the tranng set affects the performance of dfferent estmates. The Waveform dataset was used n ths experment. We vary the number of tranng examples from 00 to 000. For comparson purpose, for each tranng set of dfferent sze, we use the same test set that has 4000 examples. As n the other experments, the performance of each estmate s evaluated by comparng the test error rates at the optmal hyperparameter set found by mnmzng the estmate. Fgure 5 shows the performance of the varous measures as a functon of tranng sze. 4 Analyss and Dscusson Let us analyze the performance of the varous estmates, one by one. K-fold Cross-Valdaton: On each dataset, 5-fold cross-valdaton produced a curve that not only has a mnmum very close to that of the test error curve, but t also has a shape very smlar to the curve of the test error. Of all the estmates, 5-fold cross-valdaton yelded the best performance. Even for a small tranng set wth 00 examples, 5-fold crossvaldaton gave a qute good estmate of generalzaton error (see Fgure 5). Recently, a lot of research work has been devoted to speedng up the LOO procedure so that t can be used to tune the hyperparameters of SVMs. Some of those speed-up strateges, such as alpha seedng [6] and loose tolerance [8], can be easly carred from LOO to k-fold cross-valdaton. Thus, k-fold cross-valdaton s also an effcent technque for tunng SVM hyperparameters. X-Alpha Bound: X-Alpha bound s a very smple bound, whch can be computed wthout any extra work after the SVM s traned on the whole tranng data. Although t produced a curve that has a shape slghtly dfferent from that of the test error, n most of the cases, the predcted hyperparameters gave performance reasonably close to the best one n terms of test error. We also notce that, at low C values, X-Alpha bound gves an estmate that s very close to the test error. Ths s because, at low C values, the α are small and hence, the X-Alpha estmate n () s very close to the LOO estmate. Another nce property of X-Alpha bound s that, rrespectve of the sze of tranng set, t always gves an estmate reasonably close to the true mnmum n terms of test error (see Fgure 5). To see the correlaton of the above two estmate (k-fold cross-valdaton estmate and X-Alpha bound) wth test error, we tred the combnaton of C and σ n a very 6
7 large range and generated a plot that takes the test error as one coordnate and the estmate as another coordnate. Each pont on the plot corresponds to one combnaton of C and σ. The plot s shown n Fgure 6. Snce we are especally nterested n ponts at whch the estmate and the test error take small values, the fgure s magnfed to focus only on ths partcular area. Ths plot shows that 5-fold crossvaldaton estmate has much better correlaton wth the test error. Approxmate Span Bound: In [3], Vapnk et al effectvely used span-based dea for tunng SVM hyperparameters. In approxmate span bound, S s replaced by D SV. The poor behavor of ths bound s probably due to the fact that D SV s a poor approxmate of S. VC Bound: The experments show that VC bound s not good for tunng SVM hyperparameters, at least for the datasets used by us. However, for another dataset, Burges [] found ths bound to be useful for determnng a good value for σ. Therefore, t s not clear how useful ths bound s. It s qute possble that the goodness of the VC bound depends on how well D w + approxmates the VC dmenson h. D w for L Soft-Margn Formulaton: Let us now consder D w for L soft-margn formulaton. Fgure and clearly show the nadequacy of ths measure for tunng hyperparameters. The plots for the other datasets are also very smlar. The nadequacy can be easly explaned. We can prove that, for an SVM wth Gaussan kernel, D w goes to zero as C goes to zero or as σ goes to nfnty. Frst, let us fx have σ and consder the varaton of w = l l α α = = l l α k α = = l l α = = α y y k( x, x ( x, x ) D w as C goes to zero. We l C Snce D s ndependent of C and upper-bounded by 4, t easly follows that, as C goes to zero, w goes to zero and so does D w. ) Now let us fx C at a fnte value and consder the varaton of to nfnty. We have D w as σ goes 7
8 D w = D l l l = = 4 α = = α y y k( x, x ) As σ goes to nfnty, k ( x, x) goes to and, snce the alpha varables are bounded by C, we have, n the lmt, Thus, as = = ( σ goes to nfnty, l l = = l l = = l = α y ) α α y = 0 y l α α y y k( x, x ) α α y y k( x, x ) D w goes to zero. Crstann et al n [5] showed that D w s good for tunng the wdth of the Gaussan kernel for hard-margn SVM. The asymptotc movement of D w to zero as σ goes to nfnty that we establshed above holds only when C s fxed at a fnte value. When C s nfnty (the hard margn case), the alpha varables are unbounded and hence our proof wll not hold. Thus, what we have shown s not n any way nconsstent wth the results of Crstann et al. Schölkopf et al [] showed that D w s good for tunng the degree of polynomal kernel for SVMs wth L soft-margn formulaton. Our experments and analyss on D w are only lmted to SVM wth Gaussan kernel. Although D w s nadequate for tunng hyperparameters for SVM wth Gaussan kernel, possbly t stll can be used to tune the degree of polynomal kernel, as Schölkopf et al dd. D w for L Soft-Margn Formulaton: Earler, we ponted out that D w s nadequate for tunng hyperparameters for the SVM L soft-margn formulaton wth Gaussan kernel. However, For SVMs wth L soft-margn formulaton, whch can be converted to an SVM hard-margn problem, our experments show that radus-margn bound gves a very good estmate of the optmal hyperparameters. Ths agrees wth the results of Chapelle et al [3], where the radus-margn bound s chosen as the functonal that s mnmzed usng gradent descent. However, we notce that the radus-margn bound may have more than one mnmum (see Fgure 3). Typcally, there s one local mnmum whose value of radus-margn bound s hgher than the least radus-margn bound value. Ths local mnmum s usually located at a very large σ value. Thus, mnmzng the radusmargn bound usng gradent descent technque, as Chapelle et al dd, can get stuck at a local mnmum of the radus-margn bound. So, choosng a proper startng pont for gradent descent search s mportant. 8
9 Image: log C = 4.0 X-Alpha Bound 5-fold CV Err log sgmasq (a) Image: log C = 4.0 VC Bound Approx Span Bound D W log sgmasq (b) Fgure : Varaton of X-Alpha Bound, 5-fold CV Err,, VC Bound, Approxmate Span Bound, and D w wth respect to σ for fxed C value, for SVM L soft-margn formulaton. In (b), the vertcal axs s normalzed dfferently for X-Alpha Bound, Approxmate Span Bound and D w. For each curve, denotes the mnmum pont. 9
10 Image: log sgmasq =.0 X-Alpha Bound 5-fold CV Err log C (a) Image: log sgmasq =.0 VC Bound Approx Span Bound D W log C (b) Fgure : Varaton of X-Alpha Bound, 5-fold CV Err,, VC Bound, Approxmate Span Bound, and D w wth respect to C for fxed σ value, for SVM L soft-margn formulaton. In (b), the vertcal axs s normalzed dfferently for X-Alpha Bound, Approxmate Span Bound and D w. For each curve, denotes the mnmum pont. 0
11 Image: log C = 0.44 D W log sgmasq Fgure 3: Varaton of soft-margn formulaton. The vertcal axs for denotes the mnmum pont. w D and wth respect to σ for fxed C value, for SVM L w D s normalzed. For each curve, Image: log sgmasq = -0.9 D W log C Fgure 4: Varaton of soft-margn formulaton. The vertcal axs for denotes the mnmum pont. w D and wth respect to C for fxed σ value, for SVM L w D s normalzed. For each curve,
12 Table : The value of at the mnma of dfferent crtera for fxed C values, for SVM L softmargn formulaton. The values n parentheses are the correspondng logarthms of σ at the mnma. Crteron Banana Image Splce Waveform Tree log C = 5.0 log C = 4.0 log C = 0.40 log C =.40 log C = (0.60) (.00) (3.40) (3.0) (3.80) 5-fold CV Err (.30) (.0) (3.0) (4.40) (5.0) X-Alpha Bound (-.0) (.00) (3.80) (3.0) (.0) VC Bound (8.90) (0.0) (8.40) (0.0) (-0.0) Approx Span Bound (6.60) (6.50) (5.60) (5.0) (9.80) D w (0.0) (0.0) (0.0) (0.0) (-.40) Table 3: The value of at the mnma of dfferent crtera for fxed σ values, for SVM L softmargn formulaton. The values n parentheses are the correspondng logarthms of C at the mnma. Crteron Banana Image Splce Waveform Tree log σ =0.60 log σ =.0 log σ =3.40 log σ =3.0 log σ = (5.0) (4.30) (0.40) (.40) (8.60) 5-fold CV Err (9.00) (6.0) (0.50) (0.0) (4.80) X-Alpha Bound (9.30) (6.70) (-.70) (-.80) (9.60) VC Bound (-3.0) (-3.6) (-0.0) (-0.0) (-0.0) Approx Span Bound w D (.80) (-0.0) (-0.60) (-0.0) (-0.90) (-0.0) (0.0) 93 (-0.0) (.0) (-0.0) Table 4: The value of at the mnma of dfferent crtera for fxed C values, for SVM L softmargn formulaton. The values n parentheses are the correspondng logarthms of σ at the mnma. Banana Image Splce Waveform Tree Crteron log C = log C = 0.44 log C = 6.9 log C = 0 log C = (-.40) (0.50) (3.30) (.80) (4.60) D w (-.60) (-0) (3.0) (.0) (-.40) Table 5: The value of at the mnma of dfferent crtera for fxed σ values, for SVM L softmargn formulaton. The values n parentheses are the correspondng logarthms of C at the mnma. Banana Image Splce Waveform Tree Crteron log σ =-.39 log σ =-0.9 log σ =3.07 log σ =.80 log σ = w D (0.0) 7 (-0.90) (.40) (0.40) (.0) 06 (9.0) (0.0) 007 (-0.60) (9.80) 43 (-.40)
13 at the Mmnma of Varous Measures Dataset: Waveform X-Alpha Bound 5-fold CV Err Num of Tranng Examples (a) at the Mmnma of Varous Measures Dataset: Waveform VC Bound Approx Span Bound D W Num of Tranng Examples (b) Fgure 5: Performance of varous measures for dfferent tranng set szes. The waveform dataset has been used n ths experment. The followng values were tred for the number of tranng examples: 00, 400, 600, 800, and 000. The number of the test examples s
14 Dataset: Waveform 3 5-fold CV Err (a) Dataset: Waveform 0.5 X-Alpha Bound (b) Fgure 6: Correlaton of 5-fold cross-valdaton and X-Alpha bound wth test error. Each pont corresponds to one combnaton of C and σ. Each fgure has been magnfed to show only ponts where test error and the estmate take small values. The ponts wth least value of the estmate are marked by +. 4
15 5 Conclusons We have tested several easy-to-compute performance measures for SVMs wth L soft-margn formulaton and SVMs wth L soft-margn formulaton. The conclusons are: 5-fold cross-valdaton gves an excellent estmate of the generalzaton error. For the L soft margn SVM formulaton, none of the other measures yelds a performance as good as 5-fold cross valdaton. It even gves a good estmate on small tranng set. The 5-fold cross-valdaton estmate also has a very good correlaton wth the test error. X-Alpha bound can fnd a reasonably good hyperparameter set for SVM, at whch the test error s close to the true mnmum of the test error. But the hyperparameters sometmes may not be close to the optmal ones. A nce property of ths estmate s that t performs well over a range of tranng set szes. The approxmate span bound and VC bound cannot gve a useful predcton of the optmal hyperparameters. Ths s probably because the approxmatons ntroduced nto these bounds are too loose. For the SVM L soft-margn formulaton, hyperparameters. D w s nadequate for tunng the The radus-margn bound gves a very good predcton of the optmal hyperparameters for SVM L soft-margn formulaton. However, the possblty of local mnma should be taken nto consderaton when ths bound s mnmzed usng gradent descent method. References [] R.R. Baley, E.J. Pettt, R.T. Borochoff, M.T. Manry, and X. Jang, Automatc Recognton of USGS Land Use/Cover Categores Usng Statstcal and Neural Networks Classfers, n: Proceedngs of SPIE OE/Aerospace and Remote Sensng, SPIE 993. [] C.J.C. Burges, A Turtoral on Support Vector Machnes for Pattern Recognton, Data Mnng Knowledge Dscovery, Vol., No. (998) [3] O. Chapelle, V. Vapnk, O. Bousquet, and S. Mukheree, Choosng Kernel Parameters for Support Vector Machnes, Submtted to Machne Learnng, 000. Avalable: [4] C. Cortes and V. Vapnk, Support Vector Networks, Machne Learnng 0 (995) [5] N. Crstann, C. Campbell and J. Shawe-Taylor, Dynamcally Adaptng Kernels n Support Vector Machnes, n: M. Kearns, S. Solla and D. Cohn, Ed., Advances n Neural Informaton Processng Systems, Vol.. (MIT Press, 999)
16 [6] D. DeCoste and K. Wagstaff, Alpha Seedng for Support Vector Machnes, In: Proceedngs of Inernatonal Conference on Knowledge Dscovery and Data Mnng (KDD-000). [7] T. Joachms, The Maxmum-Margn Approach to Learnng Text Classfers: Method, Theory and Algorthms, Ph.D. Thess, Department of Computer Scence, Unversty of Dortmund, 000. [8] J. H. Lee and C.J. Ln, Automatc Model Selecton for Support Vector Machnes. Techncal Report, Department of Computer Scence and Informaton Engneerng, Natonal Tawan Unversty, 000. [9] Luntz and V. Bralovsky, On Estmaton of Characters Obtaned n Statstcal Procedure of Recognton, Techncheskaya Kbernetca, 3 (969). (n Russan). [0] G. Rätsch, Benchmark Datasets, 999. Avalable: [] B. Schölkopf, C. Burges, and V. Vapnk, Extractng Support Data for A Gven Task, n: U. M. Fayyad and R. Uthurusamy, Ed.,Proc. Frst Internatonal Conference on Knowledge Dscovery & Data Mnng (AAAI Press, Menlo Park, 995). [] V. Vapnk, Statstcal Learnng Theory (John Wley & Sons, 998). [3] V. Vapnk and O. Chapelle, Bounds on Error Expectaton for Support Vector Machne, n: Smola, Bartlett, Schölkopf and Schuurmans, Ed., Advences n Large Margn Classfers (MIT Press, 999). 6
Lecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationBounds on the Generalization Performance of Kernel Machines Ensembles
Bounds on the Generalzaton Performance of Kernel Machnes Ensembles Theodoros Evgenou theos@a.mt.edu Lus Perez-Breva lpbreva@a.mt.edu Massmlano Pontl pontl@a.mt.edu Tomaso Poggo tp@a.mt.edu Center for Bologcal
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationPattern Classification
Pattern Classfcaton All materals n these sldes ere taken from Pattern Classfcaton (nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wley & Sons, 000 th the permsson of the authors and the publsher
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationEnsemble Methods: Boosting
Ensemble Methods: Boostng Ncholas Ruozz Unversty of Texas at Dallas Based on the sldes of Vbhav Gogate and Rob Schapre Last Tme Varance reducton va baggng Generate new tranng data sets by samplng wth replacement
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationLecture 3: Dual problems and Kernels
Lecture 3: Dual problems and Kernels C4B Machne Learnng Hlary 211 A. Zsserman Prmal and dual forms Lnear separablty revsted Feature mappng Kernels for SVMs Kernel trck requrements radal bass functons SVM
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationStatistical machine learning and its application to neonatal seizure detection
19/Oct/2009 Statstcal machne learnng and ts applcaton to neonatal sezure detecton Presented by Andry Temko Department of Electrcal and Electronc Engneerng Page 2 of 42 A. Temko, Statstcal Machne Learnng
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationOnline Classification: Perceptron and Winnow
E0 370 Statstcal Learnng Theory Lecture 18 Nov 8, 011 Onlne Classfcaton: Perceptron and Wnnow Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton In ths lecture we wll start to study the onlne learnng
More informationMAXIMUM A POSTERIORI TRANSDUCTION
MAXIMUM A POSTERIORI TRANSDUCTION LI-WEI WANG, JU-FU FENG School of Mathematcal Scences, Peng Unversty, Bejng, 0087, Chna Center for Informaton Scences, Peng Unversty, Bejng, 0087, Chna E-MIAL: {wanglw,
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationSIO 224. m(r) =(ρ(r),k s (r),µ(r))
SIO 224 1. A bref look at resoluton analyss Here s some background for the Masters and Gubbns resoluton paper. Global Earth models are usually found teratvely by assumng a startng model and fndng small
More informationCSC 411 / CSC D11 / CSC C11
18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t
More informationSupport Vector Machines
CS 2750: Machne Learnng Support Vector Machnes Prof. Adrana Kovashka Unversty of Pttsburgh February 17, 2016 Announcement Homework 2 deadlne s now 2/29 We ll have covered everythng you need today or at
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? Intuton of Margn Consder ponts A, B, and C We
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationINF 5860 Machine learning for image classification. Lecture 3 : Image classification and regression part II Anne Solberg January 31, 2018
INF 5860 Machne learnng for mage classfcaton Lecture 3 : Image classfcaton and regresson part II Anne Solberg January 3, 08 Today s topcs Multclass logstc regresson and softma Regularzaton Image classfcaton
More informationSupport Vector Machines
Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x n class
More informationSupport Vector Machines
Support Vector Machnes Konstantn Tretyakov (kt@ut.ee) MTAT.03.227 Machne Learnng So far Supervsed machne learnng Lnear models Least squares regresson Fsher s dscrmnant, Perceptron, Logstc model Non-lnear
More informationSupport Vector Machines
Support Vector Machnes Konstantn Tretyakov (kt@ut.ee) MTAT.03.227 Machne Learnng So far So far Supervsed machne learnng Lnear models Non-lnear models Unsupervsed machne learnng Generc scaffoldng So far
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationSparse Gaussian Processes Using Backward Elimination
Sparse Gaussan Processes Usng Backward Elmnaton Lefeng Bo, Lng Wang, and Lcheng Jao Insttute of Intellgent Informaton Processng and Natonal Key Laboratory for Radar Sgnal Processng, Xdan Unversty, X an
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationFORECASTING EXCHANGE RATE USING SUPPORT VECTOR MACHINES
Proceedngs of the Fourth Internatonal Conference on Machne Learnng and Cybernetcs, Guangzhou, 8- August 005 FORECASTING EXCHANGE RATE USING SUPPORT VECTOR MACHINES DING-ZHOU CAO, SU-LIN PANG, YUAN-HUAI
More informationCSE 252C: Computer Vision III
CSE 252C: Computer Vson III Lecturer: Serge Belonge Scrbe: Catherne Wah LECTURE 15 Kernel Machnes 15.1. Kernels We wll study two methods based on a specal knd of functon k(x, y) called a kernel: Kernel
More informationNonlinear Classifiers II
Nonlnear Classfers II Nonlnear Classfers: Introducton Classfers Supervsed Classfers Lnear Classfers Perceptron Least Squares Methods Lnear Support Vector Machne Nonlnear Classfers Part I: Mult Layer Neural
More informationLinear Classification, SVMs and Nearest Neighbors
1 CSE 473 Lecture 25 (Chapter 18) Lnear Classfcaton, SVMs and Nearest Neghbors CSE AI faculty + Chrs Bshop, Dan Klen, Stuart Russell, Andrew Moore Motvaton: Face Detecton How do we buld a classfer to dstngush
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationFeature Selection for SVMs
Feature Selecton for SVMs J. Weston y, S. Mukherjee yy, O. Chapelle Λ, M. Pontl yy T. Poggo yy, V. Vapnk Λ;yyy y Barnhll BoInformatcs.com, Savannah, Georga, USA. yy CBCL MIT, Cambrdge, Massachusetts, USA.
More informationLogistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI
Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationMultigradient for Neural Networks for Equalizers 1
Multgradent for Neural Netorks for Equalzers 1 Chulhee ee, Jnook Go and Heeyoung Km Department of Electrcal and Electronc Engneerng Yonse Unversty 134 Shnchon-Dong, Seodaemun-Ku, Seoul 1-749, Korea ABSTRACT
More informationSupport Vector Machines CS434
Support Vector Machnes CS434 Lnear Separators Many lnear separators exst that perfectly classfy all tranng examples Whch of the lnear separators s the best? + + + + + + + + + Intuton of Margn Consder ponts
More informationImage classification. Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing i them?
Image classfcaton Gven te bag-of-features representatons of mages from dfferent classes ow do we learn a model for dstngusng tem? Classfers Learn a decson rule assgnng bag-offeatures representatons of
More informationChapter 6 Support vector machine. Séparateurs à vaste marge
Chapter 6 Support vector machne Séparateurs à vaste marge Méthode de classfcaton bnare par apprentssage Introdute par Vladmr Vapnk en 1995 Repose sur l exstence d un classfcateur lnéare Apprentssage supervsé
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationKernels in Support Vector Machines. Based on lectures of Martin Law, University of Michigan
Kernels n Support Vector Machnes Based on lectures of Martn Law, Unversty of Mchgan Non Lnear separable problems AND OR NOT() The XOR problem cannot be solved wth a perceptron. XOR Per Lug Martell - Systems
More informationTurbulence classification of load data by the frequency and severity of wind gusts. Oscar Moñux, DEWI GmbH Kevin Bleibler, DEWI GmbH
Turbulence classfcaton of load data by the frequency and severty of wnd gusts Introducton Oscar Moñux, DEWI GmbH Kevn Blebler, DEWI GmbH Durng the wnd turbne developng process, one of the most mportant
More information18-660: Numerical Methods for Engineering Design and Optimization
8-66: Numercal Methods for Engneerng Desgn and Optmzaton n L Department of EE arnege Mellon Unversty Pttsburgh, PA 53 Slde Overve lassfcaton Support vector machne Regularzaton Slde lassfcaton Predct categorcal
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationLearning with Tensor Representation
Report No. UIUCDCS-R-2006-276 UILU-ENG-2006-748 Learnng wth Tensor Representaton by Deng Ca, Xaofe He, and Jawe Han Aprl 2006 Learnng wth Tensor Representaton Deng Ca Xaofe He Jawe Han Department of Computer
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationMultilayer Perceptron (MLP)
Multlayer Perceptron (MLP) Seungjn Cho Department of Computer Scence and Engneerng Pohang Unversty of Scence and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjn@postech.ac.kr 1 / 20 Outlne
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationKristin P. Bennett. Rensselaer Polytechnic Institute
Support Vector Machnes and Other Kernel Methods Krstn P. Bennett Mathematcal Scences Department Rensselaer Polytechnc Insttute Support Vector Machnes (SVM) A methodology for nference based on Statstcal
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationDepartment of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING
MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationEstimating the Fundamental Matrix by Transforming Image Points in Projective Space 1
Estmatng the Fundamental Matrx by Transformng Image Ponts n Projectve Space 1 Zhengyou Zhang and Charles Loop Mcrosoft Research, One Mcrosoft Way, Redmond, WA 98052, USA E-mal: fzhang,cloopg@mcrosoft.com
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationCSE 546 Midterm Exam, Fall 2014(with Solution)
CSE 546 Mdterm Exam, Fall 014(wth Soluton) 1. Personal nfo: Name: UW NetID: Student ID:. There should be 14 numbered pages n ths exam (ncludng ths cover sheet). 3. You can use any materal you brought:
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationSupport Vector Machines
/14/018 Separatng boundary, defned by w Support Vector Machnes CISC 5800 Professor Danel Leeds Separatng hyperplane splts class 0 and class 1 Plane s defned by lne w perpendcular to plan Is data pont x
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationMULTICLASS LEAST SQUARES AUTO-CORRELATION WAVELET SUPPORT VECTOR MACHINES. Yongzhong Xing, Xiaobei Wu and Zhiliang Xu
ICIC Express Letters ICIC Internatonal c 2008 ISSN 1881-803 Volume 2, Number 4, December 2008 pp. 345 350 MULTICLASS LEAST SQUARES AUTO-CORRELATION WAVELET SUPPORT VECTOR MACHINES Yongzhong ng, aobe Wu
More information