Sharath Raghvendra
9 papers · 2019–2025 · 3 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 ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Bronze π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (14) π£ Hot Topic Early Bird
π
Keyword Champion
(3)
Venues
Top co-authors
Research topics
Keywords
optimal transport
(4)
additive approximation
(3)
approximation algorithm
(3)
wasserstein distance
(3)
bipartite matching
(2)
combinatorial optimization
(2)
graph algorithm
(2)
combinatorial algorithm
(2)
euclidean distance
(1)
primal-dual algorithm
(1)
distributed computing
(1)
discrete optimization
(1)
convergence rate
(1)
class prior estimation
(1)
parallel computing
(1)
gpu computing
(1)
euclidean space
(1)
discrete distribution
(1)
piecewise-linear functions
(1)
outlier detection
(1)
Papers
Scalable Approximation Algorithms for p-Wasserstein Distance and Its Variants
ICML 2025
A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem
NeurIPS 2024
A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributions
ICML 2024
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings
NeurIPS 2023
A Higher Precision Algorithm for Computing the $1$-Wasserstein Distance
ICLR 2023
A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem
NeurIPS 2023
Computing all Optimal Partial Transports
ICLR 2023
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning
NeurIPS 2021
A Graph Theoretic Additive Approximation of Optimal Transport
NeurIPS 2019