334 citations · 1.4k across the 54 of their papers we have counts for
4 papers · 1 filter
Generalized Clustering by Learning to Optimize Expected Normalized Cuts
Azade Nazi, Will Hang, Anna Goldie +2
We introduce a novel end-to-end approach for learning to cluster in the absence of labeled examples. Our clustering objective is based on optimizing normalized cuts, a criterion wh…
GDP: Generalized Device Placement for Dataflow Graphs
Yanqi Zhou, Sudip Roy, Amirali Abdolrashidi +8
Runtime and scalability of large neural networks can be significantly affected by the placement of operations in their dataflow graphs on suitable devices. With increasingly comple…
Reinforcement Learning Driven Heuristic Optimization
Qingpeng Cai, Will Hang, Azalia Mirhoseini +3
Heuristic algorithms such as simulated annealing, Concorde, and METIS are effective and widely used approaches to find solutions to combinatorial optimization problems. However, th…
GAP: Generalizable Approximate Graph Partitioning Framework
Azade Nazi, Will Hang, Anna Goldie +2
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, ma…