HackerPapers

arXiv:2107.05407cs.LG

PonderNet: Learning to Ponder

Andrea Banino, Jan Balaguer, Charles Blundell

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

In standard neural networks the amount of computation used grows with the size of the inputs, but not with the complexity of the problem being learnt. To overcome this limitation we introduce PonderNet, a new algorithm that learns to adapt the amount of computation based on the complexity of the problem at hand. PonderNet learns end-to-end the number of computational steps to achieve an effective compromise between training prediction accuracy, computational cost and generalization. On a complex synthetic problem, PonderNet dramatically improves performance over previous adaptive computation methods and additionally succeeds at extrapolation tests where traditional neural networks fail. Also, our method matched the current state of the art results on a real world question and answering dataset, but using less compute. Finally, PonderNet reached state of the art results on a complex task designed to test the reasoning capabilities of neural networks.1

arXiv comments
16 pages, 2 figures, 2 tables, 8th ICML Workshop on Automated Machine Learning (2021)
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.AIArtificial Intelligence cs.CCComputational Complexity

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2023 to Oct 2023.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Reminds me of PonderNet [1], which dynamically changed how often the network did a calculation. [1]: https://arxiv.org/abs/2107.05407

      iNicView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.