Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dan Mané

dblp:177/9158 · also Dandelion Mané · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › data augmentation
automated augmentation policy search
0.412019
AutoAugment: Learning Augmentation Strategies From Data · CVPR 2019
Machine learning › Deep learning architectures and training
data augmentation
0.412019
AutoAugment: Learning Augmentation Strategies From Data · CVPR 2019
Visualization and visual analytics › software visualization
data-flow visualization
0.312018
Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow · IEEE Trans. Vis. Comput. Graph. 2018
Visualization and visual analytics › visual analytics › machine learning visualization
deep learning visualization
0.312018
Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow · IEEE Trans. Vis. Comput. Graph. 2018

Methods — techniques the papers use, named apart from their topics

search algorithm · 0.4reinforcement learning · 0.4graph transformation · 0.3graph clustering · 0.3edge bundling · 0.3
YearPublicationVenuePosition
2019 AutoAugment: Learning Augmentation Strategies From Data
abstract
Data augmentation is an effective technique for improving the accuracy of modern image classifiers. However, current data augmentation implementations are manually designed. In this paper, we describe a simple procedure called AutoAugment to automatically search for improved data augmentation policies. In our implementation, we have designed a search space where a policy consists of many sub-policies, one of which is randomly chosen for each image in each mini-batch. A sub-policy consists of two operations, each operation being an image processing function such as translation, rotation, or shearing, and the probabilities and magnitudes with which the functions are applied. We use a search algorithm to find the best policy such that the neural network yields the highest validation accuracy on a target dataset. Our method achieves state-of-the-art accuracy on CIFAR-10, CIFAR-100, SVHN, and ImageNet (without additional data). On ImageNet, we attain a Top-1 accuracy of 83.5% which is 0.4% better than the previous record of 83.1%. On CIFAR-10, we achieve an error rate of 1.5%, which is 0.6% better than the previous state-of-the-art. Augmentation policies we find are transferable between datasets. The policy learned on ImageNet transfers well to achieve significant improvements on other datasets, such as Oxford Flowers, Caltech-101, Oxford-IIT Pets, FGVC Aircraft, and Stanford Cars.
Ekin Dogus Cubuk, Barret Zoph, Dan Mané, Vijay Vasudevan, Quoc V. Le
CVPR3
2018 Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow
abstract
We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.
Kanit Wongsuphasawat, Daniel Smilkov, James Wexler, Jimbo Wilson, Dan Mané, Doug Fritz, Dilip Krishnan, Fernanda B. Viégas, Martin Wattenberg
IEEE Trans. Vis. Comput. Graph.5