Hamed Hassani

Model-Based Robust Deep Learning

While deep learning has resulted in major breakthroughs in many applicat...
05/20/2020 ∙ by Alexander Robey, et al. ∙ 81 ∙ share

read it
Learning Q-network for Active Information Acquisition

In this paper, we propose a novel Reinforcement Learning approach for so...
10/23/2019 ∙ by Heejin Jeong, et al. ∙ 28 ∙ share

read it
Optimal Algorithms for Submodular Maximization with Distributed Constraints

We consider a class of discrete optimization problems that aim to maximi...
09/30/2019 ∙ by Alexander Robey, et al. ∙ 22 ∙ share

read it
FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization

Federated learning is a new distributed machine learning approach, where...
09/28/2019 ∙ by Amirhossein Reisizadeh, et al. ∙ 18 ∙ share

read it
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

In this paper, we propose three online algorithms for submodular maximis...
10/28/2019 ∙ by Mingrui Zhang, et al. ∙ 16 ∙ share

read it
Entropic GANs meet VAEs: A Statistical Approach to Compute Sample Likelihoods in GANs

Building on the success of deep learning, two modern approaches to learn...
10/09/2018 ∙ by Yogesh Balaji, et al. ∙ 10 ∙ share

read it
Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks

Tight estimation of the Lipschitz constant for deep neural networks (DNN...
06/12/2019 ∙ by Mahyar Fazlyab, et al. ∙ 9 ∙ share

read it
One Sample Stochastic Frank-Wolfe

One of the beauties of the projected gradient descent method lies in its...
10/10/2019 ∙ by Mingrui Zhang, et al. ∙ 7 ∙ share

read it
Black Box Submodular Maximization: Discrete and Continuous Settings

In this paper, we consider the problem of black box continuous submodula...
01/28/2019 ∙ by Lin Chen, et al. ∙ 6 ∙ share

read it
Time-Invariant LDPC Convolutional Codes

Spatially coupled codes have been shown to universally achieve the capac...
02/15/2017 ∙ by Dimitris Achlioptas, et al. ∙ 0 ∙ share

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...
03/11/2016 ∙ by Lin Chen, et al. ∙ 0 ∙ share

read it
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity

Online optimization has been a successful framework for solving large-sc...
02/22/2018 ∙ by Lin Chen, et al. ∙ 0 ∙ share

read it
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Consider a binary linear code of length N, minimum distance d_min, trans...
01/29/2018 ∙ by Hamed Hassani, et al. ∙ 0 ∙ share

read it
Stochastic Submodular Maximization: The Case of Coverage Functions

Stochastic optimization of continuous objectives is at the heart of mode...
11/05/2017 ∙ by Mohammad Reza Karimi, et al. ∙ 0 ∙ share

read it
Online Continuous Submodular Maximization

In this paper, we consider an online optimization process, where the obj...
02/16/2018 ∙ by Lin Chen, et al. ∙ 0 ∙ share

read it
Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization

This paper considers stochastic optimization problems for a large class ...
04/24/2018 ∙ by Aryan Mokhtari, et al. ∙ 0 ∙ share

read it
Discrete Sampling using Semigradient-based Product Mixtures

We consider the problem of inference in discrete probabilistic models, t...
07/04/2018 ∙ by Alkis Gotovos, et al. ∙ 0 ∙ share

read it
Quantized Decentralized Consensus Optimization

We consider the problem of decentralized consensus optimization, where t...
06/29/2018 ∙ by Amirhossein Reisizadeh, et al. ∙ 0 ∙ share

read it
Latency-Reliability Tradeoffs for State Estimation

The emerging interest in low-latency high-reliability applications, such...
10/28/2018 ∙ by Konstantinos Gatsis, et al. ∙ 0 ∙ share

read it
SPECTRE: Seedless Network Alignment via Spectral Centralities

Network alignment consists of finding a correspondence between the nodes...
11/02/2018 ∙ by Mikhail Hayhoe, et al. ∙ 0 ∙ share

read it
Channel Coding at Low Capacity

Low-capacity scenarios have become increasingly important in the technol...
11/10/2018 ∙ by Mohammad Fereydounian, et al. ∙ 0 ∙ share

read it
Stochastic Conditional Gradient++

In this paper, we develop Stochastic Continuous Greedy++ (SCG++), the fi...
02/19/2019 ∙ by Hamed Hassani, et al. ∙ 0 ∙ share

read it
Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization

How can we efficiently mitigate the overhead of gradient communications ...
02/17/2019 ∙ by Mingrui Zhang, et al. ∙ 0 ∙ share

read it
Robust and Communication-Efficient Collaborative Learning

We consider a decentralized learning problem, where a set of computing n...
07/24/2019 ∙ by Amirhossein Reisizadeh, et al. ∙ 0 ∙ share

read it
Age of Information in Random Access Channels

In applications of remote sensing, estimation, and control, timely commu...
12/03/2019 ∙ by Xingran Chen, et al. ∙ 0 ∙ share

read it
Quantized Push-sum for Gossip and Decentralized Optimization over Directed Graphs

We consider a decentralized stochastic learning problem where data point...
02/23/2020 ∙ by Hossein Taheri, et al. ∙ 0 ∙ share

read it
Precise Tradeoffs in Adversarial Training for Linear Regression

Despite breakthrough performance, modern learning models are known to be...
02/24/2020 ∙ by Adel Javanmard, et al. ∙ 0 ∙ share

read it

Hamed Hassani

Featured Co-authors

Wei Liu

Andreas Krause

Rama Chellappa

Amin Karbasi

Lin Chen

Stefanie Jegelka

Ali Jadbabaie

George J. Pappas

Soheil Feizi

Mahdi Soltanolkotabi

Yury Polyanskiy

Model-Based Robust Deep Learning

Learning Q-network for Active Information Acquisition

Optimal Algorithms for Submodular Maximization with Distributed Constraints

FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

Entropic GANs meet VAEs: A Statistical Approach to Compute Sample Likelihoods in GANs

Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks

One Sample Stochastic Frank-Wolfe

Black Box Submodular Maximization: Discrete and Continuous Settings

Time-Invariant LDPC Convolutional Codes

Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting

Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Stochastic Submodular Maximization: The Case of Coverage Functions

Online Continuous Submodular Maximization

Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization

Discrete Sampling using Semigradient-based Product Mixtures

Quantized Decentralized Consensus Optimization

Latency-Reliability Tradeoffs for State Estimation

SPECTRE: Seedless Network Alignment via Spectral Centralities

Channel Coding at Low Capacity

Stochastic Conditional Gradient++

Quantized Frank-Wolfe: Communication-Efficient Distributed Optimization

Robust and Communication-Efficient Collaborative Learning

Age of Information in Random Access Channels

Quantized Push-sum for Gossip and Decentralized Optimization over Directed Graphs

Precise Tradeoffs in Adversarial Training for Linear Regression