Efficient Approximate Methods for Design of Experiments for Copolymer Engineering
원문 초록
We develop a set of algorithms to solve a broad class of Design of Experiment (DoE) problems efficiently. Specifically, we consider problems in which one must choose a subset of polymers to test in experiments such that the learning of the polymeric design rules is optimal. This subset must be selected from a larger set of polymers permissible under arbitrary experimental design constraints. We demonstrate the performance of our algorithms by solving several pragmatic nucleic acid therapeutics engineering scenarios, where limitations in synthesis of chemically diverse nucleic acids or feasibility of measurements in experimental setups appear as constraints. Our approach focuses on identifying optimal experimental designs from a given set of experiments, which is in contrast to traditional, generative DoE methods like BIBD. Finally, we discuss how these algorithms are broadly applicable to well-established optimal DoE criteria like D-optimality.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ALINE: Joint Amortization for Bayesian Inference and Active Data Acquisition
Assessing parameter identifiability of a hemodynamics PDE model using spectral surrogates and dimension reduction
OmicsQ: A User-Friendly Platform for Interactive Quantitative Omics Data Analysis
A friendly introduction to triangular transport
Kernel Learning Assisted Synthesis Condition Exploration for Ternary Spinel
How causal perspectives can inform problems in computational neuroscience
토론
이 논문과 연결된 포럼 글이 아직 없습니다.