本次中期考试涵盖了搜索、博弈、合同满足、逻辑等多个主题，涉及MDP、决策树、神经网络和贝叶斯网络等内容。重点考察了贝叶斯定理的应用，条件概率，无监督学习中的kNN算法，以及Markov决策过程（MDP）的理解，包括其与部分可观测MDP（POMDP）的区别。还涉及到决策树的构建，神经网络的学习机制，以及近似最优化算法如Q-Learning。
Outline
60% midterm2 后 + 40%midterm2 前，search+game playing+contract satisfaction+logic
MDP+DT+NN+BN
试卷
-
A preference relation admits a utility function representation if it is complete, transitive, and continuous.
-
2.1prior probability: (is the probability of an event before new data is collected. This is the best rational assessment of the probability of an outcome based on the current knowledge before an experiment is performed.)
2.2Posterior probability is the revised probability of an event occurring after taking into consideration new information. Posterior probability is calculated by updating the prior probability by using Bayes’ theorem. => Bayes’ Theorem converts a prior belief into a posterior belief after you’ve collected some additional evidence. Bayes’ theorem thus gives the probability of an event based on new information that is, or may be related, to that event.
-
Conditional probability is the likelihood of an outcome occurring, based on a previous outcome occurring
-
So kNN is an exception to general workflow for building/testing supervised machine learning models. In particular, the model created via kNN is just the available labeled data, placed in some metric space.
In other words, for kNN, there is no training step because there is no model to build.
5.The minimax algorithm can be considered to be solving a determi
最低0.47元/天 解锁文章
102
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
