
-
Simultaneous Greedys: A Swiss Army Knife for Constrained Submodular Maximization
In this paper, we present SimultaneousGreedys, a deterministic algorithm...
read it
-
Multiple Descent: Design Your Own Generalization Curve
This paper explores the generalization loss of linear regression in vari...
read it
-
Continuous Submodular Maximization: Beyond DR-Submodularity
In this paper, we propose the first continuous optimization algorithms t...
read it
-
Meta Learning in the Continuous Time Limit
In this paper, we establish the ordinary differential equation (ODE) tha...
read it
-
The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization
Despite remarkable success, deep neural networks are sensitive to human-...
read it
-
More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models
Despite remarkable success in practice, modern machine learning models h...
read it
-
Submodular Maximization Through Barrier Functions
In this paper, we introduce a novel technique for constrained submodular...
read it
-
Regularized Submodular Maximization at Scale
In this paper, we propose scalable methods for maximizing a regularized ...
read it
-
Streaming Submodular Maximization under a k-Set System Constraint
In this paper, we propose a novel framework that converts streaming algo...
read it
-
Adaptivity in Adaptive Submodularity
Adaptive sequential decision making is one of the central challenges in ...
read it
-
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
In this paper, we propose three online algorithms for submodular maximis...
read it
-
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
We study the problem of switching-constrained online convex optimization...
read it
-
Batched Multi-Armed Bandits with Optimal Regret
We present a simple and efficient algorithm for the batched stochastic m...
read it
-
One Sample Stochastic Frank-Wolfe
One of the beauties of the projected gradient descent method lies in its...
read it
-
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
Streaming algorithms are generally judged by the quality of their soluti...
read it
-
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
It is generally believed that submodular functions -- and the more gener...
read it
-
Stochastic Conditional Gradient++
In this paper, we develop Stochastic Continuous Greedy++ (SCG++), the fi...
read it
-
Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization
How can we efficiently mitigate the overhead of gradient communications ...
read it
-
Adaptive Sequence Submodularity
In many machine learning applications, one needs to interactively select...
read it
-
Black Box Submodular Maximization: Discrete and Continuous Settings
In this paper, we consider the problem of black box continuous submodula...
read it
-
Unconstrained Submodular Maximization with Constant Adaptive Complexity
In this paper, we consider the unconstrained submodular maximization pro...
read it
-
Eliminating Latent Discrimination: Train Then Mask
How can we control for latent discrimination in predictive models? How c...
read it
-
Data Summarization at Scale: A Two-Stage Submodular Approach
The sheer scale of modern datasets has resulted in a dire need for summa...
read it
-
Projection-Free Bandit Convex Optimization
In this paper, we propose the first computationally efficient projection...
read it
-
Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization
This paper considers stochastic optimization problems for a large class ...
read it
-
Submodularity on Hypergraphs: From Sets to Sequences
In a nutshell, submodular functions encode an intuitive notion of dimini...
read it
-
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
Online optimization has been a successful framework for solving large-sc...
read it
-
Do Less, Get More: Streaming Submodular Maximization with Subsampling
In this paper, we develop the first one-pass streaming algorithm for sub...
read it
-
Comparison Based Learning from Weak Oracles
There is increasing interest in learning algorithms that involve interac...
read it
-
Online Continuous Submodular Maximization
In this paper, we consider an online optimization process, where the obj...
read it
-
Deletion-Robust Submodular Maximization at Scale
Can we efficiently extract useful information from a large user-generate...
read it
-
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
Submodular functions are a broad class of set functions, which naturally...
read it
-
Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
In many machine learning applications, it is important to explain the pr...
read it
-
Estimating the Size of a Large Network and its Communities from a Random Sample
Most real-world networks are too large to be measured or studied directl...
read it
-
Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning
Faced with massive data, is it possible to trade off (statistical) risk,...
read it
-
Submodular Variational Inference for Network Reconstruction
In real-world and online social networks, individuals receive and transm...
read it
-
Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting
In this paper, we consider the problem of actively learning a linear cla...
read it
-
Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling
Learning about the social structure of hidden and hard-to-reach populati...
read it
-
Fast Mixing for Discrete Point Processes
We investigate the systematic mechanism for designing fast mixing Markov...
read it
-
Distributed Submodular Maximization
Many large-scale machine learning problems--clustering, non-parametric l...
read it
-
Convolutional Neural Associative Memories: Massive Capacity with Noise Tolerance
The task of a neural associative memory is to retrieve a set of previous...
read it
-
Noise Facilitation in Associative Memories of Exponential Capacity
Recent advances in associative memory design through structured pattern ...
read it
-
Near Optimal Bayesian Active Learning for Decision Making
How should we gather information to make effective decisions? We address...
read it
-
Neural Networks Built from Unreliable Components
Recent advances in associative memory design through strutured pattern s...
read it
-
Coupled Neural Associative Memories
We propose a novel architecture to design a neural associative memory th...
read it
-
Comparison-Based Learning with Rank Nets
We consider the problem of search through comparisons, where a user is p...
read it
-
Multi-Level Error-Resilient Neural Networks with Learning
The problem of neural network association is to retrieve a previously me...
read it
-
From Small-World Networks to Comparison-Based Search
The problem of content search through comparisons has recently received ...
read it