Toto je starší verze dokumentu!


Symbolické strojové učení

  • Stránky předmětu: Symbolické strojové učení
  • Přednášející: Jiří Kléma, Filip Železný
  • Cvičící: Jáchym Barvínek, Ondřej Hubáček, Petr Ryšavý, Martin Svatoš

Cvičení

Zkouška

06.06.2018

- (5 pnts) Difference between PAC-learning agent and mistake-bound agent. What does it mean when an agent in both frameworks learns? What is it learns efficiently? Online?

- (10 pnts) Space-version agent. There are given two agent with different hypotheses spaces. First is all possible 3-conjunctions (non-negative) of n variables. Second is all n-conjunctions of positive and negative literals. For each agent: does it learn online? does it learn efficiently? For the first agent: given the first negative observation (0,1,1,1,…,1), what will be the agent's decision on the next observation (0,1,0,1,…)?

- (15 pnts) Relative Least General Generalization (rlgg). Given background knowledge B = {half(4,2), half(2,1), int(2), int(1)}. What will be the rlgg of o1 = even(4) and o2 = even(2) relative to the background? Apply algorithm, draw tables, theta functions. Make a reduction step relative to B. Why is it needed?

- (10 pnts) Bayesian networks.

- (5 pnts) Q-learning. Given 5 small questions, response True/False and provide your reasoning.

- (5 pnts) Q-learning representation. Describe states, actions, rewards.

courses/b4m36smu.1528292018.txt.gz · Poslední úprava: 2025/01/03 18:16 (upraveno mimo DokuWiki)
Nahoru
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0