mlsanityData to 14 Oct 2026

Designing Complex Experiments by Applying Unsupervised Machine Learning

arXiv 2110.01458 ↗First posted 29 Sep 2021cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Design of experiments (DOE) is playing an essential role in learning and improving a variety of objects and processes. The article discusses the application of unsupervised machine learning to support the pragmatic designs of complex experiments. Complex experiments are characterized by having a large number of factors, mixed-level designs, and may be subject to constraints that eliminate some unfeasible trials for various reasons. Having such attributes, it is very challenging to design pragmatic experiments that are economically, operationally, and timely sound. It means a significant decrease in the number of required trials from a full factorial design, while still attempting to achieve the defined objectives. A beta variational autoencoder (beta-VAE) has been applied to represent trials of the initial full factorial design after filtering out unfeasible trials on the low dimensional latent space. Regarding visualization and interpretability, the paper is limited to 2D representations. Beta-VAE supports (1) orthogonality of the latent space dimensions, (2) isotropic multivariate standard normal distribution of the representation on the latent space, (3) disentanglement of the latent space representation by levels of factors, (4) propagation of the applied constraints of the initial design into the latent space, and (5) generation of trials by decoding latent space points. Having an initial design representation on the latent space with such properties, it allows for the generation of pragmatic design of experiments (G-DOE) by specifying the number of trials and their pattern on the latent space, such as square or polar grids. Clustering and aggregated gradient metrics have been shown to guide grid specification.

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

Builds on

11 of 54 references.

References · 11

  1. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  2. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  3. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  4. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
  5. 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 373
  6. 2015Adversarial Autoencoderscited by 364
  7. 2016A guide to convolution arithmetic for deep learningcited by 185
  8. 2018Variational Autoencoders Pursue PCA Directions (by Accident)cited by 85
  9. 2013Deep Learning of Representations: Looking Forwardcited by 84
  10. 2018Learning Disentangled Joint Continuous and Discrete Representationscited by 83
  11. 2020AI Discovering a Coordinate System of Chemical Elements: Dual Representation by Variational Autoencoderscited by 3

Built on by

Not cited yet.