Some Theory Behind Algorithms for Stochastic Optimization
|
|
- Blaise Hodges
- 5 years ago
- Views:
Transcription
1 Sme Thery Behind Algrithms fr Stchastic Optimizatin Zelda Zabinsky University f Washingtn Industrial and Systems Engineering May 24, 2010 NSF Wrkshp n Simulatin Optimizatin
2 Overview Prblem frmulatin Theretical perfrmance f stchastic adaptive search methds Algrithms based n Hit-and-Run t apprximate theretical perfrmance Incrprate randm sampling and nisy bjective functins 2
3 What is Stchastic Optimizatin? Randmness in algrithm AND/OR in functin evaluatin Related terms: Simulatin ptimizatin Optimizatin via simulatin Randm search methds Stchastic apprximatin Stchastic prgramming Design f experiments Respnse surface ptimizatin 3
4 Prblem Frmulatin Minimize f(x) subject t x in S x: n variables, cntinuus and/r discrete f(x): bjective functin, culd be black-bx, ill-structured, nisy S: feasible set, nnlinear cnstraints, r membership racle Assume an ptimum x* exists, with y*=f(x*) 4
5 Example Prblem Frmulatins Maximize expected value subject t standard deviatin < b Minimize standard deviatin subject t expected value > t Minimize CVaR (cnditinal value at risk) Minimize sum f least squares frm data Maximize prbability f satisfying nisy cnstraints 5
6 Apprximate r Estimate f(x)? Apprximate a cmplicated functin: Taylr series expansin Finite element analysis Cmputatinal fluid dynamics Estimate a nisy functin with: Replicatins Length f discrete-event simulatin run 6
7 Nisy Objective Functin f (x) = E Ω [ g( x,ω )] x f (x) S x 7
8 Scenari-based Recurse Functin g y ( x,ω) c T y + E Ω ming y [ ( x,ω) ] Scenari I Scenari II Scenari III S 8 x
9 Lcal versus Glbal Optima f Lcal ptima are relative t the neighbrhd and algrithm (x) 0 0 S x 9
10 Lcal versus Glbal Optima f Lcal ptima are relative t the neighbrhd and algrithm (x) 0 0 S x 10
11 Research Questin: What D We Really Want? D we really just want the ptimum? What abut sensitivity? D we want t apprximate the entire surface? Multi-criteria? Rle f bjective functin and cnstraints? Where des randmness appear? 11
12 Hw can we slve? IDEAL Algrithm: Optimizes any functin quickly and accurately Prvides infrmatin n hw gd the slutin is Handles black-bx and/r nisy functins, with cntinuus and/r discrete variables Is easy t implement and use 12
13 Theretical Perfrmance f Stchastic Adaptive Search What kind f perfrmance can we hpe fr? Glbal ptimizatin prblems are NP-hard Tradeff between accuracy and cmputatin Sacrifice guarantee f ptimality fr speed in finding a gd slutin Three theretical cnstructs: Pure adaptive search (PAS) Hesitant adaptive search (HAS) Annealing adaptive search (AAS) 13
14 Perfrmance f Tw Simple Methds Grid Search: Number f grid pints is O((L/ε) n ), where L is the Lipschitz cnstant, n is the dimensin, and ε is distance t the ptimum Pure Randm Search: Expected number f pints is O(1/p(y*+ε)), where p(y*+ε) is the prbability f sampling within ε f the ptimum y* Cmplexity f bth is expnential in dimensin 14
15 Pure Adaptive Search (PAS) PAS: chses pints unifrmly distributed in imprving level sets x2 x
16 Bunds n Expected Number f Iteratins PAS (cntinuus): E[N(y*+ε)] < 1 + ln (1/p(y*+ε) ) where p(y*+ε) is the prbability f PRS sampling within ε f the glbal ptimum y* PAS (finite): E[N(y*)] < 1 + ln (1/p 1 ) where p 1 is the prbability f PRS sampling the glbal ptimum [Zabinsky and Smith, 1992] [Zabinsky, Wd, Steel and Baritmpa, 1995] 16
17 Pure Adaptive Search Theretically, PAS is LINEAR in dimensin Therem: Fr any glbal ptimizatin prblem in n dimensins, with Lipschitz cnstant at mst L, and cnvex feasible regin with diameter at mst D, the expected number f PAS pints t get within ε f the glbal ptimum is: E[N(y*+ε)] < 1 + n ln(ld / ε) [Zabinsky and Smith, 1992] 17
18 Finite PAS Analgus LINEARITY result Therem: Fr an n dimensinal lattice {1,,k} n, with distinct bjective functin values, the expected number f pints fr PAS, sampling unifrmly, t first reach the glbal ptimum is: E[N(y*)] < 2 + n ln(k) [Zabinsky, Wd, Steel and Baritmpa, 1995] 18
19 Hesitant Adaptive Search (HAS) What if we sample imprving level sets with bettering prbability b(y) and hesitate with prbability 1-b(y)? E[N(y*+ε)] = y*+ε dρ(t) b(t) p(t) where ρ(t) is the underlying sampling distributin and p(t) is the prbability f sampling t r better [Bulger and Wd, 1998] 19
20 General HAS Fr a mixed discrete and cntinuus glbal ptimizatin prblem, the expected value f N(y*+ε), the variance, and the cmplete distributin can be expressed using the sampling distributin ρ(t) and bettering prbabilities b(y) [Wd, Zabinsky and Kristinsdttir, 2001] 20
21 Annealing Adaptive Search (AAS) What if we sample frm the riginal feasible regin each iteratin, but change distributins? Generate pints ver the whle dmain using a Bltzmann distributin parameterized by temperature T Bltzmann distributin becmes mre cncentrated arund the glbal ptima as the temperature decreases Temperature is determined by a cling schedule The recrd values f AAS are dminated by PAS and thus LINEAR in dimensin [Rmeijn and Smith, 1994] 21
22 Perfrmance f Annealing Adaptive Search The expected number f sample pints f AAS is bunded by HAS with a specific b(y) Select the next temperature s that the prbability f generating an imprvement under that Bltzmann distributin is at least 1-α, i.e., P( Y AAS R( k)+1 < y Y AAS R(k ) = y) 1 α Then the expected number f AAS sample pints is LINEAR in dimensin [Shen, Kiatsupaibul, Zabinsky and Smith, 2007] 22
23 AAS with Adaptive Cling Schedule f(x) f(x 1 ) f(x 2 ) f(x 4 ) f * *) (x f(x 3 ) f(x 0 ) x Bltzmann Densities T X 1 2 = T1 = 1 X 2 X 4 * * x X 3 T=10 T=1 T=0.5 X 0 x 23
24 Research Areas Develp theretical analysis f PAS, HAS, AAS fr nisy r apprximate functins Mdel apprximatin r estimatin errr Characterize impact f errr n perfrmance Use thery t develp algrithms Apprximate sampling frm imprving sets (as PAS) r Bltzmann distributins (as AAS) Use HAS, with ρ(t) and b(y), t quantify and balance accuracy and efficiency 24
25 Randm Search Algrithms Instance-based methds Sequential randm search Multi-start and ppulatin-based algrithms Mdel-based methds Imprtance sampling Crss-entrpy [Rubinstein and Krese, 2004] Mdel reference adaptive search [Hu, Fu and Marcus, 2007] [Zlchin, Birattari, Meuleau and Drig, 2004] 25
26 Sequential Randm Search Stchastic apprximatin [Rbbins and Mnr, 1951] Step-size algrithms [Rastrigin, 1960] [Slis and Wets, 1981] Simulated annealing [Rmeijn and Smith, 1994], [Alrafaei and Andradttir, 1999] Tabu search [Glver and Kchenberger, 2003] Nested partitin [Shi and Olafssn, 2000] COMPASS [Hng and Nelsn, 2006] View these algrithms as Markv chains with Candidate pint generatrs Update prcedures 26
27 Use Hit-and-Run t Apprximate AAS Hit-and-Run is a Markv chain Mnte Carl (MCMC) sampler cnverges t a unifrm distributin [Smith, 1984] in plynmial time O(n 3 ) [Lvász, 1999] can apprximate any arbitrary distributin by using a filter The difficulty f implementing AAS is t generate pints directly frm a family f Bltzmann distributins 27
28 Hit-and-Run Hit-and-Run generates a randm directin (unifrmly distributed n a hypersphere) and a randm pint (unifrmly distributed n the line) X 2 X 1 X 3 28
29 Imprving Hit-and-Run IHR: chse a randm directin and a randm pint, accept nly imprving pints x2 x
30 Imprving Hit-and-Run IHR: chse a randm directin and a randm pint, accept nly imprving pints x2 x
31 Imprving Hit-and-Run IHR: chse a randm directin and a randm pint, accept nly imprving pints x2 x
32 Is IHR Efficient in Dimensin? Therem: Fr any elliptical prgram in n dimensins, the expected number f functin evaluatins fr IHR is: O(n 5/2 ) [Zabinsky, Smith, McDnald, Rmeijn and Kaufman, 1993] f(x 1,x 2 ) x 2 x 1 32
33 Is IHR Efficient in Dimensin? Therem: Fr any elliptical prgram in n dimensins, the expected number f functin evaluatins fr IHR is: O(n 5/2 ) [Zabinsky, Smith, McDnald, Rmeijn and Kaufman, 1993] f(x 1,x 2 ) x 2 x 1 33
34 Use Hit-and-Run t Apprximate Annealing Adaptive Search Hide-and-Seek: add a prbabilistic Metrplis acceptance-rejectin criterin t Hit-and-Run t apprximate the Bltzmann distributin [Rmeijn and Smith, 1994] Cnverges in prbability with almst any cling schedule driving temperature t zer AAS Adaptive Cling Schedule: Temperature values accrding t AAS t maintain 1-α prbability f imprvement Update temperature when recrd values are btained [Shen, Kiatsupaibul, Zabinsky and Smith, 2007] 34
35 Research Pssibilities: Hw lng shuld we execute Hit-and-Run at a fixed temperature? What is the benefit f sequential temperatures (warm starts) n cnvergence rate? Hit-and-Run has fast cnvergence n well-runded sets; hw can we mdify transitin kernel in general? Incrprate new Hit-and-Run n mixed integer/cntinuus sets Discrete hit-and-run [Baumert, Ghate, Kiatsupaibul, Shen, Smith and Zabinsky, 2009] Pattern hit-and-run [Mete, Shen, Zabinsky, Kiatsupaibul and Smith, 2010] 35
36 Simulated Annealing with Multi-start: When t Stp r Restart a Run? Use HAS t mdel prgress f a heuristic randm search algrithm and estimate assciated parameters Dynamic Multi-start Sequential Search If current run appears stuck accrding t HAS analysis, stp and restart Estimate prbability f achieving y*+ε based n bserved values and estimated parameters If prbability is high enugh, terminate [Zabinsky, Bulger and Khmpatraprn, 2010] 36
37 Meta-cntrl f Interacting-Particle Algrithm Interacting-Particle Algrithm Cmbines simulated annealing and ppulatin based algrithms Uses statistical physics and Feynman-Kac frmulas t develp selectin prbabilities [Del Mral, Feynman-Kac Frmulae: Genealgical and Interacting Particle Systems with Applicatins, 2004] Meta-cntrl apprach t dynamically heat and cl temperature [Khn, Zabinsky and Brayman, 2006] [Mlvaliglu, Zabinsky and Khn, 2009] 37
38 Meta-cntrl Apprach f(x), S initial parameters Interacting-Particle Algrithm N-Particle Explratin current infrmatin Cntrl System State Estimatin and System Dynamics Perfrmance Criterin N-Particle Selectin ptimal parameter Optimal Cntrl Prblem 38
39 Research Pssibilities Cmbine theretical analyses with MCMC and metacntrl t: Cntrl the explratin transitin prbabilities Obtain stpping criterin and quality f slutin Relate interacting particles t clning/splitting Cmbine theretical analyses and meta-cntrl with mdel-based apprach 39
40 Anther Research Area: Quantum Glbal Optimizatin Grver s Adaptive Search can implement PAS n a quantum cmputer [Baritmpa, Bulger and Wd, 2005] Apply research n quantum cntrl thery t glbal ptimizatin [Gardiner, Handbk f Stchastic Methds fr Physics, Chemistry and the Natural Sciences, 2004] [Del Mral, Feynman-Kac Frmulae: Genealgical and Interacting Particle Systems with Applicatins, 2004] 40
41 Optimizatin f Nisy Functins Use randm sampling t explre the feasible regin and estimate the bjective functin with replicatins Recgnize tw surces f nise: Randmness in the sampling distributin Randmness in the bjective functin Adaptively adjust the number f samples and the number f replicatins 41
42 Nisy Objective Functin f (x) S x 42
43 Nisy Objective Functin f (x) y(δ,s) δ L(δ,S) S x 43
44 Prbabilistic Branch-and-Bund (PBnB) f (x) σ σ 1 2 S x 44
45 Sample N * Unifrm Randm Pints with R * Replicatins f (x) σ σ 1 2 S x 45
46 Use Order Statistics t Assess Range Distributin f (x) σ σ 1 2 S x 46
47 Prune, if Statistically Cnfident f (x) σ σ 1 2 S x 47
48 Subdivide & Sample Additinal Pints f (x) σ 11 σ σ 12 2 S x 48
49 Reassess Range Distributin f (x) σ 11 σ σ 12 2 S x 49
50 If N Pruning, Then Cntinue f (x) σ 11 σ σ 12 2 S x 50
51 PBnB: Numerical Example 51
52 Research Areas Develp thery t tradeff accuracy with cmputatinal effrt Use thery t develp algrithms that give insight int riginal prblem Glbal ptima and sensitivity Shape f the functin r range distributin Use interdisciplinary appraches t incrprate feedback 52
53 Summary Theretical analysis f PAS, HAS, AAS mtivates randm search algrithms Hit-and-Run is a MCMC methd t apprximate theretical perfrmance Meta-cntrl thery allws adaptatin based n bservatins Prbabilistic Branch-and-Bund incrprates nisy functin evaluatins and sampling nise int analysis 53
54 Additinal Slides fr Details n Interacting Particle Algrithm 54
55 Interacting-Particle Algrithm Simulated Annealing: Markv chain Mnte Carl methd fr apprximating a sequence f Bltzmann distributins η t (dx) = S e f (x)/t t e f (y)/t t dy dx Ppulatin-based Algrithms: simulate a distributin (e.g. Feynman-Kac annealing mdel)such that E η t ( f ) y * as t 55
56 Interacting-Particle Algrithm Initializatin: Sample the initial lcatins fr particle i=1,,n frm the distributin Fr t=0,1,., N-particle explratin: Mve particle i=1,,n i i t lcatin with prbability distributin E( y, dyˆ Temperature Parameter Update: T t = (1+ ε t )T t 1, 1 N-particle selectin: Set the particles lcatins k y t +1 ŷ t y k t, i 1,..., +1 = ε t N = ˆ y t i with prbability e f ( ˆ y t i )/T t N e f ( y ˆ tj )/T t j=1 i y 0 η 0 t i t 56 )
57 Illustratin f Interacting-Particle Algrithm 5 ŷ 0 y ŷ y 3 0 ŷ 0 y 0 Initializatin: Sample N=10 pints unifrmly n S N-particle explratin: ŷ y 0 Mve particles frm t using Markv kernel E 5 y 0 6 y 0 9 ŷ 0 7 y 0 10 ŷ 0 2 ŷ 0 7 ŷ 0 8 y ŷ y ŷ 0 10 y 0 S 57
58 Illustratin f Interacting-Particle Algrithm 5 ŷ 0 f yˆ ( 5 0 ) 3 ŷ 0 f ( ˆ 10 ) y 0 4 ŷ 0 f ( yˆ 0 4 ) Initializatin: Sample N=10 pints unifrmly n S N-particle explratin: Mve particles frm t 10 ŷ 0 f ( ˆ 10 ) y 0 ŷ ŷ 0 f yˆ ( 1 0 f ( yˆ 0 2 ) ) 9 ŷ 0 f ( yˆ 0 9 ) 7 ŷ 0 f ( yˆ 0 7 ) using Markv kernel E Evaluate Lwer f (.) f (.) Higher f (.) 8 ŷ0 6 ŷ 0 ( yˆ 0 8 ) f f yˆ ) ( 6 0 S 58
59 Illustratin f Interacting-Particle Algrithm 5 ŷ 0 10 ŷ 0 f yˆ ( 5 0 ) f ( ˆ 10 ) y 0 3 ŷ 0 ŷ ŷ 0 f ( ˆ 10 ) y 0 f yˆ ( 1 0 f ( yˆ 0 2 ) ) 9 ŷ 0 4 ŷ 0 f ( yˆ ŷ0 6 ŷ 0 ( yˆ 0 8 ) f ( yˆ ŷ 0 f f yˆ ) ) ( 6 0 ) S Initializatin: Sample N=10 pints unifrmly n S N-particle explratin: Mve particles frm using Markv kernel E Evaluate Lwer f (.) f (.) t f ( yˆ 0 7 ) N-particle selectin: Mve particles frm Higher f (.) t accrding t their bjective functin values 59
60 Illustratin f Interacting-Particle Algrithm y y1,, y y 1 Initializatin: Sample N=10 pints unifrmly n S N-particle explratin: Mve particles frm using Markv kernel E Evaluate f (.) t Lwer f (.) Higher f (.) y y1, y1,, y 6 y 1, y S N-particle selectin: Mve particles frm t accrding t their bjective functin values 60
61 Multi-start r Ppulatin-based Algrithms Multi-start and clustering algrithms [Rinny Kan and Timmer, 1987] [Lcatelli and Schen, 1999] Genetic algrithms [Davis, 1991] Evlutinary prgramming [Bäck, Fgel and Michalewicz, 1997] Particle swarm ptimizatin [Kennedy, Eberhart and Shi, 2001] Interacting particle algrithm [del Mral, 2004] 61
Chapter 3: Cluster Analysis
Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA
More informationPure adaptive search for finite global optimization*
Mathematical Prgramming 69 (1995) 443-448 Pure adaptive search fr finite glbal ptimizatin* Z.B. Zabinskya.*, G.R. Wd b, M.A. Steel c, W.P. Baritmpa c a Industrial Engineering Prgram, FU-20. University
More informationk-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels
Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationThe blessing of dimensionality for kernel methods
fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented
More informationSupport-Vector Machines
Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material
More informationthe results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must
M.E. Aggune, M.J. Dambrg, M.A. El-Sharkawi, R.J. Marks II and L.E. Atlas, "Dynamic and static security assessment f pwer systems using artificial neural netwrks", Prceedings f the NSF Wrkshp n Applicatins
More informationLyapunov Stability Stability of Equilibrium Points
Lyapunv Stability Stability f Equilibrium Pints 1. Stability f Equilibrium Pints - Definitins In this sectin we cnsider n-th rder nnlinear time varying cntinuus time (C) systems f the frm x = f ( t, x),
More informationCOMP 551 Applied Machine Learning Lecture 11: Support Vector Machines
COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse
More informationDistributions, spatial statistics and a Bayesian perspective
Distributins, spatial statistics and a Bayesian perspective Dug Nychka Natinal Center fr Atmspheric Research Distributins and densities Cnditinal distributins and Bayes Thm Bivariate nrmal Spatial statistics
More informationResampling Methods. Cross-validation, Bootstrapping. Marek Petrik 2/21/2017
Resampling Methds Crss-validatin, Btstrapping Marek Petrik 2/21/2017 Sme f the figures in this presentatin are taken frm An Intrductin t Statistical Learning, with applicatins in R (Springer, 2013) with
More informationLeast Squares Optimal Filtering with Multirate Observations
Prc. 36th Asilmar Cnf. n Signals, Systems, and Cmputers, Pacific Grve, CA, Nvember 2002 Least Squares Optimal Filtering with Multirate Observatins Charles W. herrien and Anthny H. Hawes Department f Electrical
More informationOnline Model Racing based on Extreme Performance
Online Mdel Racing based n Extreme Perfrmance Tiantian Zhang, Michael Gergipuls, Gergis Anagnstpuls Electrical & Cmputer Engineering University f Central Flrida Overview Racing Algrithm Offline vs Online
More informationChecking the resolved resonance region in EXFOR database
Checking the reslved resnance regin in EXFOR database Gttfried Bertn Sciété de Calcul Mathématique (SCM) Oscar Cabells OECD/NEA Data Bank JEFF Meetings - Sessin JEFF Experiments Nvember 0-4, 017 Bulgne-Billancurt,
More informationDetermining the Accuracy of Modal Parameter Estimation Methods
Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system
More informationResampling Methods. Chapter 5. Chapter 5 1 / 52
Resampling Methds Chapter 5 Chapter 5 1 / 52 1 51 Validatin set apprach 2 52 Crss validatin 3 53 Btstrap Chapter 5 2 / 52 Abut Resampling An imprtant statistical tl Pretending the data as ppulatin and
More informationElements of Machine Intelligence - I
ECE-175A Elements f Machine Intelligence - I Ken Kreutz-Delgad Nun Vascncels ECE Department, UCSD Winter 2011 The curse The curse will cver basic, but imprtant, aspects f machine learning and pattern recgnitin
More informationModelling of Clock Behaviour. Don Percival. Applied Physics Laboratory University of Washington Seattle, Washington, USA
Mdelling f Clck Behaviur Dn Percival Applied Physics Labratry University f Washingtn Seattle, Washingtn, USA verheads and paper fr talk available at http://faculty.washingtn.edu/dbp/talks.html 1 Overview
More informationT Algorithmic methods for data mining. Slide set 6: dimensionality reduction
T-61.5060 Algrithmic methds fr data mining Slide set 6: dimensinality reductin reading assignment LRU bk: 11.1 11.3 PCA tutrial in mycurses (ptinal) ptinal: An Elementary Prf f a Therem f Jhnsn and Lindenstrauss,
More informationinitially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur
Cdewrd Distributin fr Frequency Sensitive Cmpetitive Learning with One Dimensinal Input Data Aristides S. Galanpuls and Stanley C. Ahalt Department f Electrical Engineering The Ohi State University Abstract
More informationA Scalable Recurrent Neural Network Framework for Model-free
A Scalable Recurrent Neural Netwrk Framewrk fr Mdel-free POMDPs April 3, 2007 Zhenzhen Liu, Itamar Elhanany Machine Intelligence Lab Department f Electrical and Cmputer Engineering The University f Tennessee
More informationCAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank
CAUSAL INFERENCE Technical Track Sessin I Phillippe Leite The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Phillippe Leite fr the purpse f this wrkshp Plicy questins are causal
More informationMidwest Big Data Summer School: Machine Learning I: Introduction. Kris De Brabanter
Midwest Big Data Summer Schl: Machine Learning I: Intrductin Kris De Brabanter kbrabant@iastate.edu Iwa State University Department f Statistics Department f Cmputer Science June 24, 2016 1/24 Outline
More informationStatistics, Numerical Models and Ensembles
Statistics, Numerical Mdels and Ensembles Duglas Nychka, Reinhard Furrer,, Dan Cley Claudia Tebaldi, Linda Mearns, Jerry Meehl and Richard Smith (UNC). Spatial predictin and data assimilatin Precipitatin
More informationLecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff
Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised
More informationTree Structured Classifier
Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients
More informationLecture 2: Supervised vs. unsupervised learning, bias-variance tradeoff
Lecture 2: Supervised vs. unsupervised learning, bias-variance tradeff Reading: Chapter 2 STATS 202: Data mining and analysis September 27, 2017 1 / 20 Supervised vs. unsupervised learning In unsupervised
More informationCN700 Additive Models and Trees Chapter 9: Hastie et al. (2001)
CN700 Additive Mdels and Trees Chapter 9: Hastie et al. (2001) Madhusudana Shashanka Department f Cgnitive and Neural Systems Bstn University CN700 - Additive Mdels and Trees March 02, 2004 p.1/34 Overview
More informationAdmin. MDP Search Trees. Optimal Quantities. Reinforcement Learning
Admin Reinfrcement Learning Cntent adapted frm Berkeley CS188 MDP Search Trees Each MDP state prjects an expectimax-like search tree Optimal Quantities The value (utility) f a state s: V*(s) = expected
More informationMultiyear and Multi-Criteria AC Transmission Expansion Planning Model Considering Reliability and Investment Costs
Multiyear Multi-Criteria AC Transmissin Expansin Planning Mdel Cnsidering Reliability Investment Csts Phillipe Vilaça mes, Jã Pedr ilva Jã Tmé araiva INEC TEC FEUP/EEC ept. Eng. Eletrtécnica e de Cmputadres
More informationENSC Discrete Time Systems. Project Outline. Semester
ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding
More informationCOMP 551 Applied Machine Learning Lecture 4: Linear classification
COMP 551 Applied Machine Learning Lecture 4: Linear classificatin Instructr: Jelle Pineau (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted
More informationSequential Allocation with Minimal Switching
In Cmputing Science and Statistics 28 (1996), pp. 567 572 Sequential Allcatin with Minimal Switching Quentin F. Stut 1 Janis Hardwick 1 EECS Dept., University f Michigan Statistics Dept., Purdue University
More informationSlide04 (supplemental) Haykin Chapter 4 (both 2nd and 3rd ed): Multi-Layer Perceptrons
Slide04 supplemental) Haykin Chapter 4 bth 2nd and 3rd ed): Multi-Layer Perceptrns CPSC 636-600 Instructr: Ynsuck Che Heuristic fr Making Backprp Perfrm Better 1. Sequential vs. batch update: fr large
More informationQuantization. Quantization is the realization of the lossy part of source coding Typically allows for a trade-off between signal fidelity and bit rate
Quantizatin Quantizatin is the realizatin f the lssy part f surce cding Typically allws fr a trade-ff between signal fidelity and bit rate s! s! Quantizer Quantizatin is a functinal mapping f a (cntinuus
More informationOn Huntsberger Type Shrinkage Estimator for the Mean of Normal Distribution ABSTRACT INTRODUCTION
Malaysian Jurnal f Mathematical Sciences 4(): 7-4 () On Huntsberger Type Shrinkage Estimatr fr the Mean f Nrmal Distributin Department f Mathematical and Physical Sciences, University f Nizwa, Sultanate
More informationSimple Linear Regression (single variable)
Simple Linear Regressin (single variable) Intrductin t Machine Learning Marek Petrik January 31, 2017 Sme f the figures in this presentatin are taken frm An Intrductin t Statistical Learning, with applicatins
More informationMATCHING TECHNIQUES. Technical Track Session VI. Emanuela Galasso. The World Bank
MATCHING TECHNIQUES Technical Track Sessin VI Emanuela Galass The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Emanuela Galass fr the purpse f this wrkshp When can we use
More informationDetermining Optimum Path in Synthesis of Organic Compounds using Branch and Bound Algorithm
Determining Optimum Path in Synthesis f Organic Cmpunds using Branch and Bund Algrithm Diastuti Utami 13514071 Prgram Studi Teknik Infrmatika Seklah Teknik Elektr dan Infrmatika Institut Teknlgi Bandung,
More informationEdinburgh Research Explorer
Edinburgh Research Explrer Supprting User-Defined Functins n Uncertain Data Citatin fr published versin: Tran, TTL, Dia, Y, Suttn, CA & Liu, A 23, 'Supprting User-Defined Functins n Uncertain Data' Prceedings
More informationReinforcement Learning" CMPSCI 383 Nov 29, 2011!
Reinfrcement Learning" CMPSCI 383 Nv 29, 2011! 1 Tdayʼs lecture" Review f Chapter 17: Making Cmple Decisins! Sequential decisin prblems! The mtivatin and advantages f reinfrcement learning.! Passive learning!
More informationMultiobjective Evolutionary Optimization
Multibjective Evlutinary Optimizatin Pressr Qingu ZHANG Schl Cmputer Science and Electrnic Engineering University Essex CO4 3SQ, Clchester UK Outline Multibjective Optimisatin Paret Dminance Based Algrithms
More informationEric Klein and Ning Sa
Week 12. Statistical Appraches t Netwrks: p1 and p* Wasserman and Faust Chapter 15: Statistical Analysis f Single Relatinal Netwrks There are fur tasks in psitinal analysis: 1) Define Equivalence 2) Measure
More informationSection 5.8 Notes Page Exponential Growth and Decay Models; Newton s Law
Sectin 5.8 Ntes Page 1 5.8 Expnential Grwth and Decay Mdels; Newtn s Law There are many applicatins t expnential functins that we will fcus n in this sectin. First let s lk at the expnential mdel. Expnential
More informationA New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation
III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.
More informationLocalized Model Selection for Regression
Lcalized Mdel Selectin fr Regressin Yuhng Yang Schl f Statistics University f Minnesta Church Street S.E. Minneaplis, MN 5555 May 7, 007 Abstract Research n mdel/prcedure selectin has fcused n selecting
More informationMath Foundations 20 Work Plan
Math Fundatins 20 Wrk Plan Units / Tpics 20.8 Demnstrate understanding f systems f linear inequalities in tw variables. Time Frame December 1-3 weeks 6-10 Majr Learning Indicatrs Identify situatins relevant
More informationMargin Distribution and Learning Algorithms
ICML 03 Margin Distributin and Learning Algrithms Ashutsh Garg IBM Almaden Research Center, San Jse, CA 9513 USA Dan Rth Department f Cmputer Science, University f Illinis, Urbana, IL 61801 USA ASHUTOSH@US.IBM.COM
More informationSupplementary Crossover Operator for Genetic Algorithms based on the Center-of-Gravity Paradigm
Published in Cntrl and Cybernetics, vl. 30, N, 00, pp. 59-76, ISSN: 034-8569 Supplementary Crssver Operatr fr Genetic Algrithms based n the Center-f-Gravity Paradigm Plamen Angelv Department f Civil and
More informationLinear programming III
Linear prgramming III Review 1/33 What have cvered in previus tw classes LP prblem setup: linear bjective functin, linear cnstraints. exist extreme pint ptimal slutin. Simplex methd: g thrugh extreme pint
More informationA Novel Stochastic-Based Algorithm for Terrain Splitting Optimization Problem
A Nvel Stchastic-Based Algrithm fr Terrain Splitting Optimizatin Prblem Le Hang Sn Nguyen inh Ha Abstract This paper deals with the prblem f displaying large igital Elevatin Mdel data in 3 GIS urrent appraches
More informationPart 3 Introduction to statistical classification techniques
Part 3 Intrductin t statistical classificatin techniques Machine Learning, Part 3, March 07 Fabi Rli Preamble ØIn Part we have seen that if we knw: Psterir prbabilities P(ω i / ) Or the equivalent terms
More informationCOMP9414/ 9814/ 3411: Artificial Intelligence. 14. Course Review. COMP3411 c UNSW, 2014
COMP9414/ 9814/ 3411: Artificial Intelligence 14. Curse Review COMP9414/9814/3411 14s1 Review 1 Assessment Assessable cmpnents f the curse: Assignment 1 10% Assignment 2 8% Assignment 3 12% Written Eam
More informationLecture 13: Markov Chain Monte Carlo. Gibbs sampling
Lecture 13: Markv hain Mnte arl Gibbs sampling Gibbs sampling Markv chains 1 Recall: Apprximate inference using samples Main idea: we generate samples frm ur Bayes net, then cmpute prbabilities using (weighted)
More informationSimulation Based Optimal Design
BAYESIAN STATISTICS 6, pp. 000 000 J. M. Bernard, J. O. Berger, A. P. Dawid and A. F. M. Smith (Eds.) Oxfrd University Press, 1998 Simulatin Based Optimal Design PETER MULLER Duke University SUMMARY We
More informationNUMBERS, MATHEMATICS AND EQUATIONS
AUSTRALIAN CURRICULUM PHYSICS GETTING STARTED WITH PHYSICS NUMBERS, MATHEMATICS AND EQUATIONS An integral part t the understanding f ur physical wrld is the use f mathematical mdels which can be used t
More informationEDA Engineering Design & Analysis Ltd
EDA Engineering Design & Analysis Ltd THE FINITE ELEMENT METHOD A shrt tutrial giving an verview f the histry, thery and applicatin f the finite element methd. Intrductin Value f FEM Applicatins Elements
More informationReview of Simulation Approaches in Reliability and Availability Modeling
Internatinal Jurnal f Perfrmability Engineering, Vl. 12, N. 4, July 2016, pp. 369-388 Ttem Publisher, Inc., 4625 Stargazer Dr., Plan, Texas 75024, U.S.A Review f Simulatin Appraches in Reliability and
More informationBLAST / HIDDEN MARKOV MODELS
CS262 (Winter 2015) Lecture 5 (January 20) Scribe: Kat Gregry BLAST / HIDDEN MARKOV MODELS BLAST CONTINUED HEURISTIC LOCAL ALIGNMENT Use Cmmnly used t search vast bilgical databases (n the rder f terabases/tetrabases)
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationParticle Size Distributions from SANS Data Using the Maximum Entropy Method. By J. A. POTTON, G. J. DANIELL AND B. D. RAINFORD
3 J. Appl. Cryst. (1988). 21,3-8 Particle Size Distributins frm SANS Data Using the Maximum Entrpy Methd By J. A. PTTN, G. J. DANIELL AND B. D. RAINFRD Physics Department, The University, Suthamptn S9
More informationMethods for Determination of Mean Speckle Size in Simulated Speckle Pattern
0.478/msr-04-004 MEASUREMENT SCENCE REVEW, Vlume 4, N. 3, 04 Methds fr Determinatin f Mean Speckle Size in Simulated Speckle Pattern. Hamarvá, P. Šmíd, P. Hrváth, M. Hrabvský nstitute f Physics f the Academy
More informationTime, Synchronization, and Wireless Sensor Networks
Time, Synchrnizatin, and Wireless Sensr Netwrks Part II Ted Herman University f Iwa Ted Herman/March 2005 1 Presentatin: Part II metrics and techniques single-hp beacns reginal time znes ruting-structure
More informationNumerical Simulation of the Thermal Resposne Test Within the Comsol Multiphysics Environment
Presented at the COMSOL Cnference 2008 Hannver University f Parma Department f Industrial Engineering Numerical Simulatin f the Thermal Respsne Test Within the Cmsl Multiphysics Envirnment Authr : C. Crradi,
More informationAgenda. What is Machine Learning? Learning Type of Learning: Supervised, Unsupervised and semi supervised Classification
Agenda Artificial Intelligence and its applicatins Lecture 6 Supervised Learning Prfessr Daniel Yeung danyeung@ieee.rg Dr. Patrick Chan patrickchan@ieee.rg Suth China University f Technlgy, China Learning
More informationWhat is Statistical Learning?
What is Statistical Learning? Sales 5 10 15 20 25 Sales 5 10 15 20 25 Sales 5 10 15 20 25 0 50 100 200 300 TV 0 10 20 30 40 50 Radi 0 20 40 60 80 100 Newspaper Shwn are Sales vs TV, Radi and Newspaper,
More informationFunctional Form and Nonlinearities
Sectin 6 Functinal Frm and Nnlinearities This is a gd place t remind urselves f Assumptin #0: That all bservatins fllw the same mdel. Levels f measurement and kinds f variables There are (at least) three
More informationCHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS
CHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS 1 Influential bservatins are bservatins whse presence in the data can have a distrting effect n the parameter estimates and pssibly the entire analysis,
More information3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression
3.3.4 Prstate Cancer Data Example (Cntinued) 3.4 Shrinkage Methds 61 Table 3.3 shws the cefficients frm a number f different selectin and shrinkage methds. They are best-subset selectin using an all-subsets
More informationAdaptive Large Neighborhood Search (ALNS)
Aaptive Large Neighbrh Search (ALNS) Cnsier a general integer prgramming prblem Min x X Z n f ( x) n where X R. Aaptive Large Neighbrh Search i lcal search prceure ( ALNS ) Lcal search prceure: Simulate
More informationPSU GISPOPSCI June 2011 Ordinary Least Squares & Spatial Linear Regression in GeoDa
There are tw parts t this lab. The first is intended t demnstrate hw t request and interpret the spatial diagnstics f a standard OLS regressin mdel using GeDa. The diagnstics prvide infrmatin abut the
More informationon Neural Networks The Proceedings of the Title Page Copyright Welcome Committees Schedule Summary Conference Program Author Index CD-ROM Help Search
The Prceedings f the Title Page IJCNN 2003 Internatinal Jint Cnference n Neural Netwrks Cpyright Welcme Cmmittees Schedule Summary Cnference Prgram Authr Index The Internatinal Neural Netwrk Sciety Dubletree
More informationDESIGN OPTIMIZATION OF HIGH-LIFT CONFIGURATIONS USING A VISCOUS ADJOINT-BASED METHOD
DESIGN OPTIMIZATION OF HIGH-LIFT CONFIGURATIONS USING A VISCOUS ADJOINT-BASED METHOD Sangh Kim Stanfrd University Juan J. Alns Stanfrd University Antny Jamesn Stanfrd University 40th AIAA Aerspace Sciences
More informationSAMPLING DYNAMICAL SYSTEMS
SAMPLING DYNAMICAL SYSTEMS Melvin J. Hinich Applied Research Labratries The University f Texas at Austin Austin, TX 78713-8029, USA (512) 835-3278 (Vice) 835-3259 (Fax) hinich@mail.la.utexas.edu ABSTRACT
More informationOptimization Programming Problems For Control And Management Of Bacterial Disease With Two Stage Growth/Spread Among Plants
Internatinal Jurnal f Engineering Science Inventin ISSN (Online): 9 67, ISSN (Print): 9 676 www.ijesi.rg Vlume 5 Issue 8 ugust 06 PP.0-07 Optimizatin Prgramming Prblems Fr Cntrl nd Management Of Bacterial
More informationStats Classification Ji Zhu, Michigan Statistics 1. Classification. Ji Zhu 445C West Hall
Stats 415 - Classificatin Ji Zhu, Michigan Statistics 1 Classificatin Ji Zhu 445C West Hall 734-936-2577 jizhu@umich.edu Stats 415 - Classificatin Ji Zhu, Michigan Statistics 2 Examples f Classificatin
More informationThe general linear model and Statistical Parametric Mapping I: Introduction to the GLM
The general linear mdel and Statistical Parametric Mapping I: Intrductin t the GLM Alexa Mrcm and Stefan Kiebel, Rik Hensn, Andrew Hlmes & J-B J Pline Overview Intrductin Essential cncepts Mdelling Design
More informationThe Solution Path of the Slab Support Vector Machine
CCCG 2008, Mntréal, Québec, August 3 5, 2008 The Slutin Path f the Slab Supprt Vectr Machine Michael Eigensatz Jachim Giesen Madhusudan Manjunath Abstract Given a set f pints in a Hilbert space that can
More informationFebruary 28, 2013 COMMENTS ON DIFFUSION, DIFFUSIVITY AND DERIVATION OF HYPERBOLIC EQUATIONS DESCRIBING THE DIFFUSION PHENOMENA
February 28, 2013 COMMENTS ON DIFFUSION, DIFFUSIVITY AND DERIVATION OF HYPERBOLIC EQUATIONS DESCRIBING THE DIFFUSION PHENOMENA Mental Experiment regarding 1D randm walk Cnsider a cntainer f gas in thermal
More informationDataflow Analysis and Abstract Interpretation
Dataflw Analysis and Abstract Interpretatin Cmputer Science and Artificial Intelligence Labratry MIT Nvember 9, 2015 Recap Last time we develped frm first principles an algrithm t derive invariants. Key
More informationAP Statistics Notes Unit Two: The Normal Distributions
AP Statistics Ntes Unit Tw: The Nrmal Distributins Syllabus Objectives: 1.5 The student will summarize distributins f data measuring the psitin using quartiles, percentiles, and standardized scres (z-scres).
More informationLinear Classification
Linear Classificatin CS 54: Machine Learning Slides adapted frm Lee Cper, Jydeep Ghsh, and Sham Kakade Review: Linear Regressin CS 54 [Spring 07] - H Regressin Given an input vectr x T = (x, x,, xp), we
More informationMATCHING TECHNIQUES Technical Track Session VI Céline Ferré The World Bank
MATCHING TECHNIQUES Technical Track Sessin VI Céline Ferré The Wrld Bank When can we use matching? What if the assignment t the treatment is nt dne randmly r based n an eligibility index, but n the basis
More informationChapter 4. Unsteady State Conduction
Chapter 4 Unsteady State Cnductin Chapter 5 Steady State Cnductin Chee 318 1 4-1 Intrductin ransient Cnductin Many heat transfer prblems are time dependent Changes in perating cnditins in a system cause
More informationGMM with Latent Variables
GMM with Latent Variables A. Rnald Gallant Penn State University Raffaella Giacmini University Cllege Lndn Giuseppe Ragusa Luiss University Cntributin The cntributin f GMM (Hansen and Singletn, 1982) was
More informationUNIV1"'RSITY OF NORTH CAROLINA Department of Statistics Chapel Hill, N. C. CUMULATIVE SUM CONTROL CHARTS FOR THE FOLDED NORMAL DISTRIBUTION
UNIV1"'RSITY OF NORTH CAROLINA Department f Statistics Chapel Hill, N. C. CUMULATIVE SUM CONTROL CHARTS FOR THE FOLDED NORMAL DISTRIBUTION by N. L. Jlmsn December 1962 Grant N. AFOSR -62..148 Methds f
More informationIAML: Support Vector Machines
1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int
More informationEcology 302 Lecture III. Exponential Growth (Gotelli, Chapter 1; Ricklefs, Chapter 11, pp )
Eclgy 302 Lecture III. Expnential Grwth (Gtelli, Chapter 1; Ricklefs, Chapter 11, pp. 222-227) Apcalypse nw. The Santa Ana Watershed Prject Authrity pulls n punches in prtraying its missin in apcalyptic
More informationPerformance Comparison of Nonlinear Filters for Indoor WLAN Positioning
Perfrmance Cmparisn f Nnlinear Filters fr Indr WLAN Psitining Hui Wang Andrei Szab Jachim Bamberger Learning Systems Infrmatin and Cmmunicatins Crprate Technlgy Siemens AG Munich Germany Email: {hui.wang.ext.andrei.szab.jachim.bamberger}@siemens.cm
More informationSmoothing, penalized least squares and splines
Smthing, penalized least squares and splines Duglas Nychka, www.image.ucar.edu/~nychka Lcally weighted averages Penalized least squares smthers Prperties f smthers Splines and Reprducing Kernels The interplatin
More informationPerformance Bounds for Detect and Avoid Signal Sensing
Perfrmance unds fr Detect and Avid Signal Sensing Sam Reisenfeld Real-ime Infrmatin etwrks, University f echnlgy, Sydney, radway, SW 007, Australia samr@uts.edu.au Abstract Detect and Avid (DAA) is a Cgnitive
More informationTuring Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement:
Turing Machines Human-aware Rbtics 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Annuncement: q q q q Slides fr this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/tm-ii.pdf
More informationx 1 Outline IAML: Logistic Regression Decision Boundaries Example Data
Outline IAML: Lgistic Regressin Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester Lgistic functin Lgistic regressin Learning lgistic regressin Optimizatin The pwer f nn-linear basis functins Least-squares
More informationCOMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)
COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise
More informationSupport Vector Machines and Flexible Discriminants
12 Supprt Vectr Machines and Flexible Discriminants This is page 417 Printer: Opaque this 12.1 Intrductin In this chapter we describe generalizatins f linear decisin bundaries fr classificatin. Optimal
More informationIn SMV I. IAML: Support Vector Machines II. This Time. The SVM optimization problem. We saw:
In SMV I IAML: Supprt Vectr Machines II Nigel Gddard Schl f Infrmatics Semester 1 We sa: Ma margin trick Gemetry f the margin and h t cmpute it Finding the ma margin hyperplane using a cnstrained ptimizatin
More informationG3.6 The Evolutionary Planner/Navigator in a mobile robot environment
Engineering G3.6 The Evlutinary Planner/Navigatr in a mbile rbt envirnment Jing Xia Abstract Based n evlutinary cmputatin cncepts, the Evlutinary Planner/Navigatr (EP/N) represents a new apprach t path
More informationIEEE Int. Conf. Evolutionary Computation, Nagoya, Japan, May 1996, pp. 366{ Evolutionary Planner/Navigator: Operator Performance and
IEEE Int. Cnf. Evlutinary Cmputatin, Nagya, Japan, May 1996, pp. 366{371. 1 Evlutinary Planner/Navigatr: Operatr Perfrmance and Self-Tuning Jing Xia, Zbigniew Michalewicz, and Lixin Zhang Cmputer Science
More informationCombining Dialectical Optimization and Gradient Descent Methods for Improving the Accuracy of Straight Line Segment Classifiers
Cmbining Dialectical Optimizatin and Gradient Descent Methds fr Imprving the Accuracy f Straight Line Segment Classifiers Rsari A. Medina Rdriguez and Rnald Fumi Hashimt University f Sa Paul Institute
More information