EDBT 2026 Demo / reviewers in the wild / expert
Daniel J. McDonald
dblp:28/9362
· DBLP profile ↗
6ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0002-0443-4282ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 66% Environmental and earth informatics · 34% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Artificial intelligence
1 paper |
Optimization for machine learning · 50% Learning theory · 50% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Environmental and earth informatics › climate science
climate data analysis |
0.4 | 1 | 2019 | Algorithms for Estimating Trends in Global Temperature Volatility · AAAI 2019 |
Bioinformatics and computational biology
gene expression analysis |
0.3 | 1 | 2017 | Predicting phenotypes from microarrays using amplified, initially marginal, eigenvector regression · Bioinform. 2017 |
Bioinformatics and computational biology › survival analysis › survival prediction
gene expression-based survival prediction |
0.3 | 1 | 2017 | Predicting phenotypes from microarrays using amplified, initially marginal, eigenvector regression · Bioinform. 2017 |
Bioinformatics and computational biology › statistical genetics
phenotype prediction |
0.3 | 1 | 2017 | Predicting phenotypes from microarrays using amplified, initially marginal, eigenvector regression · Bioinform. 2017 |
Machine learning › Learning theory › model selection
cross-validation |
0.2 | 1 | 2013 | The lasso, persistence, and cross-validation · ICML (3) 2013 |
Machine learning › Optimization for machine learning › regularized risk minimization › regularized regression
lasso |
0.2 | 1 | 2013 | The lasso, persistence, and cross-validation · ICML (3) 2013 |
Environmental and earth informatics › remote sensing
satellite remote sensing |
0.1 | 1 | 2019 | Algorithms for Estimating Trends in Global Temperature Volatility · AAAI 2019 |
Bioinformatics and computational biology › gene expression analysis
gene selection |
0.1 | 1 | 2017 | Predicting phenotypes from microarrays using amplified, initially marginal, eigenvector regression · Bioinform. 2017 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.8multiresolution analysis · 0.8marginal regression · 0.3low-dimensional embedding · 0.3eigenvector regression · 0.3risk consistency · 0.2high-dimensional statistics · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | rtestim: Time-varying reproduction number estimation with trend filteringabstractTo understand the transmissibility and spread of infectious diseases, epidemiologists turn to estimates of the instantaneous reproduction number. While many estimation approaches exist, their utility may be limited. Challenges of surveillance data collection, model assumptions that are unverifiable with data alone, and computationally inefficient frameworks are critical limitations for many existing approaches. We propose a discrete spline-based approach that solves a convex optimization problem-Poisson trend filtering-using the proximal Newton method. It produces a locally adaptive estimator for instantaneous reproduction number estimation with heterogeneous smoothness. Our methodology remains accurate even under some process misspecifications and is computationally efficient, even for large-scale data. The implementation is easily accessible in a lightweight R package rtestim. Jiaping Liu, Zhenglun Cai, Paul Gustafson, Daniel J. McDonald |
PLoS Comput. Biol. | 4 |
| 2019 | Algorithms for Estimating Trends in Global Temperature VolatilityabstractTrends in terrestrial temperature variability are perhaps more relevant for species viability than trends in mean temperature. In this paper, we develop methodology for estimating such trends using multi-resolution climate data from polar orbiting weather satellites. We derive two novel algorithms for computation that are tailored for dense, gridded observations over both space and time. We evaluate our methods with a simulation that mimics these data’s features and on a large, publicly available, global temperature dataset with the eventual goal of tracking trends in cloud reflectance temperature variability. Arash Khodadadi, Daniel J. McDonald |
AAAI | 2 |
| 2017 | Predicting phenotypes from microarrays using amplified, initially marginal, eigenvector regressionabstractMOTIVATION: The discovery of relationships between gene expression measurements and phenotypic responses is hampered by both computational and statistical impediments. Conventional statistical methods are less than ideal because they either fail to select relevant genes, predict poorly, ignore the unknown interaction structure between genes, or are computationally intractable. Thus, the creation of new methods which can handle many expression measurements on relatively small numbers of patients while also uncovering gene-gene relationships and predicting well is desirable. RESULTS: We develop a new technique for using the marginal relationship between gene expression measurements and patient survival outcomes to identify a small subset of genes which appear highly relevant for predicting survival, produce a low-dimensional embedding based on this small subset, and amplify this embedding with information from the remaining genes. We motivate our methodology by using gene expression measurements to predict survival time for patients with diffuse large B-cell lymphoma, illustrate the behavior of our methodology on carefully constructed synthetic examples, and test it on a number of other gene expression datasets. Our technique is computationally tractable, generally outperforms other methods, is extensible to other phenotypes, and also identifies different genes (relative to existing methods) for possible future study. AVAILABILITY AND IMPLEMENTATION: All of the code and data are available at http://mypage.iu.edu/∼dajmcdon/research/ . CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary material is available at Bioinformatics online. Daniel J. McDonald |
Bioinform. | 2 |
| 2017 | Nonparametric Risk Bounds for Time-Series ForecastingabstractWe derive generalization error bounds for traditional time- series forecasting models. Our results hold for many standard forecasting tools including autoregressive models, moving average models, and, more generally, linear state-space models. These non-asymptotic bounds need only weak assumptions on the data-generating process, yet allow forecasters to select among competing models and to guarantee, with high probability, that their chosen model will perform well. We motivate our techniques with and apply them to standard economic and financial forecasting tools---a GARCH model for predicting equity volatility and a dynamic stochastic general equilibrium model (DSGE), the standard tool in macroeconomic forecasting. We demonstrate in particular how our techniques can aid forecasters and policy makers in choosing models which behave well under uncertainty and mis-specification. Daniel J. McDonald, Cosma Rohilla Shalizi, Mark J. Schervish |
J. Mach. Learn. Res. | 1 |
| 2014 | Leave-one-out cross-validation is risk consistent for lasso
Darren Homrighausen, Daniel J. McDonald |
Mach. Learn. | 2 |
| 2013 | The lasso, persistence, and cross-validationabstractDuring the last fifteen years, the lasso procedure has been the target of a substantial amount of theoretical and applied research. Correspondingly, many results are known about its behavior for a fixed or optimally chosen smoothing parameter (given up to unknown constants). Much less, however, is known about the lasso’s behavior when the smoothing parameter is chosen in a data dependent way. To this end, we give the first result about the risk consistency of lasso when the smoothing parameter is chosen via cross-validation. We consider the high-dimensional setting wherein the number of predictors p=n^α, α>0 grows with the number of observations. Darren Homrighausen, Daniel J. McDonald |
ICML (3) | 2 |