Demo Data from VLDB 2026 / reviewers in the wild / expert
Caihong Qin
dblp:338/7538
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—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.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian model selection
model averaging |
1.0 | 1 | 2026 | Classification Under Local Differential Privacy with Model Reversal and Model Averaging · J. Mach. Learn. Res. 2026 |
Privacy and data protection › differential privacy
local differential privacy |
1.0 | 1 | 2026 | Classification Under Local Differential Privacy with Model Reversal and Model Averaging · J. Mach. Learn. Res. 2026 |
Methods — techniques the papers use, named apart from their topics
model reversal · 2.0model averaging · 2.0excess risk bounds · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Classification Under Local Differential Privacy with Model Reversal and Model AveragingabstractLocal differential privacy has become a central topic in data privacy research, offering strong privacy guarantees by perturbing user data at the source and removing the need for a trusted curator. However, the noise introduced by local differential privacy often significantly reduces data utility. To address this issue, we reinterpret private learning under local differential privacy as a transfer learning problem, where the noisy data serve as the source domain and the unobserved clean data as the target. We propose novel techniques specifically designed for local differential privacy to improve classification performance without compromising privacy: (1) a noised binary feedback-based evaluation mechanism for estimating dataset utility; (2) model reversal, which salvages underperforming classifiers by inverting their decision boundaries; and (3) model averaging, which assigns weights to multiple reversed classifiers based on their estimated utility. We provide theoretical excess risk bounds under local differential privacy and demonstrate how our methods reduce this risk. Empirical results on both simulated and real-world datasets show substantial improvements in classification accuracy. Caihong Qin |
J. Mach. Learn. Res. | 1 |