Spaces:
Running
on
CPU Upgrade
Running
on
CPU Upgrade
Commit
·
c080a0f
1
Parent(s):
450850c
another stab
Browse files
app.py
CHANGED
@@ -583,15 +583,14 @@ def main():
|
|
583 |
* UMA models predict motion and behavior at the atomic scale, ultimately reducing the development cycle in molecular and materials discovery and unlocking new possibilities for innovation and impact.
|
584 |
* UMA models are based on Density Functional Theory (DFT) training datasets. DFT simulations are a commonly used quantum chemistry method to simulate and understand behavior at the atomic scale.
|
585 |
* UMA models are large mixture-of-linear-experts graph networks models trained on billions of atoms across five open-science simulation datasets released by the FAIR Chemistry team over the past 5 years. This demo uses the small UMA model with 146M total parameters, 32 experts, and 6M active parameters at any time to predict across all of these domains.
|
586 |
-
|
587 |
[Read the UMA paper for details](https://ai.meta.com/research/publications/uma-a-family-of-universal-models-for-atoms/) or [download the UMA model](https://huggingface.co/facebook/UMA) and [FAIR Chemistry repository](https://github.com/facebookresearch/fairchem) to use this yourself!
|
588 |
"""
|
589 |
)
|
590 |
with gr.Accordion("Should I trust UMA?", open=False):
|
591 |
gr.Markdown(
|
592 |
"""
|
593 |
-
* The UMA model paper contains rigorous accuracy benchmarks on a number of validation sets across chemistry and materials science. As of model release the UMA model was at or near the state-of-the-art for generalization machine learning potentials. [Read the UMA paper for details.](https://ai.meta.com/research/publications/uma-a-family-of-universal-models-for-atoms/
|
594 |
-
)
|
595 |
* Rigorously predicting when AI/ML models will extrapolate (or not) to new domains is an ongoing research area. The best approach is to find or build benchmarks that are similar to the questions you are studying, or be prepared to run some DFT simulations on predictions to validate results on a sample of structures that are relevant to your research problem.
|
596 |
"""
|
597 |
)
|
|
|
583 |
* UMA models predict motion and behavior at the atomic scale, ultimately reducing the development cycle in molecular and materials discovery and unlocking new possibilities for innovation and impact.
|
584 |
* UMA models are based on Density Functional Theory (DFT) training datasets. DFT simulations are a commonly used quantum chemistry method to simulate and understand behavior at the atomic scale.
|
585 |
* UMA models are large mixture-of-linear-experts graph networks models trained on billions of atoms across five open-science simulation datasets released by the FAIR Chemistry team over the past 5 years. This demo uses the small UMA model with 146M total parameters, 32 experts, and 6M active parameters at any time to predict across all of these domains.
|
586 |
+
|
587 |
[Read the UMA paper for details](https://ai.meta.com/research/publications/uma-a-family-of-universal-models-for-atoms/) or [download the UMA model](https://huggingface.co/facebook/UMA) and [FAIR Chemistry repository](https://github.com/facebookresearch/fairchem) to use this yourself!
|
588 |
"""
|
589 |
)
|
590 |
with gr.Accordion("Should I trust UMA?", open=False):
|
591 |
gr.Markdown(
|
592 |
"""
|
593 |
+
* The UMA model paper contains rigorous accuracy benchmarks on a number of validation sets across chemistry and materials science. As of model release the UMA model was at or near the state-of-the-art for generalization machine learning potentials. [Read the UMA paper for details.](https://ai.meta.com/research/publications/uma-a-family-of-universal-models-for-atoms/)
|
|
|
594 |
* Rigorously predicting when AI/ML models will extrapolate (or not) to new domains is an ongoing research area. The best approach is to find or build benchmarks that are similar to the questions you are studying, or be prepared to run some DFT simulations on predictions to validate results on a sample of structures that are relevant to your research problem.
|
595 |
"""
|
596 |
)
|