Sandeep Silwal
28 papers · 2021–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🌍 Conference Polyglot (5) 🐝 Cross-Pollinator (13) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌈 Renaissance Researcher (6)
🌈
Renaissance Researcher
(6)
🤝
Dynamic Duo
(11)
👑
Triple Crown
🔥
Unstoppable
(5)
💎
Century Club
(28)
⚡
Prolific Year
(8)
🗃️
Keyword Collector
(73)
Conferences
NIPS (10)
ICLR (9)
ICML (7)
ACL (1)
ALT (1)
Top co-authors
Keywords
approximation algorithm
(4)
density estimation
(2)
random projection
(2)
sample complexity
(2)
dimensionality reduction
(2)
data structure
(2)
semidefinite programming
(1)
point cloud
(1)
adversarial robustness
(1)
bipartite matching
(1)
optimal transport
(1)
robust regression
(1)
hierarchical clustering
(1)
neural network optimization
(1)
low-rank approximation
(1)
feature selection
(1)
computational efficiency
(1)
importance sampling
(1)
nearest neighbor
(1)
fine-grained complexity
(1)
Papers
Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
ICLR 2025
Learning-Augmented Frequent Directions
ICLR 2025
Optimal and learned algorithms for the online list update problem with Zipfian accesses
ALT 2025
Improved Approximations for Hard Graph Problems using Predictions
ICML 2025
Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
ICML 2025
Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
ICML 2025
Optimal Algorithms for Augmented Testing of Discrete Distributions
NIPS 2024
Efficiently Computing Similarities to Private Datasets
ICLR 2024
Statistical-Computational Trade-offs for Density Estimation
NIPS 2024
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
ICLR 2023
Data Structures for Density Estimation
ICML 2023
Improved Frequency Estimation Algorithms with and without Predictions
NIPS 2023
Constant Approximation for Individual Preference Stable Clustering
NIPS 2023
Near-Linear Time Algorithm for the Chamfer Distance
NIPS 2023
KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals
ACL 2023
Robust Algorithms on Adaptive Inputs from Bounded Adversaries
ICLR 2023
Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation
ICLR 2023
Learning-Augmented $k$-means Clustering
ICLR 2022
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks
NIPS 2022
Faster Linear Algebra for Distance Matrices
NIPS 2022
Learning-Augmented Algorithms for Online Linear and Semidefinite Programming
NIPS 2022
Triangle and Four Cycle Counting with Predictions in Graph Streams
ICLR 2022
Faster Fundamental Graph Algorithms via Learned Predictions
ICML 2022
Hardness and Algorithms for Robust and Sparse Optimization
ICML 2022
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering
ICML 2021
Adversarial Robustness of Streaming Algorithms through Importance Sampling
NIPS 2021
Learning-based Support Estimation in Sublinear Time
ICLR 2021
Dimensionality Reduction for Wasserstein Barycenter
NIPS 2021