|
Poster
|
Thu 14:00
|
How to tell when a clustering is (approximately) correct using convex relaxations
Marina Meila
|
|
|
Poster
|
Wed 14:00
|
Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions
Wenruo Bai · William Stafford Noble · Jeffrey A Bilmes
|
|
|
Poster
|
Thu 7:45
|
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
Kaito Fujii · Tasuku Soma
|
|
|
Poster
|
Tue 7:45
|
The Lingering of Gradients: How to Reuse Gradients Over Time
Zeyuan Allen-Zhu · David Simchi-Levi · Xinshang Wang
|
|
|
Poster
|
Wed 7:45
|
Improving Online Algorithms via ML Predictions
Manish Purohit · Zoya Svitkina · Ravi Kumar
|
|
|
Poster
|
Thu 7:45
|
Distributed k-Clustering for Data with Heavy Noise
Shi Li · Xiangyu Guo
|
|
|
Poster
|
Wed 7:45
|
Found Graph Data and Planted Vertex Covers
Austin Benson · Jon Kleinberg
|
|
|
Poster
|
Tue 14:00
|
Approximation algorithms for stochastic clustering
David Harris · Shi Li · Aravind Srinivasan · Khoa Trinh · Thomas Pensyl
|
|
|
Poster
|
Thu 7:45
|
Boolean Decision Rules via Column Generation
Sanjeeb Dash · Oktay Gunluk · Dennis Wei
|
|
|
Poster
|
Wed 14:00
|
Reinforcement Learning for Solving the Vehicle Routing Problem
MohammadReza Nazari · Afshin Oroojlooy · Lawrence Snyder · Martin Takac
|
|
|
Poster
|
Wed 14:00
|
Revisiting Decomposable Submodular Function Minimization with Incidence Relations
Pan Li · Olgica Milenkovic
|
|
|
Poster
|
Wed 14:00
|
Generalizing Graph Matching beyond Quadratic Assignment Model
Tianshu Yu · Junchi Yan · Yilin Wang · Wei Liu · baoxin Li
|
|
