Ashkan Norouzi-Fard
18 papers · 2016–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (22) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(12)
π€
Dynamic Duo
(10)
π
Keyword Champion
(5)
π
Renaissance Researcher
(5)
π₯
Unstoppable Β· Bronze
ποΈ
Keyword Collector
(67)
π
Century Club Β· Bronze
Top co-authors
Research topics
Mathematics & Optimization
(13)
Machine Learning
(12)
Optimization
(12)
Optimization & Theory
(7)
Application Areas
(6)
Core Methods
(6)
Computer Science
(5)
Foundations
(5)
Data Science & Analytics
(3)
Applications
(3)
Artificial Intelligence
(1)
Deep Learning
(1)
Security & Privacy
(1)
Bayesian & Probabilistic
(1)
Core AI
(1)
Keywords
submodular maximization
(8)
streaming algorithm
(7)
approximation algorithm
(7)
cardinality constraint
(5)
matroid constraint
(5)
data summarization
(4)
clustering algorithm
(3)
submodular optimization
(2)
sublinear memory
(2)
community detection
(2)
approximation guarantee
(2)
fair machine learning
(2)
correlation clustering
(2)
greedy algorithm
(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
Consistent Submodular Maximization
ICML 2024
Fairness in Submodular Maximization over a Matroid Constraint
AISTATS 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
Deletion Robust Submodular Maximization over Matroids
ICML 2022
Near-Optimal Correlation Clustering with Privacy
NeurIPS 2022
Correlation Clustering in Constant Many Parallel Rounds
ICML 2021
Fairness and Bias in Online Selection
ICML 2021
Parallel and Efficient Hierarchical k-Median Clustering
NeurIPS 2021
Streaming Belief Propagation for Community Detection
NeurIPS 2021
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NeurIPS 2020
Fast and Accurate k-means++ via Rejection Sampling
NeurIPS 2020
Fully Dynamic Algorithm for Constrained Submodular Optimization
NeurIPS 2020
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
ICML 2018
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
NeurIPS 2017
An Efficient Streaming Algorithm for the Submodular Cover Problem
NeurIPS 2016