[ИАД, весна 2026] Введение в машинное обучение. Лекция 9: Логические методы машинного обучения

[ИАД, весна 2026] Введение в машинное обучение. Лекция 9: Логические методы машинного обучения

🎙 Machine Learning – Intelligent Systems 👥 8K 📅 April 16, 2026 ⏱ 97 min 👁 145 📄 lecture 🧭 2026-08-16
Available in: English (current) Français

Keywords

logical methodsrule inductioninterpretabilityBongarddecision trees

Summary

This lecture, part of a series on machine learning schools, focuses on logical methods (symbolism). The presenter begins by situating logical methods within the five schools of machine learning, emphasizing their renewed importance due to interpretability and explainability in AI. He discusses the trade-off between interpretability and accuracy, positioning rule-based models and decision trees in the lower-right corner of the interpretability-accuracy plane. A historical overview highlights the work of Mikhail Bongard, a Soviet scientist who developed early pattern recognition algorithms and the famous ‘Bongard problems’—100 hand-drawn puzzles that illustrate fundamental concepts in feature extraction, selection, and rule induction. The lecture formalizes the notion of logical patterns (rules) as predicates with two key properties: interpretability (simplicity, dependence on few features) and informativeness (high coverage of positive examples, low error rate). The presenter outlines a four-step process for rule induction: defining the rule form (typically conjunctions), generating candidate rules, evaluating their informativeness (e.g., via precision or other metrics), and combining rules into a classifier via weighted voting. He also discusses the concept of syndromes (disjunctions of conjunctions) and the importance of avoiding overfitting, referencing the bias-variance trade-off and regularization. The lecture concludes with a brief mention of decision trees as another class of logical methods, to be covered in more detail in subsequent lectures.

212 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides substantial value by bridging historical foundations with modern relevance. The presenter effectively argues for the importance of interpretable models in the context of trustworthy AI, using concrete examples from medicine and credit scoring. The argumentation is solid, built on formal definitions and a clear logical progression. The use of Bongard’s problems as illustrative examples is particularly effective in conveying abstract concepts like feature extraction and rule selection. The presenter also addresses the fundamental issue of multiple equally valid rules on a given dataset, linking it to regularization and ill-posed problems. The discussion is well-structured and technically sound, though it remains at an introductory level, avoiding deep mathematical derivations.

Scientific Rigor, Source Quality, Title Accuracy

The lecture demonstrates scientific rigor through its historical accuracy and formal definitions. The presenter references key works, such as Pedro Domingos’ ‘The Master Algorithm’ and Bongard’s book ‘Pattern Recognition’, without providing explicit citations or URLs. The quality of sources is high, but the lack of direct references in the description limits verifiability. The title accurately reflects the content, and the lecture stays on-topic throughout. The presenter’s expertise is evident, and the content aligns with established knowledge in the field. However, the absence of peer-reviewed sources and the reliance on historical anecdotes slightly reduce the overall scientific rigor.

223 words

Title / Content Match

The title accurately reflects the content: a lecture on logical methods in machine learning, part of a series on machine learning schools.

Quality & Reliability

8/10

The lecture is well-structured, historically grounded, and technically accurate, with clear formal definitions and references to established concepts (e.g., Bongard's tests, rule induction). The presenter demonstrates deep expertise, though the content is not peer-reviewed and represents a pedagogical perspective.

Key Moments

Cited Sources

  • The Master Algorithm — Referenced as the source for the five schools of machine learning.
  • Bongard's book 'Pattern Recognition' — Mentioned as the source of the 100 Bongard problems and early insights into overfitting.

Concurring Sources

  • The Master Algorithm — Pedro Domingos' book, which the lecturer references for the taxonomy of machine learning schools.
  • Bongard's book 'Pattern Recognition' — Mikhail Bongard's book, which contains the 100 problems and early discussions on overfitting.

Contribution & Novelties

The lecture provides a unique historical perspective on logical methods in machine learning, highlighting the often-overlooked contributions of Soviet scientists like Mikhail Bongard. It effectively connects these historical foundations to modern concerns about interpretability and explainability in AI. The use of Bongard problems as pedagogical tools is a distinctive approach that makes abstract concepts tangible. The lecture also clearly articulates the trade-off between interpretability and accuracy, and the importance of regularization in model selection.

Pour aller plus loin :

126 words

Radar Profile

The radar profile shows high scores in information quantity, quality, and reliability, with a slightly lower technical depth, reflecting the introductory nature of the lecture. The balance between historical context and technical content is well maintained, making it accessible to a broad audience while retaining scientific credibility.

Reliability 8/10