License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SNAPL.2019.1
URN: urn:nbn:de:0030-drops-105440
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10544/
Carbin, Michael
Overparameterization: A Connection Between Software 1.0 and Software 2.0
Abstract
A new ecosystem of machine-learning driven applications, titled Software 2.0, has arisen that integrates neural networks into a variety of computational tasks. Such applications include image recognition, natural language processing, and other traditional machine learning tasks. However, these techniques have also grown to include other structured domains, such as program analysis and program optimization for which novel, domain-specific insights mate with model design. In this paper, we connect the world of Software 2.0 with that of traditional software - Software 1.0 - through overparameterization: a program may provide more computational capacity and precision than is necessary for the task at hand.
In Software 2.0, overparamterization - when a machine learning model has more parameters than datapoints in the dataset - arises as a contemporary understanding of the ability for modern, gradient-based learning methods to learn models over complex datasets with high-accuracy. Specifically, the more parameters a model has, the better it learns.
In Software 1.0, the results of the approximate computing community show that traditional software is also overparameterized in that software often simply computes results that are more precise than is required by the user. Approximate computing exploits this overparameterization to improve performance by eliminating unnecessary, excess computation. For example, one - of many techniques - is to reduce the precision of arithmetic in the application.
In this paper, we argue that the gap between available precision and that that is required for either Software 1.0 or Software 2.0 is a fundamental aspect of software design that illustrates the balance between software designed for general-purposes and domain-adapted solutions. A general-purpose solution is easier to develop and maintain versus a domain-adapted solution. However, that ease comes at the expense of performance.
We show that the approximate computing community and the machine learning community have developed overlapping techniques to improve performance by reducing overparameterization. We also show that because of these shared techniques, questions, concerns, and answers on how to construct software can translate from one software variant to the other.
BibTeX - Entry
@InProceedings{carbin:LIPIcs.SNAPL.2019.1,
author = {Carbin, Michael},
title = {{Overparameterization: A Connection Between Software 1.0 and Software 2.0}},
booktitle = {3rd Summit on Advances in Programming Languages (SNAPL 2019)},
pages = {1:1--1:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-113-9},
ISSN = {1868-8969},
year = {2019},
volume = {136},
editor = {Lerner, Benjamin S. and Bod{\'\i}k, Rastislav and Krishnamurthi, Shriram},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/10544},
URN = {urn:nbn:de:0030-drops-105440},
doi = {10.4230/LIPIcs.SNAPL.2019.1},
annote = {Keywords: Approximate Computing, Machine Learning, Software 2.0}
}
|
Keywords: |
|
Approximate Computing, Machine Learning, Software 2.0 |
|
Collection: |
|
3rd Summit on Advances in Programming Languages (SNAPL 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
11.07.2019 |
