Главная
Study mode:
on
1
Intro
2
Outline
3
Declarative ML
4
Idea of Model-Theoretic Framework
5
Example 1 (cont d)
6
Example 2
7
Formal Framework For simplicity, we only consider Boolean classification problems
8
Learning as Minimisation
9
Remarks on VC-Dimension and PAC-Learning
10
Computation Model
11
Complexity Considerations
12
Proof
13
Strings as Background Structures
14
Learning with Local Access
15
Monadic Second-Order Logic
16
Building an Index
17
Factorisation Trees as Index Data Structures
18
Learning MSO
19
Pre-Processing
20
Learning Phase 1
21
Open Problems
Description:
Explore a declarative framework for machine learning in this 45-minute lecture by Martin Grohe from RWTH Aachen University, presented at the Alan Turing Institute. Dive into the concept of logically defined hypotheses, examining both positive and negative learnability results for hypothesis classes defined in first-order and monadic second-order logic. Discover how this theoretical framework could potentially serve as a foundation for declarative approaches to machine learning in logic-oriented fields such as database systems and automated verification. Gain insights into the combination of formal reasoning offered by logic and the power of learning, as part of a workshop aimed at bringing together expertise from various areas to explore the opportunities presented by this intersection.

Learning Logically Defined Hypotheses - Martin Grohe, RWTH Aachen University

Alan Turing Institute
Add to list
0:00 / 0:00