Search Strategies for Self-driving Laboratories with Pending Experiments

• URL: http://arxiv.org/abs/2312.03466v1
• Date: Wed, 6 Dec 2023 12:41:53 GMT
• Title: Search Strategies for Self-driving Laboratories with Pending Experiments
• Authors: Hao Wen, Jakob Zeitler, Connor Rupnow
• Abstract summary: Self-driving laboratories (SDLs) consist of multiple stations that perform material synthesis and characterisation tasks. It is practical to run experiments in asynchronous parallel, in which multiple experiments are being performed at once in different stages. We build a simulator for a multi-stage SDL and compare optimisation strategies for dealing with delayed feedback and asynchronous parallelized operation.
• Score: 4.416701099409113
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Self-driving laboratories (SDLs) consist of multiple stations that perform material synthesis and characterisation tasks. To minimize station downtime and maximize experimental throughput, it is practical to run experiments in asynchronous parallel, in which multiple experiments are being performed at once in different stages. Asynchronous parallelization of experiments, however, introduces delayed feedback (i.e. "pending experiments"), which is known to reduce Bayesian optimiser performance. Here, we build a simulator for a multi-stage SDL and compare optimisation strategies for dealing with delayed feedback and asynchronous parallelized operation. Using data from a real SDL, we build a ground truth Bayesian optimisation simulator from 177 previously run experiments for maximizing the conductivity of functional coatings. We then compare search strategies such as expected improvement, noisy expected improvement, 4-mode exploration and random sampling. We evaluate their performance in terms of amount of delay and problem dimensionality. Our simulation results showcase the trade-off between the asynchronous parallel operation and delayed feedback.

Related papers

• CoPS: Empowering LLM Agents with Provable Cross-Task Experience Sharing [70.25689961697523]
  We propose a generalizable algorithm that enhances sequential reasoning by cross-task experience sharing and selection. Our work bridges the gap between existing sequential reasoning paradigms and validates the effectiveness of leveraging cross-task experiences.
  arXiv  Detail & Related papers  (2024-10-22T03:59:53Z)
• Autonomous Vehicle Controllers From End-to-End Differentiable Simulation [60.05963742334746]
  We propose a differentiable simulator and design an analytic policy gradients (APG) approach to training AV controllers. Our proposed framework brings the differentiable simulator into an end-to-end training loop, where gradients of environment dynamics serve as a useful prior to help the agent learn a more grounded policy. We find significant improvements in performance and robustness to noise in the dynamics, as well as overall more intuitive human-like handling.
  arXiv  Detail & Related papers  (2024-09-12T11:50:06Z)
• Bidirectional Decoding: Improving Action Chunking via Closed-Loop Resampling [51.38330727868982]
  Bidirectional Decoding (BID) is a test-time inference algorithm that bridges action chunking with closed-loop operations. We show that BID boosts the performance of two state-of-the-art generative policies across seven simulation benchmarks and two real-world tasks.
  arXiv  Detail & Related papers  (2024-08-30T15:39:34Z)
• NAVSIM: Data-Driven Non-Reactive Autonomous Vehicle Simulation and Benchmarking [65.24988062003096]
  We present NAVSIM, a framework for benchmarking vision-based driving policies. Our simulation is non-reactive, i.e., the evaluated policy and environment do not influence each other. NAVSIM enabled a new competition held at CVPR 2024, where 143 teams submitted 463 entries, resulting in several new insights.
  arXiv  Detail & Related papers  (2024-06-21T17:59:02Z)
• Pessimistic asynchronous sampling in high-cost Bayesian optimization [0.0]
  Asynchronous Bayesian optimization is a technique that allows for parallel operation of experimental systems and disjointed systems. A pessimistic prediction asynchronous policy reached optimum experimental conditions in significantly fewer experiments than equivalent serial policies. Without accounting for the faster sampling rate, the pessimistic algorithm presented in this work could result in more efficient algorithm driven optimization of high-cost experimental spaces.
  arXiv  Detail & Related papers  (2024-06-21T16:35:27Z)
• Bayesian Optimization for Robust State Preparation in Quantum Many-Body Systems [0.0]
  We apply Bayesian optimization to a state-preparation protocol recently implemented in an ultracold-atom system. Compared to manual ramp design, we demonstrate the superior performance of our optimization approach in a numerical simulation. The proposed protocol and workflow will pave the way toward the realization of more complex many-body quantum states in experiments.
  arXiv  Detail & Related papers  (2023-12-14T18:59:55Z)
• Waymax: An Accelerated, Data-Driven Simulator for Large-Scale Autonomous Driving Research [76.93956925360638]
  Waymax is a new data-driven simulator for autonomous driving in multi-agent scenes. It runs entirely on hardware accelerators such as TPUs/GPUs and supports in-graph simulation for training. We benchmark a suite of popular imitation and reinforcement learning algorithms with ablation studies on different design decisions.
  arXiv  Detail & Related papers  (2023-10-12T20:49:15Z)
• Combining Multi-Fidelity Modelling and Asynchronous Batch Bayesian Optimization [10.29946890434873]
  This paper proposes an algorithm combining multi-fidelity and asynchronous batch methods. We empirically study the algorithm behavior, and show it can outperform single-fidelity batch methods and multi-fidelity sequential methods. As an application, we consider designing electrode materials for optimal performance in pouch cells using experiments with coin cells to approximate battery performance.
  arXiv  Detail & Related papers  (2022-11-11T12:02:40Z)
• New Paradigms for Exploiting Parallel Experiments in Bayesian Optimization [0.0]
  We present new parallel BO paradigms that exploit the structure of the system to partition the design space. Specifically, we propose an approach that partitions the design space by following the level sets of the performance function. Our results show that our approaches significantly reduce the required search time and increase the probability of finding a global (rather than local) solution.
  arXiv  Detail & Related papers  (2022-10-03T16:45:23Z)
• Cognitive simulation models for inertial confinement fusion: Combining simulation and experimental data [0.0]
  Researchers rely heavily on computer simulations to explore the design space in search of high-performing implosions. For more effective design and investigation, simulations require input from past experimental data to better predict future performance. We describe a cognitive simulation method for combining simulation and experimental data into a common, predictive model.
  arXiv  Detail & Related papers  (2021-03-19T02:00:14Z)
• Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates [67.19481956584465]
  It has been experimentally observed that the efficiency of distributed training with saturation (SGD) depends decisively on the batch size and -- in implementations -- on the staleness. We show that our results are tight and illustrate key findings in numerical experiments.
  arXiv  Detail & Related papers  (2021-03-03T12:08:23Z)

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.