32 Results

Poster
Tue 7:00 Streaming Submodular Maximization under a k-Set System Constraint
Ran Haba, Ehsan Kazemi, Moran Feldman, Amin Karbasi
Poster
Tue 7:00 Streaming k-Submodular Maximization under Noise subject to Size Constraint
Lan N. Nguyen, My T. Thai
Poster
Tue 7:00 Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
Kaito Fujii
Poster
Tue 7:00 Customizing ML Predictions for Online Algorithms
Keerti Anand, Rong Ge, Debmalya Panigrahi
Poster
Tue 8:00 Finite-Time Convergence in Continuous-Time Optimization
Orlando Romero, mouhacine Benosman
Poster
Tue 8:00 On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
Sebastian Pokutta, Mohit Singh, Alfredo Torrico
Poster
Tue 9:00 Recovery of Sparse Signals from a Mixture of Linear Samples
Soumyabrata Pal, Arya Mazumdar
Poster
Tue 9:00 Obtaining Adjustable Regularization for Free via Iterate Averaging
Jingfeng Wu, Vladimir Braverman, Lin Yang
Poster
Tue 10:00 Fully Parallel Hyperparameter Search: Reshaped Space-Filling
Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jeremy Rapin, Morgane Riviere, Fabien Teytaud, Olivier Teytaud, Nicolas Usunier
Poster
Tue 13:00 Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
Hien Le, Nicolas Gillis, Panagiotis Patrinos
Poster
Tue 13:00 Implicit differentiation of Lasso-type models for hyperparameter optimization
Quentin Bertrand, Quentin Klopfenstein, Mathieu Blondel, Samuel Vaiter, Alexandre Gramfort, Joseph Salmon
Poster
Tue 14:00 Compressive sensing with un-trained neural networks: Gradient descent finds a smooth approximation
Reinhard Heckel, Mahdi Soltanolkotabi
Poster
Tue 15:00 Invertible generative models for inverse problems: mitigating representation error and dataset bias
Muhammad Asim, Max Daniels, Oscar Leong, Ali Ahmed, Paul Hand
Poster
Wed 5:00 Optimal approximation for unconstrained non-submodular minimization
Marwa El Halabi, Stefanie Jegelka
Poster
Wed 5:00 Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems?
Hongchang Gao, Heng Huang
Poster
Wed 8:00 Safe screening rules for L0-regression from Perspective Relaxations
Alper Atamturk, Andres Gomez
Poster
Wed 10:00 Hierarchical Verification for Adversarial Robustness
Cong Han Lim, Raquel Urtasun, Ersin Yumer
Poster
Wed 12:00 Adaptive Sketching for Fast and Convergent Canonical Polyadic Decomposition
Alex Gittens, Kareem Aggour, Bülent Yener
Poster
Wed 13:00 Super-efficiency of automatic differentiation for functions defined as a minimum
Pierre Ablin, Gabriel Peyré, Thomas Moreau
Poster
Wed 14:00 Lifted Disjoint Paths with Application in Multiple Object Tracking
Andrea Hornakova, Roberto Henschel, Bodo Rosenhahn, Paul Swoboda
Poster
Wed 16:00 Optimization from Structured Samples for Coverage Functions
Wei Chen, Xiaoming Sun, Jialin Zhang, Zhijie Zhang
Poster
Wed 16:00 Online Dense Subgraph Discovery via Blurred-Graph Feedback
Yuko Kuroki, Atsushi Miyauchi, Junya Honda, Masashi Sugiyama
Poster
Thu 6:00 Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Nina Balcan, Tuomas Sandholm, Ellen Vitercik
Poster
Thu 6:00 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
Kyriakos Axiotis, Maxim Sviridenko
Poster
Thu 6:00 Upper bounds for Model-Free Row-Sparse Principal Component Analysis
Guanyi Wang, Santanu Dey
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 Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance
Yasutoshi Ida, Sekitoshi Kanai, Yasuhiro Fujiwara, Tomoharu Iwata, Koh Takeuchi, Hisashi Kashima
Poster
Thu 8:00 Coresets for Data-efficient Training of Machine Learning Models
Baharan Mirzasoleiman, Jeff Bilmes, Jure Leskovec
Poster
Thu 13:00 The FAST Algorithm for Submodular Maximization
Adam Breuer, Eric Balkanski, Yaron Singer
Poster
Thu 14:00 Parallel Algorithm for Non-Monotone DR-Submodular Maximization
Alina Ene, Huy Nguyen
Poster
Thu 17:00 On the Power of Compressed Sensing with Generative Models
Akshay Kamath, Eric Price, Sushrut Karmalkar
Poster
Thu 17:00 Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors
Zhaoqiang Liu, Selwyn Gomes, Avtansh Tiwari, Jonathan Scarlett