Leheng Cai

dblp:366/8513 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 88% Algorithms and data structures · 12%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.912025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025
Privacy and data protection › differential privacy
local differential privacy
0.912025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025
Mathematical optimization › stochastic optimization › stochastic gradient methods
stochastic gradient descent
0.912025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025
Mathematical optimization
stochastic optimization
0.912025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025
Algorithms and data structures › data streams
quantile estimation
0.312025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025
Mathematical optimization
statistical estimation
0.312025
Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

randomized response · 1.7law of the iterated logarithm · 1.7gaussian approximation · 1.7
YearPublicationVenuePosition
2025 Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy
abstract
In this paper, we develop a novel algorithm for constructing time-uniform, asymptotic confidence sequences for quantiles under local differential privacy (LDP). The procedure combines dynamically chained parallel stochastic gradient descent (P-SGD) with a randomized response mechanism, thereby guaranteeing privacy protection while simultaneously estimating the target quantile and its variance. A strong Gaussian approximation for the proposed estimator yields asymptotically anytime-valid confidence sequences whose widths obey the law of the iterated logarithm (LIL). Moreover, the method is fully online, offering high computational efficiency and requiring only $\mathcal{O}(\kappa)$ memory, where $\kappa$ denotes the number of chains and is much smaller than the sample size. Rigorous mathematical proofs and extensive numerical experiments demonstrate the theoretical soundness and practical effectiveness of the algorithm.
Leheng Cai, Qirui Hu, Juntao Sun, Shuyuan Wu
NeurIPS1