Update README.md
Browse files
README.md
CHANGED
|
@@ -5,19 +5,15 @@ license: cc-by-4.0
|
|
| 5 |
|
| 6 |
# BRAIDBERTa
|
| 7 |
|
| 8 |
-
|
| 9 |
-
**BRAID** — a machine-native molecular line notation in which every string decodes to a
|
| 10 |
-
valid molecule.
|
| 11 |
|
| 12 |
-
|
| 13 |
-
anything on downstream property prediction? Against a matched-budget SMILES control, the
|
| 14 |
-
answer is **no** — the two are statistically indistinguishable on BBBP.
|
| 15 |
-
|
| 16 |
-
If you want a model whose input notation cannot represent an invalid molecule,
|
| 17 |
-
this is that.
|
| 18 |
|
| 19 |
---
|
| 20 |
|
|
|
|
|
|
|
|
|
|
| 21 |
## The BRAID notation
|
| 22 |
|
| 23 |
BRAID (**B**ranch-counted, **R**elative-ring, **A**ttachment-native, **I**nvalid-free,
|
|
|
|
| 5 |
|
| 6 |
# BRAIDBERTa
|
| 7 |
|
| 8 |
+
BRAIDBERTa is the first pretrained language model for BRAID, a molecular notation in which every valid string decodes to a valid molecule.
|
|
|
|
|
|
|
| 9 |
|
| 10 |
+
Compared against a matched SMILES baseline on BBBP, BRAID achieves statistically indistinguishable ROC-AUC while guaranteeing valid decoding.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 11 |
|
| 12 |
---
|
| 13 |
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
|
| 17 |
## The BRAID notation
|
| 18 |
|
| 19 |
BRAID (**B**ranch-counted, **R**elative-ring, **A**ttachment-native, **I**nvalid-free,
|