Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3077257.3077265acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

An Overreaction to the Broken Machine Learning Abstraction: The ease.ml Vision

Published: 14 May 2017 Publication History

Abstract

After hours of teaching astrophysicists TensorFlow and then see them, nevertheless, continue to struggle in the most creative way possible, we asked, What is the point of all of these efforts?
It was a warm winter afternoon, Zurich was not gloomy at all; while Seattle was sunny as usual, and Beijing's air was crystally clear. One of the authors stormed out of a Marathon meeting with biologists, and our journey of overreaction begins. We ask, Can we build a system that gets domain experts completely out of the machine learning loop? Can this system have exactly the same interface as linear regression, the bare minimum requirement of a scientist?
We started trial-and-errors and discussions with domain experts, all of whom not only have a great sense of humor but also generously offered to be our "guinea pigs." After months of exploration the architecture of our system, ease.ml, starts to get into shape---It is not as general as TensorFlow but not completely useless; in fact, many applications we are supporting can be built completely with ease.ml, and many others just need some syntax sugars. During development, we find that building ease.ml in the right way raises a series of technical challenges. In this paper, we describe our ease.ml vision, discuss each of these technical challenges, and map out our research agenda for the months and years to come.

References

[1]
Sara Cohen, Werner Nutt, and Yehoshua Sagiv. 2007. Deciding Equivalences Among Conjunctive Aggregate Queries. J. ACM (2007).
[2]
Corinna Cortes, L. D. Jackel, Sara A. Solla, Vladimir Vapnik, and John S. Denker. 1993. Learning curves: asymptotic values and rate of convergence. (1993). http://dl.acm.org/citation.cfm?id=2987189.2987231
[3]
David Haussler, Michael Kearns, H. Sebastian Seung, and Naftali Tishby. 1996. Rigorous Learning Curve Bounds from Statistical Mechanics. Machine Learning 25, 2/3 (1996), 195--236.
[4]
Diederik P. Kingma and Jimmy Ba. 2014. Adam: A Method for Stochastic Optimization. CoRR abs/1412.6980 (2014).
[5]
Arun Kumar, Jeffrey Naughton, and Jignesh M. Patel. 2015. Learning Generalized Linear Models Over Normalized Data. In SIGMOD.
[6]
Xupeng Li, Bin Cui, Yiru Chen, Wentao Wu, and Ce Zhang. 2017. MLog: Towards Declarative In-Database Machine Learning. ArXiv (2017).
[7]
Kevin Schawinski, Ce Zhang, Hantian Zhang, Lucas Fowler, and Gokula Krishnan Santhanam. 2017. Generative adversarial networks recover features in astrophysical images of galaxies beyond the deconvolution limit. Monthly Notices of the Royal Astronomical Society: Letters (2017).

Cited By

View all
  • (2024)How good are machine learning clouds? Benchmarking two snapshots over 5 yearsThe VLDB Journal10.1007/s00778-024-00842-333:3(833-857)Online publication date: 15-Mar-2024
  • (2020)Building Continuous Integration Services for Machine LearningProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403290(2407-2415)Online publication date: 23-Aug-2020
  • (2019)Towards Framework-Independent, Non-Intrusive Performance Characterization for Dataflow ComputationProceedings of the 10th ACM SIGOPS Asia-Pacific Workshop on Systems10.1145/3343737.3343743(54-60)Online publication date: 19-Aug-2019
  • Show More Cited By

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
HILDA '17: Proceedings of the 2nd Workshop on Human-In-the-Loop Data Analytics
May 2017
89 pages
ISBN:9781450350297
DOI:10.1145/3077257
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 May 2017

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

SIGMOD/PODS'17
Sponsor:

Acceptance Rates

Overall Acceptance Rate 28 of 56 submissions, 50%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)2
Reflects downloads up to 23 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)How good are machine learning clouds? Benchmarking two snapshots over 5 yearsThe VLDB Journal10.1007/s00778-024-00842-333:3(833-857)Online publication date: 15-Mar-2024
  • (2020)Building Continuous Integration Services for Machine LearningProceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3394486.3403290(2407-2415)Online publication date: 23-Aug-2020
  • (2019)Towards Framework-Independent, Non-Intrusive Performance Characterization for Dataflow ComputationProceedings of the 10th ACM SIGOPS Asia-Pacific Workshop on Systems10.1145/3343737.3343743(54-60)Online publication date: 19-Aug-2019
  • (2018)Ease.ml in actionProceedings of the VLDB Endowment10.14778/3229863.323625811:12(2054-2057)Online publication date: 1-Aug-2018
  • (2018)Ease.mlProceedings of the VLDB Endowment10.1145/3187009.317773711:5(607-620)Online publication date: 1-Jan-2018
  • (2018)Ease.mlProceedings of the VLDB Endowment10.1145/3177732.317773711:5(607-620)Online publication date: 5-Oct-2018

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media