Demo Data from VLDB 2026 / reviewers in the wild / expert
Baqun Zhang
dblp:168/1129
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2023
—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.
| Artificial intelligence
1 paper |
Learning theory · 60% Reinforcement learning · 40% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › dynamic programming › value iteration
fitted q-iteration |
0.7 | 1 | 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning · J. Mach. Learn. Res. 2023 |
Machine learning › Learning theory
nonparametric regression |
0.7 | 1 | 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning · J. Mach. Learn. Res. 2023 |
Machine learning › Learning theory › excess risk bounds
oracle inequality |
0.7 | 1 | 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning · J. Mach. Learn. Res. 2023 |
Machine learning › Learning theory
statistical learning theory |
0.7 | 1 | 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning · J. Mach. Learn. Res. 2023 |
Machine learning › Reinforcement learning
value-based reinforcement learning |
0.7 | 1 | 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement Learning · J. Mach. Learn. Res. 2023 |
Bioinformatics and computational biology › statistical genetics › genetic association study
genetic association testing |
0.2 | 1 | 2015 | Likelihood-based complex trait association testing for arbitrary depth sequencing data · Bioinform. 2015 |
Methods — techniques the papers use, named apart from their topics
non-asymptotic error bound · 0.7error propagation · 0.7approximation and generalization error decomposition · 0.7score test · 0.2likelihood ratio test · 0.2genotype likelihood function · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Over-parameterized Deep Nonparametric Regression for Dependent Data with Its Applications to Reinforcement LearningabstractIn this paper, we provide statistical guarantees for over-parameterized deep nonparametric regression in the presence of dependent data. By decomposing the error, we establish non-asymptotic error bounds for deep estimation, which is achieved by effectively balancing the approximation and generalization errors. We have derived an approximation result for Hölder functions with constrained weights. Additionally, the generalization error is bounded by the weight norm, allowing for a neural network parameter number that is much larger than the training sample size. Furthermore, we address the issue of the curse of dimensionality by assuming that the samples originate from distributions with low intrinsic dimensions. Under this assumption, we are able to overcome the challenges posed by high-dimensional spaces. By incorporating an additional error propagation mechanism, we derive oracle inequalities for the over-parameterized deep fitted $Q$-iteration. Xingdong Feng, Yuling Jiao, Lican Kang, Baqun Zhang |
J. Mach. Learn. Res. | 4 |
| 2015 | Likelihood-based complex trait association testing for arbitrary depth sequencing dataabstractUNLABELLED: In next generation sequencing (NGS)-based genetic studies, researchers typically perform genotype calling first and then apply standard genotype-based methods for association testing. However, such a two-step approach ignores genotype calling uncertainty in the association testing step and may incur power loss and/or inflated type-I error. In the recent literature, a few robust and efficient likelihood based methods including both likelihood ratio test (LRT) and score test have been proposed to carry out association testing without intermediate genotype calling. These methods take genotype calling uncertainty into account by directly incorporating genotype likelihood function (GLF) of NGS data into association analysis. However, existing LRT methods are computationally demanding or do not allow covariate adjustment; while existing score tests are not applicable to markers with low minor allele frequency (MAF). We provide an LRT allowing flexible covariate adjustment, develop a statistically more powerful score test and propose a combination strategy (UNC combo) to leverage the advantages of both tests. We have carried out extensive simulations to evaluate the performance of our proposed LRT and score test. Simulations and real data analysis demonstrate the advantages of our proposed combination strategy: it offers a satisfactory trade-off in terms of computational efficiency, applicability (accommodating both common variants and variants with low MAF) and statistical power, particularly for the analysis of quantitative trait where the power gain can be up to ∼60% when the causal variant is of low frequency (MAF < 0.01). AVAILABILITY AND IMPLEMENTATION: UNC combo and the associated R files, including documentation, examples, are available at http://www.unc.edu/∼yunmli/UNCcombo/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Zheng Xu 0010, Baqun Zhang, Guolian Kang, Andrea Byrnes |
Bioinform. | 4 |