Demo Data from VLDB 2026 / reviewers in the wild / expert
Cory Y. McLean
dblp:254/3286
· DBLP profile ↗
5ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0001-9928-8216ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 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
1 paper |
Trustworthy machine learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
robustness |
0.6 | 1 | 2022 | Underspecification Presents Challenges for Credibility in Modern Machine Learning · J. Mach. Learn. Res. 2022 |
Machine learning › Trustworthy machine learning › robustness
underspecification |
0.6 | 1 | 2022 | Underspecification Presents Challenges for Credibility in Modern Machine Learning · J. Mach. Learn. Res. 2022 |
Bioinformatics and computational biology
genomics |
0.5 | 1 | 2021 | Accurate, scalable cohort variant calls using DeepVariant and GLnexus · Bioinform. 2021 |
Bioinformatics and computational biology › genomics
variant calling |
0.5 | 1 | 2021 | Accurate, scalable cohort variant calls using DeepVariant and GLnexus · Bioinform. 2021 |
Information theory
statistical inference |
0.5 | 1 | 2021 | SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic Regression · NeurIPS 2021 |
Bioinformatics and computational biology › genomics
genomic variant analysis |
0.4 | 1 | 2019 | GenomeWarp: an alignment-based variant coordinate transformation · Bioinform. 2019 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.1 | 1 | 2021 | Accurate, scalable cohort variant calls using DeepVariant and GLnexus · Bioinform. 2021 |
Methods — techniques the papers use, named apart from their topics
mendelian consistency evaluation · 0.5maximum likelihood estimation · 0.5deep learning-based variant calling · 0.5asymptotic approximation · 0.5sequence alignment · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Accurate human genome analysis with element avidity sequencingabstractBACKGROUND: New sequencing technologies provide options for the scientific community to design studies and build clinical workflows. These options expand user choice, and can enable more accurate, scalable, or affordable workflows depending on the fit between scientist needs and platform capability. However, it is essential to understand the performance of these new technologies for different tasks, especially for capabilities that were not possible or tractable in prior technologies. We investigate the new sequencing technology avidity from Element Biosciences. to help the scientific community understand the performance of the options to generate sequencing data. RESULTS: We show that Element whole genome sequencing achieves higher mapping and variant calling accuracy compared to Illumina sequencing at the same coverage, with larger differences at lower coverages (20-30x). We quantify base error rates of Element reads, finding lower error rates, especially in homopolymer and tandem repeat regions. We use Element's ability to generate paired end sequencing with longer insert sizes than typical short-read sequencing. We show that longer insert sizes result in even higher accuracy, with long insert Element sequencing giving more accurate genome analyses at all coverages. CONCLUSIONS: New options for sequencing technologies can analyze genomes comparably or better than prior standard methods. Andrew Carroll, Alexey Kolesnikov, Daniel E. Cook, Lucas Brambrink, Kelly N. Wiseman, Sophie M. Billings, Semyon Kruglyak, Bryan R. Lajoie, Shawn E. Levy, Cory Y. McLean, Kishwar Shafin, Maria Nattestad, Pi-Chuan Chang |
BMC Bioinform. | 11 |
| 2022 | Underspecification Presents Challenges for Credibility in Modern Machine LearningabstractMachine learning (ML) systems often exhibit unexpectedly poor behavior when they are deployed in real-world domains. We identify underspecification in ML pipelines as a key reason for these failures. An ML pipeline is the full procedure followed to train and validate a predictor. Such a pipeline is underspecified when it can return many distinct predictors with equivalently strong test performance. Underspecification is common in modern ML pipelines that primarily validate predictors on held-out data that follow the same distribution as the training data. Predictors returned by underspecified pipelines are often treated as equivalent based on their training domain performance, but we show here that such predictors can behave very differently in deployment domains. This ambiguity can lead to instability and poor model behavior in practice, and is a distinct failure mode from previously identified issues arising from structural mismatch between training and deployment domains. We provide evidence that underspecfication has substantive implications for practical ML pipelines, using examples from computer vision, medical imaging, natural language processing, clinical risk prediction based on electronic health records, and medical genomics. Our results show the need to explicitly account for underspecification in modeling pipelines that are intended for real-world deployment in any domain. Alexander D'Amour, Katherine A. Heller, Dan Moldovan, Ben Adlam, Babak Alipanahi, Alex Beutel, Christina Chen, Jonathan Deaton, Jacob Eisenstein, Matthew Hoffman 0001, Farhad Hormozdiari, Neil Houlsby, Shaobo Hou, Ghassen Jerfel, Alan Karthikesalingam, Mario Lucic, Yi-An Ma, Cory Y. McLean, Diana Mincu, Akinori Mitani, Andrea Montanari, Zachary Nado, Vivek Natarajan, Christopher Nielson, Thomas F. Osborne, Rajiv Raman 0003, Kim Ramasamy, Rory Sayres, Jessica Schrouff, Martin G. Seneviratne, Shannon Sequeira, Harini Suresh, Victor Veitch, Max Vladymyrov, Xuezhi Wang 0002, Kellie Webster, Steve Yadlowsky, Taedong Yun, Xiaohua Zhai, D. Sculley |
J. Mach. Learn. Res. | 18 |
| 2021 | SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic RegressionabstractLogistic regression remains one of the most widely used tools in applied statistics, machine learning and data science. However, in moderately high-dimensional problems, where the number of features $d$ is a non-negligible fraction of the sample size $n$, the logistic regression maximum likelihood estimator (MLE), and statistical procedures based the large-sample approximation of its distribution, behave poorly. Recently, Sur and Candès (2019) showed that these issues can be corrected by applying a new approximation of the MLE's sampling distribution in this high-dimensional regime. Unfortunately, these corrections are difficult to implement in practice, because they require an estimate of the \emph{signal strength}, which is a function of the underlying parameters $\beta$ of the logistic regression. To address this issue, we propose SLOE, a fast and straightforward approach to estimate the signal strength in logistic regression. The key insight of SLOE is that the Sur and Candès (2019) correction can be reparameterized in terms of the corrupted signal strength, which is only a function of the estimated parameters $\widehat \beta$. We propose an estimator for this quantity, prove that it is consistent in the relevant high-dimensional regime, and show that dimensionality correction using SLOE is accurate in finite samples. Compared to the existing ProbeFrontier heuristic, SLOE is conceptually simpler and orders of magnitude faster, making it suitable for routine use. We demonstrate the importance of routine dimensionality correction in the Heart Disease dataset from the UCI repository, and a genomics application using data from the UK Biobank. Steve Yadlowsky, Taedong Yun, Cory Y. McLean, Alexander D'Amour |
NeurIPS | 3 |
| 2021 | Accurate, scalable cohort variant calls using DeepVariant and GLnexusabstractMOTIVATION: Population-scale sequenced cohorts are foundational resources for genetic analyses, but processing raw reads into analysis-ready cohort-level variants remains challenging. RESULTS: We introduce an open-source cohort-calling method that uses the highly accurate caller DeepVariant and scalable merging tool GLnexus. Using callset quality metrics based on variant recall and precision in benchmark samples and Mendelian consistency in father-mother-child trios, we optimize the method across a range of cohort sizes, sequencing methods and sequencing depths. The resulting callsets show consistent quality improvements over those generated using existing best practices with reduced cost. We further evaluate our pipeline in the deeply sequenced 1000 Genomes Project (1KGP) samples and show superior callset quality metrics and imputation reference panel performance compared to an independently generated GATK Best Practices pipeline. AVAILABILITY AND IMPLEMENTATION: We publicly release the 1KGP individual-level variant calls and cohort callset (https://console.cloud.google.com/storage/browser/brain-genomics-public/research/cohort/1KGP) to foster additional development and evaluation of cohort merging methods as well as broad studies of genetic variation. Both DeepVariant (https://github.com/google/deepvariant) and GLnexus (https://github.com/dnanexus-rnd/GLnexus) are open-source, and the optimized GLnexus setup discovered in this study is also integrated into GLnexus public releases v1.2.2 and later. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Taedong Yun, Helen Li, Pi-Chuan Chang, Michael F. Lin, Andrew Carroll, Cory Y. McLean |
Bioinform. | 6 |
| 2019 | GenomeWarp: an alignment-based variant coordinate transformationabstractSUMMARY: Reference genomes are refined to reflect error corrections and other improvements. While this process improves novel data generation and analysis, incorporating data analyzed on an older reference genome assembly requires transforming the coordinates and representations of the data to the new assembly. Multiple tools exist to perform this transformation for coordinate-only data types, but none supports accurate transformation of genome-wide short variation. Here we present GenomeWarp, a tool for efficiently transforming variants between genome assemblies. GenomeWarp transforms regions and short variants in a conservative manner to minimize false positive and negative variants in the target genome, and converts over 99% of regions and short variants from a representative human genome. AVAILABILITY AND IMPLEMENTATION: GenomeWarp is written in Java. All source code and the user manual are freely available at https://github.com/verilylifesciences/genomewarp. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Cory Y. McLean, Yeongwoo Hwang, Ryan Poplin, Mark A. DePristo |
Bioinform. | 1 |