Reading Map

Read the methods in terms of optimization interface, then move to code

This page gives a compact reading order. It is meant to clarify what to read first, why that order may be useful, and which toy reproduction becomes more interpretable after each step.

01

Survey

Begin with the taxonomy so that later methods can be compared as different interfaces for the integration of prior knowledge.

02

Logic-Net

Then examine how logic rules are converted into a teacher distribution and later written back into parameters through distillation.

03

Semantic Loss

Then revisit Semantic Loss until the distinction between class probabilities and satisfying-world mass becomes operationally clear.

04

DL2

Now study DL2 as a broader declarative-constraint route, comparing surrogate losses, feasible sets, and query-time optimization.

05

Granular / Landmarks

Then extend from exact and declarative constraints toward the granular and knowledge-landmark papers, while exploring knowledge-guided feature selection.

Suggested reproduction order

  1. logic_net_toy
  2. semantic_loss_toy
  3. knowledge_landmarks_toy

Use these toys not only to reproduce mechanisms, but to trace where knowledge actually enters the learning process: teacher distribution, satisfying-mass loss, or softer global regularization.

Long-form roadmap document

The full roadmap remains in the repository and includes screenshots, note relationships, and code-reading guidance that go beyond the short overview on this page.