Ashkan Norouzi-Fard
18 papers · 2016–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Conference Polyglot (5) π Academic Marathon (9) π§ Keyword Pioneer π Interdisciplinary Bridge π Cross-Pollinator (5)
π
Conference Polyglot
(5)
π
Academic Marathon
(9)
πΊοΈ
Taxonomy Completionist
(23)
π€
Dynamic Duo
(10)
π
Keyword Champion
(4)
π¬
Deep Specialist
(11)
π₯
Unstoppable
(6)
ποΈ
Keyword Collector
(63)
π
Century Club
(18)
Conferences
NIPS (8)
ICML (7)
AISTATS (1)
COLT (1)
JMLR (1)
Top co-authors
Research topics
Keywords
submodular maximization
(7)
streaming algorithm
(7)
approximation algorithm
(7)
matroid constraint
(5)
cardinality constraint
(4)
data summarization
(4)
clustering algorithm
(3)
submodular optimization
(2)
sublinear memory
(2)
community detection
(2)
approximation guarantee
(2)
fair machine learning
(2)
greedy algorithm
(2)
correlation clustering
(2)
combinatorial optimization
(2)
algorithm design
(1)
machine learning
(1)
graph clustering
(1)
euclidean space
(1)
algorithmic fairness
(1)
Papers
Deletion Robust Non-Monotone Submodular Maximization over Matroids
JMLR 2025
Fairness in Submodular Maximization over a Matroid Constraint
AISTATS 2024
Consistent Submodular Maximization
ICML 2024
Fairness in Streaming Submodular Maximization over a Matroid Constraint
ICML 2023
Fully Dynamic Submodular Maximization over Matroids
ICML 2023
Approximate Cluster Recovery from Noisy Labels
COLT 2022
Near-Optimal Correlation Clustering with Privacy
NIPS 2022
Deletion Robust Submodular Maximization over Matroids
ICML 2022
Fairness and Bias in Online Selection
ICML 2021
Parallel and Efficient Hierarchical k-Median Clustering
NIPS 2021
Streaming Belief Propagation for Community Detection
NIPS 2021
Correlation Clustering in Constant Many Parallel Rounds
ICML 2021
Fully Dynamic Algorithm for Constrained Submodular Optimization
NIPS 2020
Fast and Accurate $k$-means++ via Rejection Sampling
NIPS 2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NIPS 2020
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
ICML 2018
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
NIPS 2017
An Efficient Streaming Algorithm for the Submodular Cover Problem
NIPS 2016