mlsanityData to 7 Oct 2026

Stochastic Deep Networks with Linear Competing Units for Model-Agnostic Meta-Learning

arXiv 2208.01573 ↗First posted 2 Aug 2022cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

This work addresses meta-learning (ML) by considering deep networks with stochastic local winner-takes-all (LWTA) activations. This type of network units results in sparse representations from each model layer, as the units are organized into blocks where only one unit generates a non-zero output. The main operating principle of the introduced units rely on stochastic principles, as the network performs posterior sampling over competing units to select the winner. Therefore, the proposed networks are explicitly designed to extract input data representations of sparse stochastic nature, as opposed to the currently standard deterministic representation paradigm. Our approach produces state-of-the-art predictive accuracy on few-shot image classification and regression experiments, as well as reduced predictive error on an active learning setting; these improvements come with an immensely reduced computational cost.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 45 references that are in the map. First posted on arXiv 2 Aug 2022.

Builds on

29 of 45 references.

References · 29

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2013Auto-Encoding Variational Bayescited by 3,980
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  6. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  7. 2016TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systemscited by 660
  8. 2016Learning to learn by gradient descent by gradient descentcited by 616
  9. 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
  10. 2018Meta-Learning: A Surveycited by 254
  11. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
  12. 2019Meta-Learning Representations for Continual Learningcited by 189
17 more
  1. 2018Recasting Gradient-Based Meta-Learning as Hierarchical Bayescited by 180
  2. 2016Towards a Neural Statisticiancited by 119
  3. 2020The Ingredients of Real-World Robotic Reinforcement Learningcited by 111
  4. 2018Meta-Learning Probabilistic Inference For Predictioncited by 108
  5. 2017Building machines that adapt and compute like brainscited by 99
  6. 2020Meta-Learning with Adaptive Hyperparameterscited by 79
  7. 2017Few-Shot Learning Through an Information Retrieval Lenscited by 51
  8. 2021Stochastic Transformer Networks with Linear Competing Units: Application to end-to-end SL Translationcited by 35
  9. 2019Modular Meta-Learning with Shrinkagecited by 31
  10. 2018Nonparametric Bayesian Deep Networks with Local Competitioncited by 17
  11. 2020Predictive Complexity Priorscited by 14
  12. 2021Local Competition and Stochasticity for Adversarial Robustness in Deep Learningcited by 12
  13. 2019Hierarchical Indian Buffet Neural Networks for Bayesian Continual Learningcited by 11
  14. 2020Human vs. supervised machine learning: Who learns patterns faster?cited by 9
  15. 2020Gradient-EM Bayesian Meta-learningcited by 7
  16. 2018Adaptive Network Sparsification with Dependent Variational Beta-Bernoulli Dropoutcited by 3
  17. 2019Fast Task-Adaptation for Tasks Labeled Using Natural Language in Reinforcement Learningcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 5; 2024: 2.

7 papers.