Search Results for author: Will Hang

Found 3 papers, 1 papers with code

Generalized Clustering by Learning to Optimize Expected Normalized Cuts

no code implementations16 Oct 2019 Azade Nazi, Will Hang, Anna Goldie, Sujith Ravi, Azalia Mirhoseini

We introduce a novel end-to-end approach for learning to cluster in the absence of labeled examples.

Reinforcement Learning Driven Heuristic Optimization

no code implementations16 Jun 2019 Qingpeng Cai, Will Hang, Azalia Mirhoseini, George Tucker, Jingtao Wang, Wei Wei

In this paper, we introduce a novel framework to generate better initial solutions for heuristic algorithms using reinforcement learning (RL), named RLHO.

Combinatorial Optimization reinforcement-learning

GAP: Generalizable Approximate Graph Partitioning Framework

1 code implementation2 Mar 2019 Azade Nazi, Will Hang, Anna Goldie, Sujith Ravi, Azalia Mirhoseini

Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions.

graph partitioning

Cannot find the paper you are looking for? You can Submit a new open access paper.