Sandeep Silwal
30 papers · 2021–2026 · 6 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 ↓+10 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (39) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π€
Dynamic Duo
(12)
π§¬
Topic Evolution
π
Triple Crown
π¬
Deep Specialist
(13)
β‘
Prolific Year Β· Productive
π₯
Unstoppable Β· Bronze
β
The Questioner
π
Century Club Β· Bronze
π
Renaissance Researcher
(6)
ποΈ
Keyword Collector
(136)
Top co-authors
Research topics
Machine Learning
(23)
Mathematics & Optimization
(20)
Optimization
(18)
Optimization & Theory
(17)
Computer Science
(14)
Foundations
(14)
Mathematics
(8)
Core Methods
(7)
Artificial Intelligence
(3)
Learning Types
(3)
Data Science & Analytics
(2)
Application Areas
(2)
Learning Paradigms
(2)
Methods
(2)
Deep Learning
(1)
Keywords
dimensionality reduction
(5)
approximation algorithm
(5)
sample complexity
(4)
kernel density estimation
(3)
learning-augmented algorithm
(3)
frequency estimation
(3)
streaming algorithm
(3)
lower bound
(3)
density estimation
(2)
random projection
(2)
low-rank approximation
(2)
data structure
(2)
bipartite matching
(1)
optimal transport
(1)
reinforcement learning
(1)
feature selection
(1)
k-means clustering
(1)
compressed sensing
(1)
differential privacy
(1)
computational complexity
(1)
Papers
Compact Geometric Representations of Hierarchies
COLT 2026
How fast can you find a good hypothesis?
COLT 2026
Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
ICLR 2025
Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
ICML 2025
Improved Approximations for Hard Graph Problems using Predictions
ICML 2025
Learning-Augmented Frequent Directions
ICLR 2025
Optimal and learned algorithms for the online list update problem with Zipfian accesses
ALT 2025
Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
ICML 2025
Efficiently Computing Similarities to Private Datasets
ICLR 2024
Optimal Algorithms for Augmented Testing of Discrete Distributions
NeurIPS 2024
Statistical-Computational Trade-offs for Density Estimation
NeurIPS 2024
Constant Approximation for Individual Preference Stable Clustering
NeurIPS 2023
Data Structures for Density Estimation
ICML 2023
Improved Frequency Estimation Algorithms with and without Predictions
NeurIPS 2023
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
ACL 2023
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
ICLR 2023
Near-Linear Time Algorithm for the Chamfer Distance
NeurIPS 2023
Robust Algorithms on Adaptive Inputs from Bounded Adversaries
ICLR 2023
Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation
ICLR 2023
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks
NeurIPS 2022
Faster Fundamental Graph Algorithms via Learned Predictions
ICML 2022
Faster Linear Algebra for Distance Matrices
NeurIPS 2022
Hardness and Algorithms for Robust and Sparse Optimization
ICML 2022
Learning-Augmented k-means Clustering
ICLR 2022
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
NeurIPS 2022
Triangle and Four Cycle Counting with Predictions in Graph Streams
ICLR 2022
Adversarial Robustness of Streaming Algorithms through Importance Sampling
NeurIPS 2021
Dimensionality Reduction for Wasserstein Barycenter
NeurIPS 2021
Learning-based Support Estimation in Sublinear Time
ICLR 2021
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering
ICML 2021