mlsanityData to 14 Oct 2026

Predicting Nanorobot Shapes via Generative Models

arXiv 2101.12719 ↗First posted 29 Jan 2021cs.LG cs.AI cs.ROcited by 0

Not on the map. Why?

Abstract (arXiv)

The field of DNA nanotechnology has made it possible to assemble, with high yields, different structures that have actionable properties. For example, researchers have created components that can be actuated. An exciting next step is to combine these components into multifunctional nanorobots that could, potentially, perform complex tasks like swimming to a target location in the human body, detect an adverse reaction and then release a drug load to stop it. However, as we start to assemble more complex nanorobots, the yield of the desired nanorobot begins to decrease as the number of possible component combinations increases. Therefore, the ultimate goal of this work is to develop a predictive model to maximize yield. However, training predictive models typically requires a large dataset. For the nanorobots we are interested in assembling, this will be difficult to collect. This is because high-fidelity data, which allows us to characterize the shape and size of individual structures, is very time-consuming to collect, whereas low-fidelity data is readily available but only captures bulk statistics for different processes. Therefore, this work combines low- and high-fidelity data to train a generative model using a two-step process. We first use a relatively small, high-fidelity dataset to train a generative model. At run time, the model takes low-fidelity data and uses it to approximate the high-fidelity content. We do this by biasing the model towards samples with specific properties as measured by low-fidelity data. In this work we bias our distribution towards a desired node degree of a graphical model that we take as a surrogate representation of the nanorobots that this work will ultimately focus on. We have not yet accumulated a high-fidelity dataset of nanorobots, so we leverage the MolGAN architecture [1] and the QM9 small molecule dataset [2-3] to demonstrate our approach.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 27 references that are in the map. First posted on arXiv 29 Jan 2021.

Builds on

11 of 27 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2015Continuous control with deep reinforcement learningcited by 3,407
  4. 2017Improved Training of Wasserstein GANscited by 2,235
  5. 2014Conditional Generative Adversarial Netscited by 2,162
  6. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,054
  7. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  8. 2018MolGAN: An implicit generative model for small molecular graphscited by 393
  9. 2018NetGAN: Generating Graphs via Random Walkscited by 131
  10. 2017Objective-Reinforced Generative Adversarial Networks (ORGAN) for Sequence Generation Modelscited by 117
  11. 2018Conditional molecular design with deep generative modelscited by 44

Built on by

Not cited yet.