Poster
|
Wed 16:00
|
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Yuko Kuroki · Atsushi Miyauchi · Junya Honda · Masashi Sugiyama
|
|
Poster
|
Thu 6:00
|
Linear Lower Bounds and Conditioning of Differentiable Games
Adam Ibrahim · Waïss Azizian · Gauthier Gidel · Ioannis Mitliagkas
|
|
Poster
|
Thu 6:00
|
Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Nina Balcan · Tuomas Sandholm · Ellen Vitercik
|
|
Poster
|
Wed 5:00
|
Learning What to Defer for Maximum Independent Sets
Sungsoo Ahn · Younggyo Seo · Jinwoo Shin
|
|
Poster
|
Wed 5:00
|
On Validation and Planning of An Optimal Decision Rule with Application in Healthcare Studies
Hengrui Cai · Wenbin Lu · Rui Song
|
|
Poster
|
Tue 7:00
|
Searching to Exploit Memorization Effect in Learning with Noisy Labels
QUANMING YAO · Hansi Yang · Bo Han · Gang Niu · James Kwok
|
|
Poster
|
Wed 5:00
|
Optimal approximation for unconstrained non-submodular minimization
Marwa El Halabi · Stefanie Jegelka
|
|
Poster
|
Tue 7:00
|
Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees
Sen Na · Yuwei Luo · Zhuoran Yang · Zhaoran Wang · Mladen Kolar
|
|
Poster
|
Wed 13:00
|
Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimization
Vien Mai · Mikael Johansson
|
|
Poster
|
Wed 5:00
|
Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems?
Hongchang Gao · Heng Huang
|
|
Poster
|
Thu 6:00
|
Upper bounds for Model-Free Row-Sparse Principal Component Analysis
Guanyi Wang · Santanu Dey
|
|
Poster
|
Tue 7:00
|
Accelerated Stochastic Gradient-free and Projection-free Methods
Feihu Huang · Lue Tao · Songcan Chen
|
|