Demo Data from EDBT 2026 / reviewers in the wild / expert
Jingyi Gao
dblp:178/4413
· DBLP profile ↗
7ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Databases, data management, data science and information retrieval · 2 · 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.
| Artificial intelligence
1 paper |
Learning theory · 67% 3D vision · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › statistical estimation
mean estimation |
1.0 | 1 | 2026 | A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance · COLT 2026 |
Computer vision › 3D vision
robust estimation |
1.0 | 1 | 2026 | A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance · COLT 2026 |
Machine learning › Learning theory
statistical estimation |
1.0 | 1 | 2026 | A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance · COLT 2026 |
Methods — techniques the papers use, named apart from their topics
unknown covariance · 1.0quasi-polynomial time algorithm · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown CovarianceabstractWe study the algorithmic problem of robust Gaussian mean estimation in the mean-shift contamination model with unknown covariance. Specifically, we are allowed to draw samples from a statistical mixture of an unknown target Gaussian $\mathcal{N}(\mu, \Sigma)$ (with weight at least $1-\alpha$), and arbitrary unknown mean-shifts of it, i.e., ${\mathcal{N}(\mu_i, \Sigma)}_i$, and the goal is to estimate $\mu$ up to any desired accuracy $\epsilon$ in $\ell_2$-norm. In the special case where $\Sigma$ is known to be the identity, prior work gave an algorithm with a near-optimal sample complexity of $\mathrm{poly}(d,2^{\epsilon^{-2}})$ and sample-polynomial time. In this work, we provide a quasi-polynomial time algorithm with sample complexity $2^{\mathrm{poly}(\log d/\epsilon)}$ in the more general unknown covariance case, markedly improving upon the only previously known estimator for this setting that incurs exponential runtime. Ilias Diakonikolas, Jingyi Gao, Giannis Iakovidis, Daniel M. Kane, Thanasis Pittas |
COLT | 2 |
| 2026 | Using Subgraph GNNs for Node Classification: An Overlooked Potential Approach
Jingyi Gao |
KSEM (3) | 3 |
| 2026 | Federated automatic latent variable selection in multi-output Gaussian processes
Jingyi Gao, Seokhyun Chung |
Pattern Recognit. | 1 |
| 2025 | Replicable Distribution TestingabstractWe initiate a systematic investigation of distribution testing in the framework of algorithmic replicability. Specifically, given independent samples from a collection of probability distributions, the goal is to characterize the sample complexity of replicably testing natural properties of the underlying distributions. On the algorithmic front, we develop new replicable algorithms for testing closeness and independence of discrete distributions. On the lower bound front, we develop a new methodology for proving sample complexity lower bounds for replicable testing that may be of broader interest. As an application of our technique, we establish near-optimal sample complexity lower bounds for replicable uniformity testing---answering an open question from prior work---and closeness testing. Ilias Diakonikolas, Jingyi Gao, Daniel M. Kane, Christopher Ye 0001 |
NeurIPS | 2 |
| 2024 | Planar or Spatial: Exploring Design Aspects and Challenges for Presentations in Virtual Reality with No-coding InterfaceabstractThe proliferation of virtual reality (VR) has led to its increasing adoption as an immersive medium for delivering presentations, distinct from other VR experiences like games and 360-degree videos by sharing information in richly interactive environments. However, creating engaging VR presentations remains a challenging and time-consuming task for users, hindering the full realization of VR presentation's capabilities. This research aims to explore the potential of VR presentation, analyze users' opinions, and investigate these via providing a user-friendly no-coding authoring tool. Through an examination of popular presentation software and interviews with seven professionals, we identified five design aspects and four design challenges for VR presentations. Based on the findings, we developed VRStory, a prototype for presentation authoring without coding to explore the design aspects and strategies for addressing the challenges. VRStory offers a variety of predefined and customizable VR elements, as well as modules for layout design, navigation control, and asset generation. A user study was then conducted with 12 participants to investigate their opinions and authoring experience with VRStory. Our results demonstrated that, while acknowledging the advantages of immersive and spatial features in VR, users often have a consistent mental model for traditional 2D presentations and may still prefer planar and static formats in VR for better accessibility and efficient communication. We finally shared our learned design considerations for future development of VR presentation tools, emphasizing the importance of balancing of promoting immersive features and ensuring accessibility. Liwei Wu 0002, Yilin Zhang 0011, Justin Leung, Jingyi Gao, April Li, Jian Zhao 0010 |
Proc. ACM Hum. Comput. Interact. | 4 |
| 2023 | Modeling Regularity and Predictability in Human Behavior from Multidimensional Sensing Signals and Personal CharacteristicsabstractForecasting behavioral patterns can help humans comprehend their habits and tendencies, allowing them to inter-vene before problems arise. Among the numerous techniques of modeling human behavior, cyclic modeling can better identify recurring patterns, providing regularity and predictability in human behavior. However, existing approaches to cyclic modeling ignore the effects of human characteristics, such as resilience and coping abilities, which substantially influence the stability of behavior. To explore the value of adding such information in behavior modeling and prediction, we introduce a transformer-based architecture with an advanced attention mechanism and parallel operation that models regularity in human behavior from multidimensional sensing signals and predicts future behavior patterns. The architecture further transforms static human characteristics metadata into dynamic time series that conform to behavioral patterns and serve as covariates to assist prediction. Our experiments with a wearable dataset indicate that our architecture 1) is more accurate in forecasting human behavior patterns than current time-series models and 2) enables us to investigate the impact of human characteristics on behavior patterns. Specifically, we analyze the influence of resilience and coping strategies on behavioral regularity and predictability. We show that supplementing bio-behavioral wearable data with resilience and coping scores in the forecasting model increases the convergence speed of the model and decreases prediction loss. Jingyi Gao, Runze Yan, Afsaneh Doryab |
ICMLA | 1 |
| 2016 | A Clustering-Based Framework for Incrementally Repairing Entity Resolution
Qing Wang 0002, Jingyi Gao, Peter Christen |
PAKDD (2) | 2 |