Benjamin Moseley
26 papers · 2013–2025 · 7 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 ↓+9 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (34) π Academic Marathon Β· Half π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π¬
Deep Specialist
(11)
π
Keyword Champion
π
Century Club Β· Bronze
π
Conference Pioneer
π
Trend Setter
β‘
Prolific Year Β· Productive
π₯
Unstoppable Β· Bronze
ποΈ
Keyword Collector
(113)
π
Renaissance Researcher
(5)
Top co-authors
Research topics
Machine Learning
(23)
Core Methods
(14)
Optimization & Theory
(12)
Mathematics & Optimization
(11)
Optimization
(9)
Computer Science
(6)
Application Areas
(6)
Foundations
(6)
Learning Types
(6)
Data Science & Analytics
(4)
Applications
(4)
Artificial Intelligence
(3)
Bayesian & Probabilistic Β· Artificial Intelligence
(2)
Bayesian & Probabilistic Β· Machine Learning
(2)
Learning Paradigms
(2)
Keywords
approximation algorithm
(7)
hierarchical clustering
(6)
online algorithm
(4)
bisecting k-mean
(3)
k-means clustering
(3)
active learning
(3)
active search
(3)
clustering algorithm
(3)
prediction
(2)
nonmyopic policy
(2)
bayesian optimal policy
(2)
average linkage
(2)
competitive ratio
(2)
machine-learned prediction
(2)
coreset construction
(2)
bayesian optimization
(2)
correlation clustering
(2)
approximation ratio
(2)
uniform sampling
(1)
computational efficiency
(1)
Papers
Faster Global Minimum Cut with Predictions
ICML 2025
Binary Search with Distributional Predictions
NeurIPS 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
Fast Combinatorial Algorithms for Min Max Correlation Clustering
ICML 2023
Min-Max Submodular Ranking for Multiple Agents
AAAI 2023
Predictive Flows for Faster Ford-Fulkerson
ICML 2023
Algorithms with Prediction Portfolios
NeurIPS 2022
Learning-Augmented Algorithms for Online Steiner Tree
AAAI 2022
Faster Matchings via Learned Duals
NeurIPS 2021
Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors
AISTATS 2021
Robust Online Correlation Clustering
NeurIPS 2021
Scaling Average-Linkage via Sparse Cluster Embeddings
ACML 2021
An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means
AAAI 2020
Fair Hierarchical Clustering
NeurIPS 2020
Fast Noise Removal for k-Means Clustering
AISTATS 2020
Rk-means: Fast Clustering for Relational Data
AISTATS 2020
Unconditional Coresets for Regularized Loss Minimization
AISTATS 2020
Backprop with Approximate Activations for Memory-efficient Network Training
NeurIPS 2019
Cost Effective Active Search
NeurIPS 2019
Efficient nonmyopic batch active search
NeurIPS 2018
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
NeurIPS 2017
Efficient Nonmyopic Active Search
ICML 2017
Fast Distributed k-Center Clustering with Outliers on Massive Data
NeurIPS 2015
Bargaining for Revenue Shares on Tree Trading Networks
IJCAI 2013