Hu Ding
23 papers · 2013–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π Academic Marathon (12) π Interdisciplinary Bridge π Conference Polyglot (7) π§ Keyword Pioneer π Cross-Pollinator (10)
π
Cross-Pollinator
(10)
π
Renaissance Researcher
(7)
πΊοΈ
Taxonomy Completionist
(31)
π¬
Deep Specialist
(11)
π
Keyword Champion
(2)
π
Grand Slam
π§¬
Topic Evolution
π
Century Club
(22)
π
Trend Setter
π
Conference Pioneer
ποΈ
Keyword Collector
(93)
β‘
Prolific Year
(6)
Conferences
ICML (5)
NIPS (5)
ICLR (4)
AAAI (3)
CVPR (2)
IJCAI (2)
UAI (2)
Top co-authors
Keywords
robust optimization
(3)
k-means clustering
(3)
approximation algorithm
(3)
discrete optimization
(2)
logistic regression
(2)
sparse optimization
(2)
k-center clustering
(2)
support vector machine
(2)
coreset method
(2)
optimal transport
(2)
outlier detection
(2)
doubling dimension
(2)
clustering algorithm
(2)
k-median clustering
(2)
wasserstein barycenter
(2)
dimension reduction
(1)
distributed computing
(1)
communication complexity
(1)
adversarial machine learning
(1)
dimensionality reduction
(1)
Papers
Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High Dimensions
AAAI 2026
An Effective Manifold-based Optimization Method for Distributionally Robust Classification
ICLR 2025
Dual Energy-Based Model with Open-World Uncertainty Estimation for Out-of-distribution Detection
CVPR 2025
Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
ICLR 2025
To Tackle Adversarial Transferability: A Novel Ensemble Training Method with Fourier Transformation
ICLR 2025
Exploring The Forgetting in Adversarial Training: A Novel Method for Enhancing Robustness
ICLR 2025
Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness
ICML 2025
An Effective Dynamic Gradient Calibration Method for Continual Learning
ICML 2024
Approximate Algorithms for k-Sparse Wasserstein Barycenter with Outliers
IJCAI 2024
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
AAAI 2024
Coresets for Relational Data and The Applications
NIPS 2022
Coresets for Wasserstein Distributionally Robust Optimization Problems
NIPS 2022
Sublinear time algorithms for greedy selection in high dimensions
UAI 2022
A Novel Sequential Coreset Method for Gradient Descent Algorithms
ICML 2021
Defending SVMs against poisoning attacks: the hardness and DBSCAN approach
UAI 2021
Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter
NIPS 2021
Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems
NIPS 2021
On Metric DBSCAN with Low Doubling Dimension
IJCAI 2020
Layered Sampling for Robust Optimization Problems
ICML 2020
On Geometric Alignment in Low Doubling Dimension
AAAI 2019
K-Means Clustering with Distributed Dimensions
ICML 2016
k-Prototype Learning for 3D Rigid Structures
NIPS 2013
Gauging Association Patterns of Chromosome Territories via Chromatic Median
CVPR 2013