Introduction to Machine Learning - 北大计算机研究所.pptVIP

Explain intuitively! Successor: after two moves. How to compute Successor(b)? Meaning under Bayesian learning setting LMS: viewed as stochastic gradient-descent search Such weight update rule can be proven to converge to least-square-error approximation to Vtrain(b) * *: This slide is from a presentation by Jaime Carbonell et al. in April 2007. Source of the image：/Infotech/20243/ See “The Discipline of Machine Learning” by Tom Mitchell 舆情分析 Tell a story about Bioinformatics How to Define Target Function V? If b is a final board state, then it is simple: If b is won, V(b)=100 (or other big number) If b is lost, V(b)=-100 If b is draw, V(b)=0 * How to Define Target Function V ?(2) Otherwise, it is tough! We might define V(b)=V(b’), where b’ is the best final state that can be achieved starting from b and playing optimally until end of the program. However, such definition is not operational! * Remaining Issues What knowledge to be learned? How to represent this knowledge? What algorithm used to learn the knowledge (learning mechanism)? * Choose a Representation of V A tradeoff between the expressiveness of V and demand for training data Let us consider a simple representation ? of V: a linear combination of following board states: x1: #black pieces on the board x2: #red pieces x3: #black kings x4: #red kings x5: #black pieces threatened by red (i.e. which can be captured on red’s next move) x6: #red pieces threatened by black (i.e. which can be captured on black’s next move) * A Simple Representation of V * Remaining Issues What knowledge to be learned? How to represent this knowledge? What algorithm used to learn the knowledge (learning mechanism)? * Choose an Approximation Algorithm Choose a set of training examples (b, Vtrain(b)) Estimate Vtrain(b) For some board state, it is obvious, e.g. Vtrain(b)=100 if x2=0 (assuming the learning program plays black). Only indirect training examples are available. One common approach is via iteration, such as Vtra