Demo Data from EDBT 2026 / reviewers in the wild / expert
Jing Ouyang
dblp:320/4769
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-3982-0415ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers |
Probabilistic and Bayesian machine learning · 75% Learning theory · 25% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory › statistical estimation › asymptotic estimation theory
asymptotic normality |
0.7 | 1 | 2023 | Statistical Inference for Noisy Incomplete Binary Matrix · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
generalized linear model |
0.7 | 1 | 2023 | High-Dimensional Inference for Generalized Linear Models with Hidden Confounding · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
high-dimensional inference |
0.7 | 1 | 2023 | High-Dimensional Inference for Generalized Linear Models with Hidden Confounding · J. Mach. Learn. Res. 2023 |
Machine learning › Probabilistic and Bayesian machine learning
statistical inference |
0.7 | 1 | 2023 | Statistical Inference for Noisy Incomplete Binary Matrix · J. Mach. Learn. Res. 2023 |
Mathematical optimization › continuous optimization › matrix optimization › matrix recovery
matrix completion |
0.7 | 1 | 2023 | Statistical Inference for Noisy Incomplete Binary Matrix · J. Mach. Learn. Res. 2023 |
Machine learning and data management
matrix completion |
0.2 | 1 | 2023 | Statistical Inference for Noisy Incomplete Binary Matrix · J. Mach. Learn. Res. 2023 |
Methods — techniques the papers use, named apart from their topics
nonlinear factor analysis · 2.0cramer-rao lower bound · 2.0debiasing · 0.7asymptotic normality · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Statistical Inference for Noisy Incomplete Binary MatrixabstractWe consider the statistical inference for noisy incomplete binary (or 1-bit) matrix. Despite the importance of uncertainty quantification to matrix completion, most of the categorical matrix completion literature focuses on point estimation and prediction. This paper moves one step further toward statistical inference for binary matrix completion. Under a popular nonlinear factor analysis model, we obtain a point estimator and derive its asymptotic normality. Moreover, our analysis adopts a flexible missing-entry design that does not require a random sampling scheme as required by most of the existing asymptotic results for matrix completion. Under reasonable conditions, the proposed estimator is statistically efficient and optimal in the sense that the Cramer-Rao lower bound is achieved asymptotically for the model parameters. Two applications are considered, including (1) linking two forms of an educational test and (2) linking the roll call voting records from multiple years in the United States Senate. The first application enables the comparison between examinees who took different test forms, and the second application allows us to compare the liberal-conservativeness of senators who did not serve in the Senate at the same time. Yunxiao Chen, Jing Ouyang, Gongjun Xu |
J. Mach. Learn. Res. | 3 |
| 2023 | High-Dimensional Inference for Generalized Linear Models with Hidden ConfoundingabstractStatistical inferences for high-dimensional regression models have been extensively studied for their wide applications ranging from genomics, neuroscience, to economics. However, in practice, there are often potential unmeasured confounders associated with both the response and covariates, which can lead to invalidity of standard debiasing methods. This paper focuses on a generalized linear regression framework with hidden confounding and proposes a debiasing approach to address this high-dimensional problem, by adjusting for the effects induced by the unmeasured confounders. We establish consistency and asymptotic normality for the proposed debiased estimator. The finite sample performance of the proposed method is demonstrated through extensive numerical studies and an application to a genetic data set. Jing Ouyang, Kean Ming Tan, Gongjun Xu |
J. Mach. Learn. Res. | 1 |