SearcharxivSearch

arXiv subjects

Arun Ravichandran

Publications and source records attributed to Arun Ravichandran.

2 recordsLinked to original sources

Optimization of ReaxFF parameters for the $\mathrm{Mo-S}$ system using random optimization and coordinate search

ReaxFF is a molecular dynamics method that can be considered a good approximation to quantum methods for investigating reactive molecular systems consisting of ten thousand to one hundred thousand atoms. While ReaxFF is usually a much faster alternative to quantum methods, the force field consists of nearly 100 parameters per element, which makes the force field development a high dimensional optimization problem. In addition to the high-dimensionality, non-convexity and non-continuity make it a hard problem to optimize. We use random optimization along with coordinate search strategies to optimize efficiently and sample new parameter points that yield good molecular properties close to predefined `reference values' obtained from quantum mechanical methods for the $\mathrm{Mo-S}$ system. We also provide empirical error guaranties starting from any random sample of inputs. We discover new points for the $\mathrm{Mo-S}$ system at adjusted error levels of $13{,}000$ as compared to Sengul et al. (2022) at $70{,}000$ levels under the same loss function, registering over $80\%$ improvement. We also extend our algorithm to an out-of-sample system, $\mathrm{W-S}$, with no training data to record over $70\%$ improvement over Sengul et al. (2021).

stat.AP

Optimal allocation of sample size for randomization-based inference from $2^K$ factorial designs

Optimizing the allocation of units into treatment groups can help researchers improve the precision of causal estimators and decrease costs when running factorial experiments. However, existing optimal allocation results typically assume a super-population model and that the outcome data comes from a known family of distributions. Instead, we focus on randomization-based causal inference for the finite-population setting, which does not require model specifications for the data or sampling assumptions. We propose exact theoretical solutions for optimal allocation in $2^K$ factorial experiments under complete randomization with A-, D- and E-optimality criteria. We then extend this work to factorial designs with block randomization. We also derive results for optimal allocations when using cost-based constraints. To connect our theory to practice, we provide convenient integer-constrained programming solutions using a greedy optimization approach to find integer optimal allocation solutions for both complete and block randomization. The proposed methods are demonstrated using two real-life factorial experiments conducted by social scientists.

stat.ME