Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peter W. MacDonald

dblp:348/9787 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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 · 77% Trustworthy machine learning · 23%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › relational model
statistical network models
0.912025
Latent Process Models for Functional Network Data · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression
0.712023
Approximate Post-Selective Inference for Regression with the Group LASSO · J. Mach. Learn. Res. 2023
Machine learning › Trustworthy machine learning › debiasing
selection bias mitigation
0.712023
Approximate Post-Selective Inference for Regression with the Group LASSO · J. Mach. Learn. Res. 2023
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.712023
Approximate Post-Selective Inference for Regression with the Group LASSO · J. Mach. Learn. Res. 2023
Mathematical optimization
gradient descent
0.312025
Latent Process Models for Functional Network Data · J. Mach. Learn. Res. 2025

Methods — techniques the papers use, named apart from their topics

gradient descent · 1.7functional basis representation · 1.7likelihood adjustment factor · 0.7group lasso · 0.7bayesian methods · 0.7
YearPublicationVenuePosition
2025 Latent Process Models for Functional Network Data
abstract
Network data are often sampled with auxiliary information or collected through the observation of a complex system over time, leading to multiple network snapshots indexed by a continuous variable. Many methods in statistical network analysis are traditionally designed for a single network, and can be applied to an aggregated network in this setting, but that approach can miss important functional structure. Here we develop an approach to estimating the expected network explicitly as a function of a continuous index, be it time or another indexing variable. We parameterize the network expectation through low dimensional latent processes, whose components we represent with a fixed, finite-dimensional functional basis. We derive a gradient descent estimation algorithm, establish theoretical guarantees for recovery of the low dimensional structure, compare our method to competitors, and apply it to a data set of international political interactions over time, showing our proposed method to adapt well to data, outperform competitors, and provide interpretable and meaningful results.
Peter W. MacDonald, Elizaveta Levina, Ji Zhu 0001
J. Mach. Learn. Res.1
2023 Approximate Post-Selective Inference for Regression with the Group LASSO
abstract
After selection with the Group LASSO (or generalized variants such as the overlapping, sparse, or standardized Group LASSO), inference for the selected parameters is unreliable in the absence of adjustments for selection bias. In the penalized Gaussian regression setup, existing approaches provide adjustments for selection events that can be expressed as linear inequalities in the data variables. Such a representation, however, fails to hold for selection with the Group LASSO and substantially obstructs the scope of subsequent post-selective inference. Key questions of inferential interest, e.g., inference for the effects of selected variables on the outcome, remain unanswered. In the present paper, we develop a consistent, post-selective, Bayesian method to address the existing gaps by deriving a likelihood adjustment factor and an approximation thereof that eliminates bias from the selection of groups. Experiments on simulated data and data from the Human Connectome Project demonstrate that our method recovers the effects of parameters within the selected groups while paying only a small price for bias adjustment.
Snigdha Panigrahi, Peter W. MacDonald, Daniel Kessler
J. Mach. Learn. Res.2