BPBrenden K. Petersen

Brenden K. Petersen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Brenden K. Petersen has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Preemptive optimization of a clinical antibody for broad neutralization of SARS-CoV-2 variants and robustness against viral escape

    by Fangqiang Zhu, Saravanan Rajan, Conor F. Hayes, Ka Yin Kwong, Andre R. Goncalves, Adam T. Zemla, Edmond Y. Lau, Yi Zhang, Yingyun Cai, John W. Goforth, et al.

    Most previously authorized clinical antibodies against severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) have lost neutralizing activity to recent variants due to rapid viral evolution. To mitigate such escape, we preemptively enhance AZD3152, an antibody authorized for prophylaxis in immunocompromised individuals. Using deep mutational scanning (DMS) on the SARS-CoV-2 antigen, we identify AZD3152 vulnerabilities at antigen positions F456 and D420. Through two iterations of computational antibody design that integrates structure-based modeling, machine-learning, and experimental validation, we co-optimize AZD3152 against 24 contemporary and previous SARS-CoV-2 variants, as well as 20 potential future escape variants. Our top candidate, 3152-1142, restores full potency (100-fold improvement) against the more recently emerged XBB.1.5+F456L variant that escaped AZD3152, maintains potency against previous variants of concern, and shows no additional vulnerability as assessed by DMS. This preemptive mitigation demonstrates a generalizable approach for optimizing existing antibodies against potential future viral escape.


  • Language model-accelerated deep symbolic optimization

    by da Silva, Felipe Leno, Andre Goncalves, Sam Nguyen, Denis Vashchenko, Ruben Glatt, Thomas Desautels, Mikel Landajuela, Daniel Faissol, Brenden Petersen


  • Open Access

    Reinforcement Learning for Adaptive Mesh Refinement

    by Jiachen Yang, Tarik Dzanic, Brenden Petersen, Jun Kudo, Ketan Mittal, Vladimir Tomov, Jean-Sylvain Camier, Tuo Zhao, Hongyuan Zha, Tzanio Kolev, et al.

    Large-scale finite element simulations of complex physical systems governed by partial differential equations (PDE) crucially depend on adaptive mesh refinement (AMR) to allocate computational budget to regions where higher resolution is required. Existing scalable AMR methods make heuristic refinement decisions based on instantaneous error estimation and thus do not aim for long-term optimality over an entire simulation. We propose a novel formulation of AMR as a Markov decision process and apply deep reinforcement learning (RL) to train refinement policies directly from simulation. AMR poses a new problem for RL as both the state dimension and available action set changes at every step, which we solve by proposing new policy architectures with differing generality and inductive bias. The model sizes of these policy architectures are independent of the mesh size and hence can be deployed on larger simulations than those used at train time. We demonstrate in comprehensive experiments on static function estimation and time-dependent equations that RL policies can be trained on problems without using ground truth solutions, are competitive with a widely-used error estimator, and generalize to larger, more complex, and unseen test problems.

  • Open Access

    Moving the needle: Employing deep reinforcement learning to push the boundaries of coarse-grained vaccine models

    by Jonathan G. Faris, Daniel Orbidan, Charles Wells, Brenden K. Petersen, Kayla G. Sprenger

    Highly mutable infectious disease pathogens (hm-IDPs) such as HIV and influenza evolve faster than the human immune system can contain them, allowing them to circumvent traditional vaccination approaches and causing over one million deaths annually. Agent-based models can be used to simulate the complex interactions that occur between immune cells and hm-IDP-like proteins (antigens) during affinity maturation—the process by which antibodies evolve. Compared to existing experimental approaches, agent-based models offer a safe, low-cost, and rapid route to study the immune response to vaccines spanning a wide range of design variables. However, the highly stochastic nature of affinity maturation and vast sequence space of hm-IDPs render brute force searches intractable for exploring all pertinent vaccine design variables and the subset of immunization protocols encompassed therein. To address this challenge, we employed deep reinforcement learning to drive a recently developed agent-based model of affinity maturation to focus sampling on immunization protocols with greater potential to improve the chosen metrics of protection, namely the broadly neutralizing antibody (bnAb) titers or fraction of bnAbs produced. Using this approach, we were able to coarse-grain a wide range of vaccine design variables and explore the relevant design space. Our work offers new testable insights into how vaccines should be formulated to maximize protective immune responses to hm-IDPs and how they can be minimally tailored to account for major sources of heterogeneity in human immune responses and various socioeconomic factors. Our results indicate that the first 3 to 5 immunizations, depending on the metric of protection, should be specially tailored to achieve a robust protective immune response, but that beyond this point further immunizations require only subtle changes in formulation to sustain a durable bnAb response.


  • Open Access

    Symbolic Regression via Neural-Guided Genetic Programming Population Seeding

    by T. Nathan Mundhenk, Mikel Landajuela, Ruben Glatt, Claudio P. Santiago, Daniel M. Faissol, Brenden K. Petersen

    Symbolic regression is the process of identifying mathematical expressions that fit observed output from a black-box process. It is a discrete optimization problem generally believed to be NP-hard. Prior approaches to solving the problem include neural-guided search (e.g. using reinforcement learning) and genetic programming. In this work, we introduce a hybrid neural-guided/genetic programming approach to symbolic regression and other combinatorial optimization problems. We propose a neural-guided component used to seed the starting population of a random restart genetic programming component, gradually learning better starting populations. On a number of common benchmark tasks to recover underlying expressions from a dataset, our method recovers 65% more expressions than a recently published top-performing model using the same experimental setup. We demonstrate that running many genetic programming generations without interdependence on the neural-guided component performs better for symbolic regression than alternative formulations where the two are more strongly coupled. Finally, we introduce a new set of 22 symbolic regression benchmark problems with increased difficulty over existing benchmarks. Source code is provided at www.github.com/brendenpetersen/deep-symbolic-optimization.


  • Open Access

    Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients

    by Brenden K. Petersen, Mikel Landajuela, T. Nathan Mundhenk, Claudio P. Santiago, Soo K. Kim, Joanne T. Kim

    Discovering the underlying mathematical expressions describing a dataset is a core challenge for artificial intelligence. This is the problem of $\textit{symbolic regression}$. Despite recent advances in training neural networks to solve complex tasks, deep learning approaches to symbolic regression are underexplored. We propose a framework that leverages deep learning for symbolic regression via a simple idea: use a large model to search the space of small models. Specifically, we use a recurrent neural network to emit a distribution over tractable mathematical expressions and employ a novel risk-seeking policy gradient to train the network to generate better-fitting expressions. Our algorithm outperforms several baseline methods (including Eureqa, the gold standard for symbolic regression) in its ability to exactly recover symbolic expressions on a series of benchmark problems, both with and without added noise. More broadly, our contributions include a framework that can be applied to optimize hierarchical, variable-length objects under a black-box performance metric, with the ability to incorporate constraints in situ, and a risk-seeking policy gradient formulation that optimizes for best-case performance instead of expected performance.


  • Open Access

    An Interactive Visualization Platform for Deep Symbolic Regression

    by Joanne T. Kim, Sookyung Kim, Brenden K. Petersen

    Discovering tractable mathematical expressions that best explain a dataset is a long-standing challenge in artificial intelligence. This problem, known as symbolic regression, is relevant when one seeks to generate new physical knowledge and insights. Since practitioners are primarily interested in knowledge generation, the ability to interact with a symbolic regression algorithm would be highly valuable. Thus, we present an interactive symbolic regression framework that allows users not only to configure runs, but also to control the system during training. The interface provides real-time visualization and diagnostics to help guide the user as they control the algorithm on the fly.


  • Open Access

    Competing Mechanistic Hypotheses of Acetaminophen-Induced Hepatotoxicity Challenged by Virtual Experiments

    by Andrew K. Smith, Brenden K. Petersen, Glen E. P. Ropella, Ryan C. Kennedy, Neil Kaplowitz, Murad Ookhtens, C. Anthony Hunt

    Acetaminophen-induced liver injury in mice is a model for drug-induced liver injury in humans. A precondition for improved strategies to disrupt and/or reverse the damage is a credible explanatory mechanism for how toxicity phenomena emerge and converge to cause hepatic necrosis. The Target Phenomenon in mice is that necrosis begins adjacent to the lobule’s central vein (CV) and progresses outward. An explanatory mechanism remains elusive. Evidence supports that location dependent differences in NAPQI (the reactive metabolite) formation within hepatic lobules (NAPQI zonation) are necessary and sufficient prerequisites to account for that phenomenon. We call that the NZ-mechanism hypothesis. Challenging that hypothesis in mice is infeasible because 1) influential variables cannot be controlled, and 2) it would require sequential intracellular measurements at different lobular locations within the same mouse. Virtual hepatocytes use independently configured periportal-to-CV gradients to exhibit lobule-location dependent behaviors. Employing NZ-mechanism achieved quantitative validation targets for acetaminophen clearance and metabolism but failed to achieve the Target Phenomenon. We posited that, in order to do so, at least one additional feature must exhibit zonation by decreasing in the CV direction. We instantiated and explored two alternatives: 1) a glutathione depletion threshold diminishes in the CV direction; and 2) ability to repair mitochondrial damage diminishes in the CV direction. Inclusion of one or the other feature into NZ-mechanism failed to achieve the Target Phenomenon. However, inclusion of both features enabled successfully achieving the Target Phenomenon. The merged mechanism provides a multilevel, multiscale causal explanation of key temporal features of acetaminophen hepatotoxicity in mice. We discovered that variants of the merged mechanism provide plausible quantitative explanations for the considerable variation in 24-hour necrosis scores among 37 genetically diverse mouse strains following a single toxic acetaminophen dose. Acetaminophen-induced liver injury in mice is a model for drug-induced liver injury in humans. Challenging an explanatory mechanism in mice is problematic because variables determining causes and effects cannot be controlled adequately. We circumvent that impediment by performing virtual experiments that challenge the prevailing scientific explanation for the characteristic spatiotemporal pattern of early acetaminophen-induced hepatic necrosis. Virtual mice utilize a biomimetic software liver. Results of virtual experiments provide compelling evidence that the prevailing explanation is insufficient. Without further studies in mice, we discovered a new, marginally more complex explanatory mechanism that met stringent tests of sufficiency. We argue that this virtual causal mechanism and the actual mechanism in mice are strongly analogous within and across multiple biological levels. Variants of the virtual mechanism provide possible explanations for the considerable variation in 24-hour necrosis scores among 37 genetically diverse mouse strains following a single toxic acetaminophen dose.