REVIEW 2 cited by
Do Two AI Scientists Agree?
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
When two AI models are trained on the same scientific task, do they learn the same theory or two different theories? Throughout history of science, we have witnessed the rise and fall of theories driven by experimental validation or falsification: many theories may co-exist when experimental data is lacking, but the space of survived theories become more constrained with more experimental data becoming available. We show the same story is true for AI scientists. With increasingly more systems provided in training data, AI scientists tend to converge in the theories they learned, although sometimes they form distinct groups corresponding to different theories. To mechanistically interpret what theories AI scientists learn and quantify their agreement, we propose MASS, Hamiltonian-Lagrangian neural networks as AI Scientists, trained on standard problems in physics, aggregating training results across many seeds simulating the different configurations of AI scientists. Our findings suggests for AI scientists switch from learning a Hamiltonian theory in simple setups to a Lagrangian formulation when more complex systems are introduced. We also observe strong seed dependence of the training dynamics and final learned weights, controlling the rise and fall of relevant theories. We finally demonstrate that not only can our neural networks aid interpretability, it can also be applied to higher dimensional problems.
Forward citations
Cited by 2 Pith papers
-
BACON: A fully explainable AI model with graded logic for decision making problems
BACON trains logic aggregation trees with learned feature orderings, producing compact symbolic decision rules with accuracy near black-box models on small tabular datasets.
-
Acquiring Human-Like Data-Efficient Mechanics Prediction from Deep Reinforcement Learning
A parameter-conditioned DQN trained by episodic switching across two or three neighboring physical tasks generalizes to unseen parameters (R² ≥ 0.90), but the switching benefit is not isolated from a plain multi-task ...
Discussion (0). Continue with ORCID to comment.