activity
20202026
most citedMotif-Based Spectral Clustering of Weighted Directed Networks

8 citations · 11 across the 6 of their papers we have counts for

collaborators

7 papers

stat.ML2026

Efficient and Minimax Optimal In-context Nonparametric Regression with Transformers

Michelle Ching, Ioana Popescu, Nico Smith +3

We study in-context learning for nonparametric regression with -Hölder smooth regression functions, for some . We prove that, with in-context examples and -dimension…

stat.ME2025

Upgrading survival models with CARE

William G. Underwood, Henry W. J. Reeve, Oliver Y. Feng +3

Clinical risk prediction models are regularly updated as new data, often with additional covariates, become available. We propose CARE (Convex Aggregation of relative Risk Estimato…

math.ST2025

Sharp Anti-Concentration Inequalities for Extremum Statistics via Copulas

Matias D. Cattaneo, Ricardo P. Masini, William G. Underwood

We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of identically distributed real-valued random variables. Our first main…

math.ST2023

Inference with Mondrian Random Forests

Matias D. Cattaneo, Jason M. Klusowski, William G. Underwood

Random forests are popular methods for regression and classification analysis, and many different variants have been proposed in recent years. One interesting example is the Mondri…

math.ST2022★ 3 cited

Yurinskii's Coupling for Martingales

Matias D. Cattaneo, Ricardo P. Masini, William G. Underwood

Yurinskii's coupling is a popular theoretical tool for non-asymptotic distributional analysis in mathematical statistics and applied probability, offering a Gaussian strong approxi…

math.ST2022

Uniform Inference for Kernel Density Estimators with Dyadic Data

Matias D. Cattaneo, Yingjie Feng, William G. Underwood

Dyadic data is often encountered when quantities of interest are associated with the edges of a network. As such it plays an important role in statistics, econometrics and many oth…

cs.SI2020★ 8 cited

Motif-Based Spectral Clustering of Weighted Directed Networks

William George Underwood, Andrew Elliott, Mihai Cucuringu

Clustering is an essential technique for network analysis, with applications in a diverse range of fields. Although spectral clustering is a popular and effective method, it fails…