paper-with-me

Papers

The Computational Limits of Deep Learning

2020-07-10 · Neil C. Thompson, Kristjan Greenewald, Keeheon Lee, Gabriel F. Manso

Deep learning's recent history has been one of achievement: from triumphing over humans in the game of Go to world-leading performance in image classification, voice recognition, translation, and other tasks. But this progress has come with a voracious appetite for computing power. This article catalogs the extent of this dependency, showing that progress across a wide variety of applications is strongly reliant on increases in computing power. Extrapolating forward this reliance reveals that progress along current lines is rapidly becoming economically, technically, and environmentally unsustainable. Thus, continued progress in these applications will require dramatically more computationally-efficient methods, which will either have to come from changes to deep learning or from moving to other machine learning methods.

📄 PDF Abstract BibTeX arXiv:2007.05558

Code (1)

mit-futuretech/thecomputationallimitsofdeeplearning 공식 구현

Tasks

Deep LearningGame of Goimage-classificationImage ClassificationTranslation

Similar Papers 제목 키워드 기반

The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference

2018-07-01 · ICML 2018 7 · Hao Lu, Yuan Cao, Zhuoran Yang, Junwei Lu 외

We study the hypothesis testing problem of inferring the existence of combinatorial structures in undirected graphical models. Although there exist extensive studies on the information-theoretic limits of this probl…

Two-sample testing

Statistical Limits of Convex Relaxations

2015-03-04 · Zhaoran Wang, Quanquan Gu, Han Liu

Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite pro…

Sparse LearningStochastic Block Model

Statistical Mechanics of High-Dimensional Inference

2016-01-18 · Madhu Advani, Surya Ganguli

To model modern large-scale datasets, we need efficient algorithms to infer a set of $P$ unknown model parameters from $N$ noisy measurements. What are fundamental limits on the accuracy of parameter inference, given fin…

Bayesian Inferencecompressed sensingVocal Bursts Intensity Prediction

Exploring the limits of a base BART for multi-document summarization in the medical domain

2022-10-01 · sdp (COLING) 2022 10 · Ishmael Obonyo, Silvia Casola, Horacio Saggion

This paper is a description of our participation in the Multi-document Summarization for Literature Review (MSLR) Shared Task, in which we explore summarization models to create an automatic review of scientific results.…

Document SummarizationMulti-Document Summarization

On the Fundamental Limits of Exact Inference in Structured Prediction

2021-02-17 · Hanbyul Lee, Kevin Bello, Jean Honorio

Inference is a main task in structured prediction and it is naturally modeled with a graph. In the context of Markov random fields, noisy observations corresponding to nodes and edges are usually involved, and the goal o…

Computational EfficiencyStructured Prediction