|
Poster
|
Mon 18:30
|
A New Alternating Direction Method for Linear Programming
Sinong Wang · Ness Shroff
|
|
|
Poster
|
Wed 18:30
|
Safe Adaptive Importance Sampling
Sebastian Stich · Anant Raj · Martin Jaggi
|
|
|
Poster
|
Wed 18:30
|
Stochastic and Adversarial Online Learning without Hyperparameters
Ashok Cutkosky · Kwabena A Boahen
|
|
|
Poster
|
Wed 18:30
|
A Universal Analysis of Large-Scale Regularized Least Squares Solutions
Ashkan Panahi · Babak Hassibi
|
|
|
Poster
|
Tue 18:30
|
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
Quentin Berthet · Vianney Perchet
|
|
|
Poster
|
Wed 18:30
|
Straggler Mitigation in Distributed Optimization Through Data Encoding
Can Karakus · Yifan Sun · Suhas Diggavi · Wotao Yin
|
|
|
Poster
|
Wed 18:30
|
Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex
Chaobing Song · Shaobo Cui · Yong Jiang · Shu-Tao Xia
|
|
|
Poster
|
Mon 18:30
|
First-Order Adaptive Sample Size Methods to Reduce Complexity of Empirical Risk Minimization
Aryan Mokhtari · Alejandro Ribeiro
|
|
|
Poster
|
Tue 18:30
|
On Optimal Generalizability in Parametric Learning
Ahmad Beirami · Meisam Razaviyayn · Shahin Shahrampour · Vahid Tarokh
|
|
|
Poster
|
Wed 18:30
|
ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization
Yi Xu · Mingrui Liu · Qihang Lin · Tianbao Yang
|
|
|
Poster
|
Wed 18:30
|
Efficient Online Linear Optimization with Approximation Algorithms
Dan Garber
|
|
|
Poster
|
Mon 18:30
|
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms
Cong Han Lim · Stephen Wright
|
|
