EDBT 2026 Demo / reviewers in the wild / expert
Xuchen Gong
dblp:304/1179
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-7072-6112ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 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.
| Network and information security
1 paper |
Privacy and data protection · 100% | |
| Artificial intelligence
1 paper |
Optimization for machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning › black-box optimization
zeroth-order optimization |
0.9 | 1 | 2025 | Private Zeroth-Order Optimization with Public Data · NeurIPS 2025 |
Privacy and data protection › differential privacy
differentially private optimization |
0.9 | 1 | 2025 | Private Zeroth-Order Optimization with Public Data · NeurIPS 2025 |
Privacy and data protection
differential privacy |
0.9 | 1 | 2025 | Private Zeroth-Order Optimization with Public Data · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
zeroth-order optimization · 1.7public data · 1.7DP-SGD · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Private Zeroth-Order Optimization with Public DataabstractOne of the major bottlenecks for deploying popular first-order differentially private (DP) machine learning algorithms (e.g., DP-SGD) lies in their high computation and memory cost, despite the existence of optimized implementations. Zeroth-order methods have promise in mitigating the overhead, as they leverage function evaluations to approximate the gradients, hence significantly easier to privatize. While recent works have explored zeroth-order approaches in both private and non-private settings, they still suffer from relatively low utilities compared with DP-SGD, and have only been evaluated in limited application domains.
In this work, we propose to leverage public information to guide and improve gradient approximation of private zeroth-order algorithms. We explore a suite of \underline{p}ublic-data-\underline{a}ssisted \underline{z}eroth-\underline{o}rder optimizers (PAZO) with minimal overhead. We provide theoretical analyses of the PAZO framework under an assumption of the similarity between public and private data. Empirically, we demonstrate that PAZO achieves superior privacy/utility tradeoffs across vision and text tasks in both pre-training and fine-tuning settings, outperforming the best first-order baselines (with public data) especially in highly private regimes, while offering up to $16\times$ runtime speedup. Xuchen Gong, Tian Li 0005 |
NeurIPS | 1 |
| 2021 | Cross-modal Assisted Training for Abnormal Event Recognition in ElevatorsabstractGiven that very few action recognition datasets collected in elevators contain multimodal data, we collect and propose our multimodal dataset investigating passenger safety and inappropriate elevator usage. Moreover, we present a novel framework (RGBP) to utilize multimodal data to enhance unimodal test performance for the task of abnormal event recognition in elevators. Experimental results show that the best network architecture with the RGBP framework effectively improves the unimodal inference performance on the Elevator RGBD dataset by 4.71% (accuracy) and 4.95% (F1 score) with respect to the pure RGB model. In addition, our RGBP framework outperforms two other methods for ”multimodal training and unimodal inference”: MTUT [1] and the two-stage method based on depth estimation. Xinmeng Chen, Xuchen Gong, Ming Cheng 0005, Ming Li 0026 |
ICMI | 2 |