Morteza Zadimoghaddam
19 papers · 2010–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
π§ Keyword Pioneer π£ Hot Topic Early Bird πΊοΈ Taxonomy Completionist (12) π Interdisciplinary Bridge π Conference Polyglot (4)
π
Interdisciplinary Bridge
π§
Keyword Pioneer
π£
Hot Topic Early Bird
π¬
Deep Specialist
(12)
π§¬
Topic Evolution
π
Keyword Champion
ποΈ
Keyword Collector
(62)
π
Trend Setter
π
Century Club
(19)
π₯
Unstoppable
(6)
Conferences
ICML (12)
NIPS (5)
AISTATS (1)
JMLR (1)
Top co-authors
Keywords
submodular maximization
(8)
data summarization
(6)
streaming algorithm
(5)
approximation algorithm
(5)
matroid constraint
(4)
distributed algorithm
(4)
greedy algorithm
(4)
cardinality constraint
(3)
feature selection
(2)
distributed optimization
(2)
deletion robustness
(2)
submodular optimization
(2)
memory footprint
(2)
don't-know predictions
(1)
concept class
(1)
map inference
(1)
online advertising
(1)
online learning
(1)
privacy preservation
(1)
k-means clustering
(1)
Papers
Deletion Robust Non-Monotone Submodular Maximization over Matroids
JMLR 2025
Scalable Private Partition Selection via Adaptive Weighting
ICML 2025
Consistent Submodular Maximization
ICML 2024
Fully Dynamic Submodular Maximization over Matroids
ICML 2023
Deletion Robust Submodular Maximization over Matroids
ICML 2022
Online MAP Inference of Determinantal Point Processes
NIPS 2020
Sliding Window Algorithms for k-Clustering Problems
NIPS 2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
NIPS 2020
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
ICML 2019
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
ICML 2019
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy
ICML 2018
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints
ICML 2018
Data Summarization at Scale: A Two-Stage Submodular Approach
ICML 2018
Probabilistic Submodular Maximization in Sub-Linear Time
ICML 2017
Horizontally Scalable Submodular Maximization
ICML 2016
Greedy Column Subset Selection: New Bounds and Distributed Algorithms
ICML 2016
Fast Distributed Submodular Cover: Public-Private Data Summarization
NIPS 2016
Sparse Solutions to Nonnegative Linear Systems and Applications
AISTATS 2015
Trading off Mistakes and Don't-Know Predictions
NIPS 2010