Datasets:
Update README.md
Browse files
README.md
CHANGED
|
@@ -29,8 +29,8 @@ This repository hosts a single PyTorch Geometric dataset file used for the TAG-D
|
|
| 29 |
|
| 30 |
- Contains the **first 10,000 proofs** from the ~45,000-theorem Metamath database
|
| 31 |
- Each example is a **directed acyclic graph** (DAG)
|
| 32 |
-
- **Node features:** 768-dimensional
|
| 33 |
-
- **Labels:** the
|
| 34 |
- **Conclusion masking:** the conclusion node’s embedding is zeroed out so the model must predict the final logical step directly from the graph structure and the other nodes
|
| 35 |
- **Rare labels** (<=5 occurrences) are collapsed into a single UNK class
|
| 36 |
- **All theorem statements** (not just proofs) are included in training, since the model must treat theorems themselves as prior knowledge
|
|
|
|
| 29 |
|
| 30 |
- Contains the **first 10,000 proofs** from the ~45,000-theorem Metamath database
|
| 31 |
- Each example is a **directed acyclic graph** (DAG)
|
| 32 |
+
- **Node features:** 768-dimensional CodeBERT embeddings of Metamath statements
|
| 33 |
+
- **Labels:** the theorem required to justify each node (axioms and assumptions have the same label)
|
| 34 |
- **Conclusion masking:** the conclusion node’s embedding is zeroed out so the model must predict the final logical step directly from the graph structure and the other nodes
|
| 35 |
- **Rare labels** (<=5 occurrences) are collapsed into a single UNK class
|
| 36 |
- **All theorem statements** (not just proofs) are included in training, since the model must treat theorems themselves as prior knowledge
|