activity
20172023
most citedFedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization

336 citations · 1.1k across the 77 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

cs.IT2018

Channel Coding at Low Capacity

Mohammad Fereydounian, Hamed Hassani, Mohammad Vahid Jamali +1

Low-capacity scenarios have become increasingly important in the technology of the Internet of Things (IoT) and the next generation of wireless networks. Such scenarios require eff…

cs.SI2018★ 4 cited

SPECTRE: Seedless Network Alignment via Spectral Centralities

Mikhail Hayhoe, Francisco Barreras, Hamed Hassani +1

Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applica…

math.OC2018

Latency-Reliability Tradeoffs for State Estimation

Konstantinos Gatsis, Hamed Hassani, George J. Pappas

The emerging interest in low-latency high-reliability applications, such as connected vehicles, necessitates a new abstraction between communication and control. Thanks to advances…

cs.LG2018★ 13 cited

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

Yogesh Balaji, Hamed Hassani, Rama Chellappa +1

Building on the success of deep learning, two modern approaches to learn a probability model from the data are Generative Adversarial Networks (GANs) and Variational AutoEncoders (…

cs.LG2018★ 143 cited

An Exact Quantized Decentralized Gradient Descent Algorithm

Amirhossein Reisizadeh, Aryan Mokhtari, Hamed Hassani +1

We consider the problem of decentralized consensus optimization, where the sum of smooth and strongly convex functions are minimized over distributed agents that form a con…

math.OC2018★ 7 cited

Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization

Aryan Mokhtari, Hamed Hassani, Amin Karbasi

This paper considers stochastic optimization problems for a large class of objective functions, including convex and continuous submodular. Stochastic proximal gradient methods hav…

stat.ML2018★ 45 cited

Online Continuous Submodular Maximization

Lin Chen, Hamed Hassani, Amin Karbasi

In this paper, we consider an online optimization process, where the objective functions are not convex (nor concave) but instead belong to a broad class of continuous submodular f…

math.OC2018★ 12 cited

Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings

Aryan Mokhtari, Hamed Hassani, Amin Karbasi

In this paper, we showcase the interplay between discrete and continuous optimization in network-structured settings. We propose the first fully decentralized optimization method f…

stat.ML2018★ 17 cited

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

Lin Chen, Christopher Harshaw, Hamed Hassani +1

Online optimization has been a successful framework for solving large-scale problems under computational constraints and partial information. Current methods for online convex opti…