Peilin Zhong
22 papers · 2018–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+10 more ↓ Show less ↑
π Academic Marathon (7) π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (4) π Cross-Pollinator (11)
π
Conference Polyglot
(4)
π
Academic Marathon
(7)
πΊοΈ
Taxonomy Completionist
(32)
π€
Dynamic Duo
(12)
π
Grand Slam
π§¬
Topic Evolution
π
Century Club
(22)
π₯
Unstoppable
(8)
ποΈ
Keyword Collector
(70)
π
Trend Setter
Conferences
NIPS (11)
ICML (8)
ICLR (2)
AAAI (1)
Top co-authors
Research topics
Keywords
approximation algorithm
(4)
k-means clustering
(3)
matrix approximation
(3)
low-rank approximation
(3)
low rank approximation
(3)
clustering algorithm
(3)
differential privacy
(3)
k-median clustering
(2)
orlicz norm
(2)
entrywise loss
(2)
graph learning
(2)
massively parallel computation
(2)
column subset selection
(2)
linear regression
(1)
graph embedding
(1)
nearest neighbor search
(1)
matrix factorization
(1)
euclidean space
(1)
game theory
(1)
numerical linear algebra
(1)
Papers
Retraining with Predicted Hard Labels Provably Increases Model Accuracy
ICML 2025
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
ICML 2025
Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures
ICML 2025
Addax: Utilizing Zeroth-Order Gradients to Improve Memory Efficiency and Performance of SGD for Fine-Tuning Language Models
ICLR 2025
PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels
ICML 2024
Perturb-and-Project: Differentially Private Similarities and Marginals
ICML 2024
High-Dimensional Geometric Streaming for Nearly Low Rank Data
ICML 2024
$k$-Means Clustering with Distance-Based Privacy
NIPS 2023
Near-Optimal $k$-Clustering in the Sliding Window Model
NIPS 2023
Massively Parallel $k$-Means Clustering for Perturbation Resilient Instances
ICML 2022
Near-Optimal Private and Scalable $k$-Clustering
NIPS 2022
Stars: Tera-Scale Graph Building for Clustering and Learning
NIPS 2022
Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
NIPS 2022
Almost Linear Time Density Level Set Estimation via DBSCAN
AAAI 2021
Planning with General Objective Functions: Going Beyond Total Rewards
NIPS 2020
Enhancing Adversarial Defense by k-Winners-Take-All
ICLR 2020
Rethinking Generative Mode Coverage: A Pointwise Guaranteed Approach
NIPS 2019
Average Case Column Subset Selection for Entrywise $\ell_1$-Norm Loss
NIPS 2019
Efficient Symmetric Norm Regression via Linear Sketching
NIPS 2019
Towards a Zero-One Law for Column Subset Selection
NIPS 2019
BourGAN: Generative Networks with Metric Embeddings
NIPS 2018
Subspace Embedding and Linear Regression with Orlicz Norm
ICML 2018