mlsanityData to 7 Oct 2026

Generator Assisted Mixture of Experts For Feature Acquisition in Batch

arXiv 2312.12574 ↗First posted 19 Dec 2023cs.LGcited by 2

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

Given a set of observations, feature acquisition is about finding the subset of unobserved features which would enhance accuracy. Such problems have been explored in a sequential setting in prior work. Here, the model receives feedback from every new feature acquired and chooses to explore more features or to predict. However, sequential acquisition is not feasible in some settings where time is of the essence. We consider the problem of feature acquisition in batch, where the subset of features to be queried in batch is chosen based on the currently observed features, and then acquired as a batch, followed by prediction. We solve this problem using several technical innovations. First, we use a feature generator to draw a subset of the synthetic features for some examples, which reduces the cost of oracle queries. Second, to make the feature acquisition problem tractable for the large heterogeneous observed features, we partition the data into buckets, by borrowing tools from locality sensitive hashing and then train a mixture of experts model. Third, we design a tractable lower bound of the original objective. We use a greedy algorithm combined with model training to solve the underlying problem. Experiments with four datasets show that our approach outperforms these methods in terms of trade-off between accuracy and feature acquisition cost.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 21 of its 45 references that are in the map. First posted on arXiv 19 Dec 2023.

Builds on

21 of 45 references.

References · 21

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2013Intriguing properties of neural networkscited by 5,114
  3. 2016Wide Residual Networkscited by 3,057
  4. 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,127
  5. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  6. 2014Lazier Than Lazy Greedycited by 97
  7. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 85
  8. 2019Learning From Less Data: A Unified Data Subset Selection and Active Learning Framework for Computer Visioncited by 64
  9. 2020Active Feature Acquisition with Generative Surrogate Modelscited by 53
  10. 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
  11. 2020Classification Under Human Assistancecited by 42
  12. 2017Classification with Costly Features using Deep Reinforcement Learningcited by 32
9 more
  1. 2020Active Learning under Label Shiftcited by 23
  2. 2019Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applicationscited by 20
  3. 2017Scalable Greedy Feature Selection via Weak Submodularitycited by 19
  4. 2018Active Feature Acquisition with Supervised Matrix Completioncited by 11
  5. 2017Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIPcited by 8
  6. 2016Online Sparse Linear Regressioncited by 6
  7. 2020Dynamic Feature Acquisition with Arbitrary Conditional Flowscited by 6
  8. 2015Scalable and Accurate Online Feature Selection for Big Datacited by 5
  9. 2018Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observationcited by 4

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Divide and not forget: Ensemble of selectively trained experts in Continual Learning
  2. 2026Prediction-powered Inference by Mixture of Experts
  3. 2025Klotski: Efficient Mixture-of-Expert Inference via Expert-Aware Multi-Batch Pipeline
  4. 2023Revisiting Single-gated Mixtures of Experts
  5. 2026BASE: Batch-Aware Selection of Experts Using Predicted Removal Error for Efficient MoE Decoding
  6. 2025Mixture of Many Zero-Compute Experts: A High-Rate Quantization Theory Perspective
  7. 2024Explainable data-driven modeling via mixture of experts: towards effective blending of grey and black-box models
  8. 2025A Comprehensive Survey of Mixture-of-Experts: Algorithms, Theory, and Applications