SOURCE-LINKED INTELLIGENCE

Graph-dependent shrinkage priors for Bayesian trend filtering

arXiv · AI, language, vision and robotics · article · Aug 24, 2026 · UTC

Many common data dependencies can be characterized by graphs: time series data are sequential (chain graph), images appear as pixels (lattice graph), areal data are defined by neighboring units (spatial adjacency graph), etc. Graph trend filtering seeks to smooth and predict such data. However, classical trend filtering only incorporates the graph for estimation of the trend, which limits its adaptivity, and is brittle in the presence of missing data. Further, it lacks uncertainty quantification and faces certain computing challenges. We address these limitations with a comprehensive Bayesian

Read original source ↗ Open in workspace

recordType

paper

region

Global