Pith. sign in

REVIEW 1 cited by

Helix: Holistic Optimization for Accelerating Iterative Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.05762 v1 pith:UVGF6GQY submitted 2018-12-14 cs.DB cs.LG

classification cs.DBcs.LG
keywords learninghelixmachinedevelopmentproblemcachingiterativemodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Machine learning workflow development is a process of trial-and-error: developers iterate on workflows by testing out small modifications until the desired accuracy is achieved. Unfortunately, existing machine learning systems focus narrowly on model training---a small fraction of the overall development time---and neglect to address iterative development. We propose Helix, a machine learning system that optimizes the execution across iterations---intelligently caching and reusing, or recomputing intermediates as appropriate. Helix captures a wide variety of application needs within its Scala DSL, with succinct syntax defining unified processes for data preprocessing, model specification, and learning. We demonstrate that the reuse problem can be cast as a Max-Flow problem, while the caching problem is NP-Hard. We develop effective lightweight heuristics for the latter. Empirical evaluation shows that Helix is not only able to handle a wide variety of use cases in one unified workflow but also much faster, providing run time reductions of up to 19x over state-of-the-art systems, such as DeepDive or KeystoneML, on four real-world applications in natural language processing, computer vision, social and natural sciences.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Lineage Constraints for Data Science Operations

    cs.DB 2025-06 conditional novelty 6.0 of 10

    XProv is a proposed architecture that uses lineage-constraint tags and small-sample learning to capture cross-library data lineage with uncertainty.

Pith tools