mlsanityData to 7 Oct 2026

How to See Hidden Patterns in Metamaterials with Interpretable Machine Learning

arXiv 2111.05949 ↗First posted 10 Nov 2021cs.LG cs.CE physics.app-phcited by 5

Not on the map. Why?

Abstract (arXiv)

Machine learning models can assist with metamaterials design by approximating computationally expensive simulators or solving inverse design problems. However, past work has usually relied on black box deep neural networks, whose reasoning processes are opaque and require enormous datasets that are expensive to obtain. In this work, we develop two novel machine learning approaches to metamaterials discovery that have neither of these disadvantages. These approaches, called shape-frequency features and unit-cell templates, can discover 2D metamaterials with user-specified frequency band gaps. Our approaches provide logical rule-based conditions on metamaterial unit-cells that allow for interpretable reasoning processes, and generalize well across design spaces of different resolutions. The templates also provide design flexibility where users can almost freely design the fine resolution features of a unit-cell without affecting the user's desired band gap.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 6 of its 75 references that are in the map. First posted on arXiv 10 Nov 2021.

Builds on

6 of 75 references.

References · 6

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2017Generative Adversarial Networks: An Overviewcited by 588
  3. 2015The Bayesian Case Model: A Generative Approach for Case-Based Reasoning and Prototype Classificationcited by 76
  4. 2020Deep Generative Modeling for Mechanistic-based Learning and Design of Metamaterial Systemscited by 51
  5. 2020Deep neural networks for the evaluation and design of photonic devicescited by 49
  6. 2018A Generative Model for Inverse Design of Metamaterialscited by 27

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 0; 2026: 1.

5 papers.