Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow

IEEE Transactions on Visualization and Computer Graphics

Volumn 24, Issue 1, 2018, Pages 1-12

  Wongsuphasawat, Kanit ^a   Smilkov, Daniel ^b   Wexler, James ^b   Wilson, Jimbo ^b   Mané, Dandelion ^b   Fritz, Doug ^b   Krishnan, Dilip ^b   Viégas, Fernanda B ^b   Wattenberg, Martin ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b GOOGLE INC   (United States)

Author keywords

Clustered Graph; Dataflow Graph; Graph Visualization; Neural Network

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA FLOW GRAPHS; DEEP LEARNING; FLOW VISUALIZATION; GRAPH THEORY; LEARNING SYSTEMS; NEURAL NETWORKS; STANDARDS; TOOLS; VISUALIZATION;

CLUSTERED GRAPH; COMPUTATIONAL MODEL; GRAPH TRANSFORMATION; GRAPH VISUALIZATION; HIERARCHICAL STRUCTURES; INTERACTIVE DIAGRAMS; LAYOUT; MACHINE INTELLIGENCE;

DATA FLOW ANALYSIS;

EID: 85028709500     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2017.2744878     Document Type: Article

References (57)

1. colah's blog. http://colah.github.io/. Accessed: 2017-03-15.
2. ConvNetJS. http://cs.stanford.edu/people/karpathy/convnetjs/. Accessed: 2017-03-15.
3. Keras: Deep learning library for theano and tensorflow. https://keras. io/. Accessed: 2017-03-15.
4. Labview. http://www.ni.com/labview/. Accessed: 2016-03-15.
5. The TensorBoard repository on GitHub. http://github.com/tensorflow/tensorboard. Accessed: 2017-06-15.
6. M. Abadi, A. Agarwal, P. Barham, E. Brevdo, Z. Chen, C. Citro, G. S. Corrado, A. Davis, J. Dean, M. Devin, S. Ghemawat, I. Goodfellow, A. Harp, G. Irving, M. Isard, Y. Jia, R. Jozefowicz, L. Kaiser, M. Kud-lur, J. Levenberg, D. Mane, R. Monga, S. Moore, D. Murray, C. Olah, M. Schuster, J. Shlens, B. Steiner, I. Sutskever, K. Talwar, P. Tucker, V. Vanhoucke, V. Vasudevan, F. Viegas, O. Vinyals, P. Warden, M. Wat-tenberg, M. Wicke, Y. Yu, and X. Zheng. TensorFlow: Large-scale machine learning on heterogeneous systems, 2015. Software available from tensorflow.org.
7. J. Abello, F. Van Ham, and N. Krishnan. ASK-Graphview: A large scale graph visualization system. Visualization and Computer Graphics, IEEE Transactions on, 12(5):669-676, 2006.
8. D. Archambault, T. Munzner, and D. Auber. Grouseflocks: Steerable exploration of graph hierarchy space. Visualization and Computer Graphics, IEEE Transactions on, 14(4):900-913, 2008.
9. D. Archambault, H. C. Purchase, and B. Pinaud. The readability of path-preserving clusterings of graphs. In Computer Graphics Forum, volume 29, pages 1173-1182. Wiley Online Library, 2010.
10. M. Balzer and O. Deussen. Level-of-detail visualization of clustered graph layouts. In Visualization, 2007. APVIS'07. 2007 6th International Asia-Pacific Symposium on, pages 133-140. IEEE, 2007.
11. J. Bergstra, O. Breuleux, F. Bastien, P. Lamblin, R. Pascanu, G. Des-jardins, J. Turian, D. Warde-Farley, and Y. Bengio. Theano: A CPU and GPU math expression compiler. In Proceedings of the Python for scientific computing conference (SciPy), volume 4, page 3. Austin, TX, 2010.
12. M. Bostock, V. Ogievetsky, and J. Heer. D3 data-driven documents. Visualization and Computer Graphics, IEEE Transactions on, 17(12):2301-2309, 2011.
13. U. Brandes and B. Kopf. Fast and simple horizontal coordinate assignment. In Graph Drawing, pages 31-44. Springer, 2001.
14. S. P. Callahan, J. Freire, E. Santos, C. E. Scheidegger, C. T. Silva, and H. T. Vo. VisTrails: visualization meets data management. In Proceedings of the 2006ACM SIGMOD international conference on Management ofdata, pages 745-747. ACM, 2006.
15. C. Chambers, A. Raniwala, F. Perry, S. Adams, R. R. Henry, R. Bradshaw, and N. Weizenbaum. Flumejava: easy, efficient data-parallel pipelines. In ACMSigplan Notices, volume 45, pages 363-375. ACM, 2010.
16. T. Chen, M. Li, Y. Li, M. Lin, N. Wang, M. Wang, T. Xiao, B. Xu, C. Zhang, and Z. Zhang. MXNet: A flexible and efficient machine learning library for heterogeneous distributed systems. ArXiv preprint arXiv:1512.01274, 2015.
17. P. Christen. A survey of indexing techniques for scalable record linkage and deduplication. Knowledge and Data Engineering, IEEE Transactions on, 24(9):1537-1555, 2012.
18. R. Collobert, S. Bengio, and J. Mariethoz. Torch: A modular machine learning software library. Technical report, IDIAP, 2002.
19. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings ofthe Third Annual ACM Symposium on Theory ofComputing, pages 151-158. ACM, 1971.
20. E. Czaplicki. Elm: Concurrent frp for functional guis. Senior thesis, Harvard University, 2012.
21. C. Dunne and B. Shneiderman. Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pages 3247-3256. ACM, 2013.
22. T. Dwyer and Y. Koren. Dig-CoLa: directed graph layout through constrained energy minimization. In Information Visualization, 2005. INFO-VIS 2005. IEEE Symposium on, pages 65-72. IEEE, 2005.
23. T. Dwyer, Y. Koren, and K. Marriott. Drawing directed graphs using quadratic programming. IEEE Transactions on Visualization and Computer Graphics, 12(4):536-548, 2006.
24. T. Dwyer, Y. Koren, and K. Marriott. IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization andComputer Graphics, 12(5):821-828, 2006.
25. T. Dwyer, Y. Koren, and K. Marriott. Constrained graph layout by stress majorization and gradient projection. Discrete Mathematics, 309(7):1895-1908, 2009.
26. T. Dwyer, K. Marriott, and M. Wybrow. Topology preserving constrained graph layout. In International Symposium on Graph Drawing, pages 230241. Springer, 2008.
27. P. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Graph Drawing, pages 113128. Springer, 1996.
28. J. Ellson, E. R. Gansner, E. Koutsofios, S. C. North, and G. Woodhull. Graphviz and dynagraph-static and dynamic graph drawing tools. In Graph Drawing Software, pages 127-148. Springer, 2004.
29. M. Forster. Applying crossing reduction strategies to layered compound graphs. In Graph Drawing, pages 276-284. Springer, 2002.
30. E. R. Gansner, Y. Koren, and S. C. North. Topological fisheye views for visualizing large graphs. IEEE Transactions on Visualization and Computer Graphics, 11(4):457-468, 2005.
31. E. R. Gansner, E. Koutsofios, S. C. North, and G.-P. Vo. A technique for drawing directed graphs. Software Engineering, IEEE Transactions on, 19(3):214-230, 1993.
32. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In ACMSIGOPS Operating Systems Review, volume 41, pages 59-72. ACM, 2007.
33. M. Jiinger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization, pages 337-348. Springer Berlin Heidelberg, Berlin, Heidelberg, 1996.
34. A. Karpathy, J. Johnson, and L. Fei-Fei. Visualizing and understanding recurrent networks. ArXiv preprint arXiv:1506.02078, 2015.
35. S. Kieffer, T. Dwyer, K. Marriott, and M. Wybrow. Hola: Human-like orthogonal network layout. IEEE transactions on visualization and computer graphics, 22(1):349-358, 2016.
36. A. Krizhevsky, I. Sutskever, and G. E. Hinton. Imagenet classification with deep convolutional neural networks. In Advances in neural information processing systems, pages 1097-1105, 2012.
37. Y. LeCun, Y. Bengio, and G. Hinton. Deep learning. Nature, 521(7553):436-444, 2015.
38. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11):2278-2324, 1998.
39. M. Liu, J. Shi, Z. Li, C. Li, J. Zhu, and S. Liu. Towards better analysis of deep convolutional neural networks. IEEE Transactions on Visualization and Computer Graphics, 23(1):91-100, 2017.
40. K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages & Computing, 6(2):183-210, 1995.
41. D. Moritz, D. Halperin, B. Howe, and J. Heer. Perfopticon: Visual query analysis for distributed databases. In Computer Graphics Forum, volume 34, pages 71-80. Wiley Online Library, 2015.
42. D. G. Murray, M. Schwarzkopf, C. Smowton, S. Smith, A. Mad-havapeddy, and S. Hand. Ciel: A universal execution engine for distributed data-flow computing. In Proc. 8th ACM/USENIX Symposium on Networked Systems Design and Implementation, pages 113-126, 2011.
43. S. C. North and G. Woodhull. Online hierarchical graph drawing. In International Symposium on Graph Drawing, pages 232-246. Springer, 2001.
44. M. T. Orne. Demand characteristics and the concept of quasi-controls. Artifacts in Behavioral Research: Robert Rosenthal and Ralph L. Ros-now's Classic Books, page 110, 2009.
45. G. Sander. Layout of compound directed graphs. Technical report, Saarlandische Universitat und Landesbibliothek, Postfach 151141, 66041 Saarbracken, 1996.
46. A. Satyanarayan, K. Wongsuphasawat, and J. Heer. Declarative interaction design for data visualization. In Proceedings ofthe 27th annual ACM symposium on User interface software and technology, pages 669678. ACM, 2014.
47. D. Smilkov, S. Carter, D. Sculley, F. B. Viegas, and M. Wattenberg. Direct manipulation visualization of deep networks. In ICML Workshop on Visualization for Deep Learning, 2016.
48. H. Strobelt, S. Gehrmann, B. Huber, H. Pfister, and A. M. Rush. Visual analysis of hidden state dynamics in recurrent neural networks. ArXiv preprint arXiv:1606.07461, 2016.
49. K. Sugiyama and K. Misue. Visualization of structural information: Au-tomatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(4):876-892, 1991.
50. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. Systems, Man and Cybernetics, IEEE Transactions on, 11(2):109-125, 1981.
51. C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich. Going deeper with convolutions. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 1-9, 2015.
52. D. Thompson, J. Braun, and R. Ford. OpenDX: paths to visualization; materials used for learning OpenDX the open source derivative of IBM's visualization Data Explorer. Visualization and Imagery Solutions, 2004.
53. J. W. Tukey. Exploratory data analysis. 1977.
54. F. Y. Tzeng and K. L. Ma. Opening the black box-data driven visualization of neural networks. In VIS 05. IEEE Visualization, 2005., pages 383-390, Oct 2005.
55. F. Van Ham and J. J. Van Wijk. Interactive visualization of small world graphs. In Information Visualization, 2004. INFOVIS 2004. IEEE Symposium on, pages 199-206. IEEE, 2004.
56. F. Van Ham and M. Wattenberg. Centrality based visualization of small world graphs. In Computer Graphics Forum, volume 27, pages 975-982. Wiley Online Library, 2008.
57. V. Yoghourdjian, T. Dwyer, G. Gange, S. Kieffer, K. Klein, and K. Marriott. High-quality ultra-compact grid layout of grouped networks. IEEE transactions on visualization and computer graphics, 22(1):339-348, 2016.