Search Results for author:
Found 3 papers, 1 papers with code
Generalized Clustering by Learning to Optimize Expected Normalized Cuts
We introduce a novel end-to-end approach for learning to cluster in the absence of labeled examples.
Reinforcement Learning Driven Heuristic Optimization
In this paper, we introduce a novel framework to generate better initial solutions for heuristic algorithms using reinforcement learning (RL), named RLHO.
GAP: Generalizable Approximate Graph Partitioning Framework
Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions.
Ranked #1 on
graph partitioning
on custom
Cannot find the paper you are looking for? You can
Submit a new open access paper.
