Zadimoghaddam, Morteza

22 publications

JMLR 2025 Deletion Robust Non-Monotone Submodular Maximization over Matroids Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
NeurIPS 2025 GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility Matthew Fahrbach, Srikumar Ramalingam, Morteza Zadimoghaddam, Sara Ahmadian, Gui Citovsky, Giulia DeSalvo
ICML 2025 Scalable Private Partition Selection via Adaptive Weighting Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam
ICML 2024 Consistent Submodular Maximization Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
ICML 2023 Fully Dynamic Submodular Maximization over Matroids Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
ICML 2022 Deletion Robust Submodular Maximization over Matroids Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
NeurIPS 2020 Fully Dynamic Algorithm for Constrained Submodular Optimization Silvio Lattanzi, Slobodan Mitrović, Ashkan Norouzi-Fard, Jakub M Tarnawski, Morteza Zadimoghaddam
NeurIPS 2020 Online MAP Inference of Determinantal Point Processes Aditya Bhaskara, Amin Karbasi, Silvio Lattanzi, Morteza Zadimoghaddam
NeurIPS 2020 Sliding Window Algorithms for K-Clustering Problems Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
ICML 2019 Non-Monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity Matthew Fahrbach, Vahab Mirrokni, Morteza Zadimoghaddam
ICML 2019 Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi
ICML 2018 Data Summarization at Scale: A Two-Stage Submodular Approach Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
ICML 2018 Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy Shipra Agrawal, Morteza Zadimoghaddam, Vahab Mirrokni
ICML 2018 Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
ICML 2017 Probabilistic Submodular Maximization in Sub-Linear Time Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi
AAAI 2017 Scalable Feature Selection via Distributed Diversity Maximization Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam
NeurIPS 2016 Fast Distributed Submodular Cover: Public-Private Data Summarization Baharan Mirzasoleiman, Morteza Zadimoghaddam, Amin Karbasi
ICML 2016 Greedy Column Subset Selection: New Bounds and Distributed Algorithms Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
ICML 2016 Horizontally Scalable Submodular Maximization Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
AISTATS 2015 Sparse Solutions to Nonnegative Linear Systems and Applications Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam
AAAI 2013 Optimal Coalition Structure Generation in Cooperative Graph Games Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam
NeurIPS 2010 Trading Off Mistakes and Don't-Know Predictions Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum