default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbolfazl Hashemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Ege C. Kaya, Michael Hibbard, Takashi Tanaka, Ufuk Topcu, Abolfazl Hashemi:
Randomized greedy methods for weak submodular sensor selection with robustness considerations. Autom. 171: 111984 (2025)- 2024
- [j11]Niklas T. Lauffer
, Mahsa Ghasemi, Abolfazl Hashemi, Yagiz Savas, Ufuk Topcu:
No-Regret Learning in Dynamic Stackelberg Games. IEEE Trans. Autom. Control. 69(3): 1418-1431 (2024) - [c31]Zhankun Luo, Abolfazl Hashemi:
Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regression. ICML 2024 - [c30]Deepak Ravikumar, Efstathia Soufleri, Abolfazl Hashemi, Kaushik Roy:
Unveiling Privacy, Memorization, and Input Curvature Links. ICML 2024 - [i31]Deepak Ravikumar, Efstathia Soufleri, Abolfazl Hashemi, Kaushik Roy:
Unveiling Privacy, Memorization, and Input Curvature Links. CoRR abs/2402.18726 (2024) - [i30]Vishnu Pandi Chellapandi, Antesh Upadhyay, Abolfazl Hashemi, Stanislaw H. Zak:
FedNMUT - Federated Noisy Model Update Tracking Convergence Analysis. CoRR abs/2403.13247 (2024) - [i29]Ege C. Kaya, Michael Hibbard, Takashi Tanaka, Ufuk Topcu, Abolfazl Hashemi:
Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations. CoRR abs/2404.03740 (2024) - [i28]Ege C. Kaya, Abolfazl Hashemi:
Localized Distributional Robustness in Submodular Multi-Task Subset Selection. CoRR abs/2404.03759 (2024) - [i27]Sai Aparna Aketi, Abolfazl Hashemi, Kaushik Roy:
AdaGossip: Adaptive Consensus Step-size for Decentralized Deep Learning with Communication Compression. CoRR abs/2404.05919 (2024) - [i26]Guangchen Lan, Dong-Jun Han, Abolfazl Hashemi, Vaneet Aggarwal, Christopher G. Brinton:
Asynchronous Federated Reinforcement Learning with Policy Gradient Updates: Algorithm Design and Convergence Analysis. CoRR abs/2404.08003 (2024) - [i25]Sang Bin Moon, Abolfazl Hashemi:
Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes. CoRR abs/2405.02188 (2024) - [i24]Zhankun Luo, Abolfazl Hashemi:
Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regression. CoRR abs/2405.18237 (2024) - [i23]Andrés Catalino Castillo Jiménez, Ege C. Kaya, Lintao Ye, Abolfazl Hashemi:
Submodular Maximization Approaches for Equitable Client Selection in Federated Learning. CoRR abs/2408.13683 (2024) - 2023
- [j10]Ege C. Kaya, Mehmet Berk Sahin, Abolfazl Hashemi:
Communication-Efficient Zeroth-Order Distributed Online Optimization: Algorithm, Theory, and Applications. IEEE Access 11: 61173-61191 (2023) - [j9]Antesh Upadhyay, Abolfazl Hashemi:
Improved Convergence Analysis and SNR Control Strategies for Federated Learning in the Presence of Noise. IEEE Access 11: 63398-63416 (2023) - [j8]Vishnu Pandi Chellapandi, Antesh Upadhyay, Abolfazl Hashemi, Stanislaw H. Zak:
On the Convergence of Decentralized Federated Learning Under Imperfect Information Sharing. IEEE Control. Syst. Lett. 7: 2982-2987 (2023) - [c29]Andrés C. Castillo J., Ege C. Kaya, Abolfazl Hashemi:
High Probability Guarantees for Submodular Maximization via Boosted Stochastic Greedy. ACSSC 2023: 602-606 - [c28]Antesh Upadhyay, Abolfazl Hashemi:
Noisy Communication of Information in Federated Learning: An Improved Convergence Analysis. ACSSC 2023: 666-669 - [c27]Abolfazl Hashemi, Antesh Upadhyay:
Predictive Estimation for Reinforcement Learning with Time-Varying Reward Functions. ACSSC 2023: 1377-1380 - [c26]Ege C. Kaya, Abolfazl Hashemi:
Relative Entropy Regularization for Robust Submodular Multi-Task Subset Selection. Allerton 2023: 1-8 - [c25]Sravani Ramishetty, Abolfazl Hashemi:
High Probability Guarantees For Federated Learning. Allerton 2023: 1-8 - [c24]Michael Hibbard, Abolfazl Hashemi, Takashi Tanaka, Ufuk Topcu:
Randomized Greedy Algorithms for Sensor Selection in Large-Scale Satellite Constellations. ACC 2023: 4276-4283 - [c23]Yiyue Chen, Abolfazl Hashemi, Haris Vikalo:
Accelerated Distributed Stochastic Non-Convex Optimization over Time-Varying Directed Networks. ICASSP 2023: 1-5 - [c22]Ege C. Kaya, Mehmet Berk Sahin, Abolfazl Hashemi:
Communication-Constrained Exchange of Zeroth-Order Information with Application to Collaborative Target Tracking. ICASSP 2023: 1-5 - [c21]Sai Aparna Aketi, Abolfazl Hashemi, Kaushik Roy:
Global Update Tracking: A Decentralized Learning Algorithm for Heterogeneous Data. NeurIPS 2023 - [i22]Vishnu Pandi Chellapandi, Antesh Upadhyay, Abolfazl Hashemi, Stanislaw H. Zak:
On the Convergence of Decentralized Federated Learning Under Imperfect Information Sharing. CoRR abs/2303.10695 (2023) - [i21]Sai Aparna Aketi, Abolfazl Hashemi, Kaushik Roy:
Global Update Tracking: A Decentralized Learning Algorithm for Heterogeneous Data. CoRR abs/2305.04792 (2023) - [i20]Ege C. Kaya, Mehmet Berk Sahin, Abolfazl Hashemi:
Communication-Efficient Zeroth-Order Distributed Online Optimization: Algorithm, Theory, and Applications. CoRR abs/2306.05655 (2023) - [i19]Antesh Upadhyay, Abolfazl Hashemi:
Improved Convergence Analysis and SNR Control Strategies for Federated Learning in the Presence of Noise. CoRR abs/2307.07406 (2023) - 2022
- [j7]Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo, Gonzalo Mateos:
Towards accelerated greedy sampling and reconstruction of bandlimited graph signals. Signal Process. 195: 108505 (2022) - [j6]Yiyue Chen, Abolfazl Hashemi, Haris Vikalo:
Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization Over Time-Varying Directed Graphs. IEEE Trans. Autom. Control. 67(12): 6583-6594 (2022) - [j5]Abolfazl Hashemi, Anish Acharya, Rudrajit Das, Haris Vikalo, Sujay Sanghavi, Inderjit S. Dhillon:
On the Benefits of Multiple Gossip Steps in Communication-Constrained Decentralized Federated Learning. IEEE Trans. Parallel Distributed Syst. 33(11): 2727-2739 (2022) - [j4]Abolfazl Hashemi, Haris Vikalo, Gustavo de Veciana:
On the Benefits of Progressively Increasing Sampling Sizes in Stochastic Greedy Weak Submodular Maximization. IEEE Trans. Signal Process. 70: 3978-3992 (2022) - [c20]Anish Acharya, Abolfazl Hashemi, Prateek Jain, Sujay Sanghavi, Inderjit S. Dhillon, Ufuk Topcu:
Robust Training in High Dimensions via Block Coordinate Geometric Median Descent. AISTATS 2022: 11145-11168 - [c19]Rudrajit Das, Anish Acharya, Abolfazl Hashemi, Sujay Sanghavi, Inderjit S. Dhillon, Ufuk Topcu:
Faster non-convex federated learning via global and local momentum. UAI 2022: 496-506 - [i18]Niklas T. Lauffer, Mahsa Ghasemi, Abolfazl Hashemi, Yagiz Savas, Ufuk Topcu:
No-Regret Learning in Dynamic Stackelberg Games. CoRR abs/2202.04786 (2022) - 2021
- [j3]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
Randomized Greedy Sensor Selection: Leveraging Weak Submodularity. IEEE Trans. Autom. Control. 66(1): 199-212 (2021) - [c18]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Online Learning with Implicit Exploration in Episodic Markov Decision Processes. ACC 2021: 1953-1958 - [c17]Abolfazl Hashemi, Haris Vikalo, Gustavo de Veciana:
On the Performance-Complexity Tradeoff in Stochastic Greedy Weak Submodular Optimization. ICASSP 2021: 3540-3544 - [c16]Yiyue Chen, Abolfazl Hashemi, Haris Vikalo:
Decentralized Optimization on Time-Varying Directed Graphs Under Communication Constraints. ICASSP 2021: 3670-3674 - [c15]Yagiz Savas, Abolfazl Hashemi, Abraham P. Vinod, Brian M. Sadler, Ufuk Topcu:
Physical-Layer Security via Distributed Beamforming in the Presence of Adversaries with Unknown Locations. ICASSP 2021: 4685-4689 - [c14]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
No-regret learning with high-probability in adversarial Markov decision processes. UAI 2021: 992-1001 - [i17]Yiyue Chen, Abolfazl Hashemi, Haris Vikalo:
Communication-Efficient Variance-Reduced Decentralized Stochastic Optimization over Time-Varying Directed Graphs. CoRR abs/2101.09583 (2021) - [i16]Abolfazl Hashemi, Hayden Schaeffer, Robert Shi, Ufuk Topcu, Giang Tran, Rachel A. Ward:
Function Approximation via Sparse Random Features. CoRR abs/2103.03191 (2021) - [i15]Rudrajit Das, Abolfazl Hashemi, Sujay Sanghavi, Inderjit S. Dhillon:
DP-NormFedAvg: Normalizing Client Updates for Privacy-Preserving Federated Learning. CoRR abs/2106.07094 (2021) - [i14]Anish Acharya, Abolfazl Hashemi, Prateek Jain, Sujay Sanghavi, Inderjit S. Dhillon, Ufuk Topcu:
Robust Training in High Dimensions via Block Coordinate Geometric Median Descent. CoRR abs/2106.08882 (2021) - [i13]Farzan Memarian, Abolfazl Hashemi, Scott Niekum, Ufuk Topcu:
Robust Generative Adversarial Imitation Learning via Local Lipschitzness. CoRR abs/2107.00116 (2021) - 2020
- [c13]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Identifying Sparse Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach. ACC 2020: 1093-1098 - [i12]Yiyue Chen, Abolfazl Hashemi, Haris Vikalo:
Communication-Efficient Algorithms for Decentralized Optimization Over Directed Graphs. CoRR abs/2005.13189 (2020) - [i11]Abolfazl Hashemi, Anish Acharya, Rudrajit Das, Haris Vikalo, Sujay Sanghavi, Inderjit S. Dhillon:
On the Benefits of Multiple Gossip Steps in Communication-Constrained Decentralized Optimization. CoRR abs/2011.10643 (2020) - [i10]Rudrajit Das, Abolfazl Hashemi, Sujay Sanghavi, Inderjit S. Dhillon:
Improved Convergence Rates for Non-Convex Federated Learning with Compression. CoRR abs/2012.04061 (2020)
2010 – 2019
- 2019
- [c12]Mahsa Ghasemi, Abolfazl Hashemi, Ufuk Topcu, Haris Vikalo:
On Submodularity of Quadratic Observation Selection in Constrained Networked Sensing Systems. ACC 2019: 4671-4676 - [c11]Rasoul Shafipour, Abolfazl Hashemi, Gonzalo Mateos, Haris Vikalo:
Online Topology Inference from Streaming Stationary Graph Signals. DSW 2019: 140-144 - [c10]Abolfazl Hashemi, Haris Vikalo:
Evolutionary Subspace Clustering: Discovering Structure in Self-expressive Time-series Data. ICASSP 2019: 3707-3711 - [c9]Shorya Consul, Abolfazl Hashemi, Haris Vikalo:
A Map Framework for Support Recovery of Sparse Signals Using Orthogonal Least Squares. ICASSP 2019: 5127-5131 - [c8]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
Submodular Observation Selection and Information Gathering for Quadratic Models. ICML 2019: 2653-2662 - [i9]Gustavo de Veciana, Abolfazl Hashemi, Haris Vikalo:
Stochastic-Greedy++: Closing the Optimality Gap in Exact Weak Submodular Maximization. CoRR abs/1907.09064 (2019) - [i8]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Identifying Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach. CoRR abs/1909.12898 (2019) - 2018
- [j2]Abolfazl Hashemi, Haris Vikalo:
Accelerated orthogonal least-squares for large-scale sparse reconstruction. Digit. Signal Process. 82: 91-105 (2018) - [j1]Abolfazl Hashemi, Haris Vikalo:
Evolutionary Self-Expressive Models for Subspace Clustering. IEEE J. Sel. Top. Signal Process. 12(6): 1534-1546 (2018) - [c7]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks. ACC 2018: 1027-1032 - [c6]Abolfazl Hashemi, Osman Fatih Kiliç, Haris Vikalo:
Near-Optimal Distributed Estimation for a Network of Sensing Units Operating Under Communication Constraints. CDC 2018: 2890-2895 - [c5]Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo, Gonzalo Mateos:
A Novel Scheme for Support Identification and Iterative Sampling of Bandlimited Graph Signals. GlobalSIP 2018: 778-782 - [c4]Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo, Gonzalo Mateos:
Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation. ICASSP 2018: 4179-4183 - [i7]Abolfazl Hashemi, Haris Vikalo:
Evolutionary Self-Expressive Models for Subspace Clustering. CoRR abs/1810.11957 (2018) - 2017
- [c3]Abolfazl Hashemi, Banghua Zhu, Haris Vikalo:
Sparse Tensor Decomposition for Haplotype Assembly of Diploids and Polyploids. BCB 2017: 764-765 - [c2]Abolfazl Hashemi, Haris Vikalo:
Recovery of sparse signals via Branch and Bound Least-Squares. ICASSP 2017: 4760-4764 - [i6]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks. CoRR abs/1709.08823 (2017) - [i5]Abolfazl Hashemi, Haris Vikalo:
Accelerated Sparse Subspace Clustering. CoRR abs/1711.00126 (2017) - [i4]Abolfazl Hashemi, Rasoul Shafipour, Haris Vikalo, Gonzalo Mateos:
Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation. CoRR abs/1711.00142 (2017) - 2016
- [c1]Abolfazl Hashemi, Haris Vikalo:
Sparse linear regression via generalized orthogonal least-squares. GlobalSIP 2016: 1305-1309 - [i3]Abolfazl Hashemi, Haris Vikalo:
Sparse Linear Regression via Generalized Orthogonal Least-Squares. CoRR abs/1602.06916 (2016) - [i2]Abolfazl Hashemi, Haris Vikalo:
Sampling Requirements and Accelerated Schemes for Sparse Linear Regression with Orthogonal Least-Squares. CoRR abs/1608.02549 (2016) - [i1]Abolfazl Hashemi, Haris Vikalo:
Sparse recovery via Orthogonal Least-Squares under presence of Noise. CoRR abs/1608.02554 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
