Exponential Family Trend Filtering on Lattices
Veeranjaneyulu Sadhanala, Robert Bassett, James Sharpnack, Daniel J. McDonald
TL;DR
The paper develops trend-filtering methods for exponential-family data on lattice graphs, motivated by massive climate datasets. It introduces Penalized MLE with a null-space penalty and Mean Trend Filter, analyzes their excess KL-risk under subexponential, heteroskedastic noise, and derives near-minimax rates under canonical scaling. An efficient linearized ADMM algorithm is provided, along with a risk-based tuning parameter selection framework. Empirical studies on simulations and real data (UC COVID-19 hospitalizations and temperature variability) demonstrate the methods’ practical utility and adaptive smoothing capabilities in high-dimensional grid settings.
Abstract
Trend filtering is a modern approach to nonparametric regression that is more adaptive to local smoothness than splines or similar basis procedures. Existing analyses of trend filtering focus on estimating a function corrupted by homoskedastic Gaussian noise, but our work extends this technique to general exponential family distributions. This extension is motivated by the need to study massive, gridded climate data derived from polar-orbiting satellites. We present algorithms tailored to large problems, theoretical results for general exponential family likelihoods, and principled methods for tuning parameter selection without excess computation.
