Physics-Informed Tree Search for High-Dimensional Computational Design

• URL: http://arxiv.org/abs/2601.06444v1
• Date: Sat, 10 Jan 2026 06:01:57 GMT
• Title: Physics-Informed Tree Search for High-Dimensional Computational Design
• Abstract summary: High-dimensional design spaces underpin a wide range of physics-based modeling computational tasks in science and engineering.<n> Conventional global engines and robustnesss struggle in such settings due to the exponential scaling of design spaces.<n>We present a physics-informed Monte Tree Tree (MCTS) framework for continuous search scientific design.
• Score: 1.7499338683160512
• 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.

Related papers

• An End-to-end Architecture for Collider Physics and Beyond [7.810285080897267]
  We present the first language-driven agent system capable of executing end-to-end phenomenology tasks.<n>The system is instantiated within a decoupled, domain-agnostic architecture for autonomous High-Energy Physics Colliderenology.<n>We validate the system on representative literature reproductions spanning leptoquark and axion-like-particle scenarios, higher-language effective operators, parton-level and detector-level analyses, and large-scale parameter scans.
  arXiv  Detail & Related papers  (2026-03-15T19:00:52Z)
• DyACE: Dynamic Algorithm Co-evolution for Online Automated Heuristic Design with Large Language Model [12.490525543266807]
  We introduce DyACE (Dynamic Co-evolution) as a Non-stationary Bi-level Control problem.<n>A core element of DyACE is the Look-Ahead Rollout Search, which queries the landscape geometry to extract Search Tray Features.<n>Results demonstrate that DyACE significantly outperforms state-of-the-art static baselines.
  arXiv  Detail & Related papers  (2026-03-07T06:46:53Z)
• Hierarchical Inference and Closure Learning via Adaptive Surrogates for ODEs and PDEs [15.38864225184245]
  Inverse problems are the task of calibrating models to match data.<n>We develop a principled methodology for leveraging data from collections of distinct yet related physical systems.<n>We learn the shared unknown dynamics in the form of an ML-based closure model.
  arXiv  Detail & Related papers  (2026-03-04T10:30:08Z)
• Neural Nonmyopic Bayesian Optimization in Dynamic Cost Settings [73.44599934855067]
  LookaHES is a nonmyopic BO framework designed for dynamic, history-dependent cost environments.<n>LookaHES combines a multi-step variant of $H$-Entropy Search with pathwise sampling and neural policy optimization.<n>Our innovation is the integration of neural policies, including large language models, to effectively navigate structured, domain-specific action spaces.
  arXiv  Detail & Related papers  (2026-01-10T09:49:45Z)
• Leveraging Discrete Function Decomposability for Scientific Design [48.365465744654365]
  In the era of AI-driven science and engineering, we often want to design objects in silico according to user-specified properties.<n>For example, we may wish to design a protein to bind its target, arrange components within a circuit to minimize latency, or find materials with certain properties.<n>We propose and demonstrate use of a new distributional optimization algorithm, De-Aware Distributional Optimization (DADO), that can leverage any decomposability defined by a junction tree on the design variables.
  arXiv  Detail & Related papers  (2025-11-04T21:57:51Z)
• Offline Model-Based Optimization: Comprehensive Review [61.91350077539443]
  offline optimization is a fundamental challenge in science and engineering, where the goal is to optimize black-box functions using only offline datasets.<n>Recent advances in model-based optimization have harnessed the generalization capabilities of deep neural networks to develop offline-specific surrogate and generative models.<n>Despite its growing impact in accelerating scientific discovery, the field lacks a comprehensive review.
  arXiv  Detail & Related papers  (2025-03-21T16:35:02Z)
• Neural Architecture Codesign for Fast Physics Applications [0.8692847090818803]
  We develop a pipeline to streamline neural architecture codesign for physics applications.<n>We employ neural architecture search and network compression in a two-stage approach to discover hardware efficient models.
  arXiv  Detail & Related papers  (2025-01-09T19:00:03Z)
• A Survey on Inference Optimization Techniques for Mixture of Experts Models [50.40325411764262]
  Large-scale Mixture of Experts (MoE) models offer enhanced model capacity and computational efficiency through conditional computation.<n> deploying and running inference on these models presents significant challenges in computational resources, latency, and energy efficiency.<n>This survey analyzes optimization techniques for MoE models across the entire system stack.
  arXiv  Detail & Related papers  (2024-12-18T14:11:15Z)
• Derivative-free tree optimization for complex systems [19.359472033285865]
  A tremendous range of design tasks in materials, physics, and biology can be formulated as finding the optimum of an objective function depending on many parameters without knowing their parameters. Here, we present a tree search method that enables the discovery of high-range derivative design systems.
  arXiv  Detail & Related papers  (2024-04-05T12:37:08Z)
• Many Physical Design Problems are Sparse QCQPs [0.0]
  Physical design applies to a desired objective (e.g. strong light-matter interactions) to quantum equations. computing an optimal design highlights the possibility of developing global optimal design differential equations.
  arXiv  Detail & Related papers  (2023-03-30T20:10:57Z)
• Scalable Bayesian optimization with high-dimensional outputs using randomized prior networks [3.0468934705223774]
  We propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. We show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs.
  arXiv  Detail & Related papers  (2023-02-14T18:55:21Z)
• Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spaces [54.58348769621782]
  Tree ensembles can be well-suited for black-box optimization tasks such as algorithm tuning and neural architecture search. Two well-known challenges in using tree ensembles for black-box optimization are (i) effectively quantifying model uncertainty for exploration and (ii) optimizing over the piece-wise constant acquisition function. Our framework performs as well as state-of-the-art methods for unconstrained black-box optimization over continuous/discrete features and outperforms competing methods for problems combining mixed-variable feature spaces and known input constraints.
  arXiv  Detail & Related papers  (2022-07-02T16:59:37Z)
• Multi-Objective Constrained Optimization for Energy Applications via Tree Ensembles [55.23285485923913]
  Energy systems optimization problems are complex due to strongly non-linear system behavior and multiple competing objectives. In some cases, proposed optimal solutions need to obey explicit input constraints related to physical properties or safety-critical operating conditions. This paper proposes a novel data-driven strategy using tree ensembles for constrained multi-objective optimization of black-box problems.
  arXiv  Detail & Related papers  (2021-11-04T20:18:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.