{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/104894"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/104894","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Machine learning workflow optimization via automatic discovery of resource reuse opportunities","abstract":"Many state-of-the-art deep learning models rely on dynamic computation logic, making them difficult to optimize. In this thesis, we present a hashing based algorithm that is able to detect and optimize computation logic common to different computation graphs. We show that our algorithm can be integrated seamlessly into popular deep learning frameworks such as TensorFlow, with nearly zero code changes required on the part of users in order to adapt our optimizations to their programs. Experiments show that our algorithm achieves 1.35× speedup on a sentiment classification task trained with the popular Tree-LSTM model.","abstract_html":"Many state-of-the-art deep learning models rely on dynamic computation logic, making them difficult to optimize. In this thesis, we present a hashing based algorithm that is able to detect and optimize computation logic common to different computation graphs. We show that our algorithm can be integrated seamlessly into popular deep learning frameworks such as TensorFlow, with nearly zero code changes required on the part of users in order to adapt our optimizations to their programs. Experiments show that our algorithm achieves 1.35× speedup on a sentiment classification task trained with the popular Tree-LSTM model.","abstract_has_math":false,"creators":["Liu, Jialin"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Parameswaran, Aditya"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019-08-23T20:00:09Z","date_published":"2019-08-23T20:00:09Z","updated_at":"2026-07-22T22:24:42Z","subjects":["Machine Learning","Deep Learning","System"],"languages":["en"],"rights":["Copyright 2019 Jialin Liu"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/104894","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Parameswaran, Aditya"]},{"key":"dc:creator","label":"Author","values":["Liu, Jialin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2019-08-23T20:00:09Z","2019-04-22","2019-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Machine Learning","Deep Learning","System"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2019 Jialin Liu"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/104894"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Many state-of-the-art deep learning models rely on dynamic computation logic, making them difficult to optimize. In this thesis, we present a hashing based algorithm that is able to detect and optimize computation logic common to different computation graphs. We show that our algorithm can be integrated seamlessly into popular deep learning frameworks such as TensorFlow, with nearly zero code changes required on the part of users in order to adapt our optimizations to their programs. Experiments show that our algorithm achieves 1.35× speedup on a sentiment classification task trained with the popular Tree-LSTM model.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Jialin Liu, accepted the attached license on 2019-04-21 at 23:04.","The student, Jialin Liu, submitted this Thesis for approval on 2019-04-21 at 23:13.","This Thesis was approved for publication on 2019-04-22 at 10:32.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13810 on 2019-08-22 at 14:45:20","Made available in DSpace on 2019-08-23T20:00:09Z (GMT). No. of bitstreams: 2 LIU-THESIS-2019.pdf: 305353 bytes, checksum: 5cf4bba1e916207383d99e1ca610b324 (MD5) LICENSE.txt: 4207 bytes, checksum: cd723e91bf6e41c7e0e0152e6cbda2ec (MD5) Previous issue date: 2019-04-22"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Machine learning workflow optimization via automatic discovery of resource reuse opportunities"]}]}],"canonical_facts":{"dc:contributor":["Parameswaran, Aditya"],"dc:creator":["Liu, Jialin"],"dc:date":["2019-08-23T20:00:09Z","2019-04-22","2019-05"],"dc:description":["Many state-of-the-art deep learning models rely on dynamic computation logic, making them difficult to optimize. In this thesis, we present a hashing based algorithm that is able to detect and optimize computation logic common to different computation graphs. We show that our algorithm can be integrated seamlessly into popular deep learning frameworks such as TensorFlow, with nearly zero code changes required on the part of users in order to adapt our optimizations to their programs. Experiments show that our algorithm achieves 1.35× speedup on a sentiment classification task trained with the popular Tree-LSTM model.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms","The student, Jialin Liu, accepted the attached license on 2019-04-21 at 23:04.","The student, Jialin Liu, submitted this Thesis for approval on 2019-04-21 at 23:13.","This Thesis was approved for publication on 2019-04-22 at 10:32.","DSpace SAF Submission Ingestion Package generated from Vireo submission #13810 on 2019-08-22 at 14:45:20","Made available in DSpace on 2019-08-23T20:00:09Z (GMT). No. of bitstreams: 2 LIU-THESIS-2019.pdf: 305353 bytes, checksum: 5cf4bba1e916207383d99e1ca610b324 (MD5) LICENSE.txt: 4207 bytes, checksum: cd723e91bf6e41c7e0e0152e6cbda2ec (MD5) Previous issue date: 2019-04-22"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/104894"],"dc:language":["en"],"dc:rights":["Copyright 2019 Jialin Liu"],"dc:subject":["Machine Learning","Deep Learning","System"],"dc:title":["Machine learning workflow optimization via automatic discovery of resource reuse opportunities"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:42Z"}