6 citations · 10 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Quasi-stable Coloring for Graph Compression: Approximating Max-Flow, Linear Programs, and Centrality
Moe Kayali, Dan Suciu
We propose quasi-stable coloring, an approximate version of stable coloring. Stable coloring, also called color refinement, is a well-studied technique in graph theory for classify…
cs.LG2022★ 1 cited
Mining Robust Default Configurations for Resource-constrained AutoML
Moe Kayali, Chi Wang
Automatic machine learning (AutoML) is a key enabler of the mass deployment of the next generation of machine learning systems. A key desideratum for future ML systems is the autom…