Benjamin Moseley
26 papers · 2013–2025 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
🌍 Conference Polyglot (7) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🏃 Academic Marathon (12)
🌉
Interdisciplinary Bridge
🌍
Conference Polyglot
(7)
🏃
Academic Marathon
(12)
🔬
Deep Specialist
(10)
🗃️
Keyword Collector
(98)
🚀
Conference Pioneer
💎
Century Club
(26)
🔥
Unstoppable
(9)
📈
Trend Setter
⚡
Prolific Year
(5)
Conferences
NIPS (10)
ICML (5)
AAAI (4)
AISTATS (4)
ACML (1)
IJCAI (1)
JMLR (1)
Top co-authors
Keywords
approximation algorithm
(7)
hierarchical clustering
(6)
online algorithm
(4)
k-means clustering
(3)
bisecting k-mean
(3)
active search
(3)
active learning
(3)
clustering algorithm
(3)
bayesian optimal policy
(2)
approximation ratio
(2)
nonmyopic policy
(2)
competitive ratio
(2)
average linkage
(2)
machine-learned prediction
(2)
coreset construction
(2)
bayesian optimization
(2)
correlation clustering
(2)
outlier detection
(1)
uniform sampling
(1)
clustering analysis
(1)
Papers
Faster Global Minimum Cut with Predictions
ICML 2025
Binary Search with Distributional Predictions
NIPS 2024
Incremental Topological Ordering and Cycle Detection with Predictions
ICML 2024
Sampling for Beyond-Worst-Case Online Ranking
AAAI 2024
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
JMLR 2023
Min-Max Submodular Ranking for Multiple Agents
AAAI 2023
Fast Combinatorial Algorithms for Min Max Correlation Clustering
ICML 2023
Predictive Flows for Faster Ford-Fulkerson
ICML 2023
Learning-Augmented Algorithms for Online Steiner Tree
AAAI 2022
Algorithms with Prediction Portfolios
NIPS 2022
Faster Matchings via Learned Duals
NIPS 2021
Scaling Average-Linkage via Sparse Cluster Embeddings
ACML 2021
Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors
AISTATS 2021
Robust Online Correlation Clustering
NIPS 2021
Fair Hierarchical Clustering
NIPS 2020
An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means
AAAI 2020
Unconditional Coresets for Regularized Loss Minimization
AISTATS 2020
Rk-means: Fast Clustering for Relational Data
AISTATS 2020
Fast Noise Removal for k-Means Clustering
AISTATS 2020
Backprop with Approximate Activations for Memory-efficient Network Training
NIPS 2019
Cost Effective Active Search
NIPS 2019
Efficient nonmyopic batch active search
NIPS 2018
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
NIPS 2017
Efficient Nonmyopic Active Search
ICML 2017
Fast Distributed k-Center Clustering with Outliers on Massive Data
NIPS 2015
Bargaining for Revenue Shares on Tree Trading Networks
IJCAI 2013