dorsal/arxiv
View SchemaPhysics-Informed Tree Search for High-Dimensional Computational Design
| Authors | Suvo Banik, Troy D. Loeffler, Henry Chan, Sukriti Manna, Orcun Yildiz, Tom Peterka, Subramanian Sankaranarayanan |
|---|---|
| Categories | |
| ArXiv ID | 2601.06444vv1 |
| URL | https://arxiv.org/abs/2601.06444 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
High-dimensional design spaces underpin a wide range of physics-based modeling and computational design tasks in science and engineering. These problems are commonly formulated as constrained black-box searches over rugged objective landscapes, where function evaluations are expensive, and gradients are unavailable or unreliable. Conventional global search engines and optimizers struggle in such settings due to the exponential scaling of design spaces, the presence of multiple local basins, and the absence of physical guidance in sampling. We present a physics-informed Monte Carlo Tree Search (MCTS) framework that extends policy-driven tree-based reinforcement concepts to continuous, high-dimensional scientific optimization. Our method integrates population-level decision trees with surrogate-guided directional sampling, reward shaping, and hierarchical switching between global exploration and local exploitation. These ingredients allow efficient traversal of non-convex, multimodal landscapes where physically meaningful optima are sparse. We benchmark our approach against standard global optimization baselines on a suite of canonical test functions, demonstrating superior or comparable performance in terms of convergence, robustness, and generalization. Beyond synthetic tests, we demonstrate physics-consistent applicability to (i) crystal structure optimization from clusters to bulk, (ii) fitting of classical interatomic potentials, and (iii) constrained engineering design problems. Across all cases, the method converges with high fidelity and evaluation efficiency while preserving physical constraints. Overall, our work establishes physics-informed tree search as a scalable and interpretable paradigm for computational design and high-dimensional scientific optimization, bridging discrete decision-making frameworks with continuous search in scientific design workflows.
{
"annotation_id": "23ac4e25-e519-42fd-818e-f46757abd368",
"date_created": "2026-02-17T05:53:08.248000Z",
"date_modified": "2026-02-17T05:53:08.248000Z",
"file_hash": "2665b810baa2c7fc4265e91bb0e10c17d5514745502a1ae982926f7cb48d143c",
"private": false,
"record": {
"abstract": "High-dimensional design spaces underpin a wide range of physics-based modeling and computational design tasks in science and engineering. These problems are commonly formulated as constrained black-box searches over rugged objective landscapes, where function evaluations are expensive, and gradients are unavailable or unreliable. Conventional global search engines and optimizers struggle in such settings due to the exponential scaling of design spaces, the presence of multiple local basins, and the absence of physical guidance in sampling. We present a physics-informed Monte Carlo Tree Search (MCTS) framework that extends policy-driven tree-based reinforcement concepts to continuous, high-dimensional scientific optimization. Our method integrates population-level decision trees with surrogate-guided directional sampling, reward shaping, and hierarchical switching between global exploration and local exploitation. These ingredients allow efficient traversal of non-convex, multimodal landscapes where physically meaningful optima are sparse. We benchmark our approach against standard global optimization baselines on a suite of canonical test functions, demonstrating superior or comparable performance in terms of convergence, robustness, and generalization. Beyond synthetic tests, we demonstrate physics-consistent applicability to (i) crystal structure optimization from clusters to bulk, (ii) fitting of classical interatomic potentials, and (iii) constrained engineering design problems. Across all cases, the method converges with high fidelity and evaluation efficiency while preserving physical constraints. Overall, our work establishes physics-informed tree search as a scalable and interpretable paradigm for computational design and high-dimensional scientific optimization, bridging discrete decision-making frameworks with continuous search in scientific design workflows.",
"arxiv_id": "2601.06444",
"authors": [
"Suvo Banik",
"Troy D. Loeffler",
"Henry Chan",
"Sukriti Manna",
"Orcun Yildiz",
"Tom Peterka",
"Subramanian Sankaranarayanan"
],
"categories": [
"cs.LG",
"cond-mat.mtrl-sci",
"physics.comp-ph",
"physics.data-an"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Physics-Informed Tree Search for High-Dimensional Computational Design",
"url": "https://arxiv.org/abs/2601.06444",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c385b213-8970-43f0-98ed-c8df5aec5f7f",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}