Demo Data from EDBT 2026 / reviewers in the wild / expert
Shuyuan Wu
dblp:31/6015
· DBLP profile ↗
2ranked-venue papers
0as 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 since 2021Applied, interdisciplinary, general and emerging computing · 1
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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
0.9 | 1 | 2025 | Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025 |
Privacy and data protection › differential privacy
local differential privacy |
0.9 | 1 | 2025 | 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.9 | 1 | 2025 | Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025 |
Mathematical optimization
stochastic optimization |
0.9 | 1 | 2025 | Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025 |
Algorithms and data structures › data streams
quantile estimation |
0.3 | 1 | 2025 | Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential Privacy · NeurIPS 2025 |
Mathematical optimization
statistical estimation |
0.3 | 1 | 2025 | 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
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Time-uniform and Asymptotic Confidence Sequence of Quantile under Local Differential PrivacyabstractIn 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 |
NeurIPS | 4 |
| 2004 | Optimal cDNA microarray design using expressed sequence tags for organisms with limited genomic informationabstractBACKGROUND: Expression microarrays are increasingly used to characterize environmental responses and host-parasite interactions for many different organisms. Probe selection for cDNA microarrays using expressed sequence tags (ESTs) is challenging due to high sequence redundancy and potential cross-hybridization between paralogous genes. In organisms with limited genomic information, like marine organisms, this challenge is even greater due to annotation uncertainty. No general tool is available for cDNA microarray probe selection for these organisms. Therefore, the goal of the design procedure described here is to select a subset of ESTs that will minimize sequence redundancy and characterize potential cross-hybridization while providing functionally representative probes. RESULTS: Sequence similarity between ESTs, quantified by the E-value of pair-wise alignment, was used as a surrogate for expected hybridization between corresponding sequences. Using this value as a measure of dissimilarity, sequence redundancy reduction was performed by hierarchical cluster analyses. The choice of how many microarray probes to retain was made based on an index developed for this research: a sequence diversity index (SDI) within a sequence diversity plot (SDP). This index tracked the decreasing within-cluster sequence diversity as the number of clusters increased. For a given stage in the agglomeration procedure, the EST having the highest similarity to all the other sequences within each cluster, the centroid EST, was selected as a microarray probe. A small dataset of ESTs from Atlantic white shrimp (Litopenaeus setiferus) was used to test this algorithm so that the detailed results could be examined. The functional representative level of the selected probes was quantified using Gene Ontology (GO) annotations. CONCLUSIONS: For organisms with limited genomic information, combining hierarchical clustering methods to analyze ESTs can yield an optimal cDNA microarray design. If biomarker discovery is the goal of the microarray experiments, the average linkage method is more effective, while single linkage is more suitable if identification of physiological mechanisms is more of interest. This general design procedure is not limited to designing single-species cDNA microarrays for marine organisms, and it can equally be applied to multiple-species microarrays of any organisms with limited genomic information. Yian Ann Chen, David J. Mckillen, Shuyuan Wu, Matthew J. Jenny, Robert Chapman, Paul S. Gross, Gregory W. Warr, Jonas S. Almeida |
BMC Bioinform. | 3 |