Devdatt Dubhashi
13 papers · 2012–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
π Conference Polyglot (6) πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer π Interdisciplinary Bridge π Academic Marathon (12)
π
Cross-Pollinator
(8)
π
Renaissance Researcher
(5)
π
Conference Polyglot
(6)
π
Century Club
(12)
ποΈ
Keyword Collector
(71)
π
Conference Pioneer
Conferences
NIPS (4)
ICML (3)
AISTATS (2)
AAAI (1)
EACL (1)
IJCAI (1)
JMLR (1)
Top co-authors
Keywords
correlation clustering
(2)
convex optimization
(2)
proximal algorithm
(2)
support vector machine
(2)
graph theory
(2)
combinatorial optimization
(2)
lovasz theta function
(2)
multi-armed bandit
(2)
semidefinite programming
(2)
multiple kernel learning
(2)
convex relaxation
(1)
asymptotic analysis
(1)
kernel learning
(1)
graph embedding
(1)
sample efficiency
(1)
sample complexity
(1)
neural network model
(1)
optimal transport
(1)
variance reduction
(1)
epistemic uncertainty
(1)
Papers
Recursive numeral systems are highly regular and easy to process
EACL 2026
Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms
NIPS 2024
Active preference learning for ordering items in- and out-of-sample
NIPS 2024
Pure Exploration in Bandits with Linear Constraints
AISTATS 2024
Random Features Model with General Convex Regularization: A Fine Grained Analysis with Precise Asymptotic Learning Curves
AISTATS 2023
Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms Regularization Framework
ICML 2023
Thompson Sampling for Bandits with Clustered Arms
IJCAI 2021
A NonβConvex Optimization Approach to Correlation Clustering
AAAI 2019
Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery
ICML 2017
Weighted Theta Functions and Embeddings with Applications to Max-Cut, Clustering and Summarization
NIPS 2015
Global graph kernels using geometric embeddings
ICML 2014
Lovasz theta function, SVMs and Finding Dense Subgraphs
JMLR 2013
The LovΓ‘sz Ο function, SVMs and finding large dense subgraphs
NIPS 2012