Hu Ding
23 papers · 2013–2026 · 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 (36) π Conference Polyglot Β· Silver π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π¬
Deep Specialist
(12)
π
Grand Slam
π
Keyword Champion
(2)
π
Renaissance Researcher
(6)
π
Trend Setter
π
Conference Pioneer
β‘
Prolific Year Β· Productive
ποΈ
Keyword Collector
(120)
π
Century Club Β· Bronze
Top co-authors
Research topics
Machine Learning
(22)
Core Methods
(14)
Mathematics & Optimization
(13)
Optimization
(13)
Optimization & Theory
(10)
Learning Types
(6)
Application Areas
(5)
Computer Science
(4)
Foundations
(4)
Artificial Intelligence
(2)
Data Science & Analytics
(2)
Applications
(2)
Mathematics
(2)
Computer Vision
(1)
Interdisciplinary
(1)
Keywords
robust optimization
(3)
approximation algorithm
(3)
wasserstein barycenter
(3)
k-means clustering
(3)
optimal transport
(3)
k-center clustering
(2)
coreset method
(2)
doubling dimension
(2)
logistic regression
(2)
support vector machine
(2)
clustering algorithm
(2)
catastrophic forgetting
(2)
distributionally robust optimization
(2)
wasserstein distance
(2)
outlier detection
(2)
k-median clustering
(2)
discrete optimization
(2)
sparse optimization
(2)
continual learning
(2)
chromosome territory
(2)
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
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
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
An Effective Dynamic Gradient Calibration Method for Continual Learning
ICML 2024
A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
AAAI 2024
Approximate Algorithms for k-Sparse Wasserstein Barycenter with Outliers
IJCAI 2024
Coresets for Relational Data and The Applications
NeurIPS 2022
Coresets for Wasserstein Distributionally Robust Optimization Problems
NeurIPS 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
Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems
NeurIPS 2021
Solving Soft Clustering Ensemble via k-Sparse Discrete Wasserstein Barycenter
NeurIPS 2021
Layered Sampling for Robust Optimization Problems
ICML 2020
On Metric DBSCAN with Low Doubling Dimension
IJCAI 2020
On Geometric Alignment in Low Doubling Dimension
AAAI 2019
K-Means Clustering with Distributed Dimensions
ICML 2016
Gauging Association Patterns of Chromosome Territories via Chromatic Median
CVPR 2013
k-Prototype Learning for 3D Rigid Structures
NeurIPS 2013