Uncertainty Quantification in Graph-Based Classification of High Dimensional Data

DOI10.1137/17M1134214zbMath1394.62083arXiv1703.08816OpenAlexW2786364421WikidataQ129970816 ScholiaQ129970816MaRDI QIDQ3176234

Xiyang Luo, Konstantinos C. Zygalakis, Andrea L. Bertozzi, Andrew M. Stuart

Publication date: 19 July 2018

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.08816

zbMATH Keywords

Bayesian modeluncertainty quantificationGaussian priorgraph classificationprobit classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (32)

A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors ⋮ Lipschitz Regularity of Graph Laplacians on Random Data Clouds ⋮ Continuum Limits of Posteriors in Graph Bayesian Inverse Problems ⋮ Gradient flows and randomised thresholding: sparse inversion and classification* ⋮ Unnamed Item ⋮ Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs ⋮ Unnamed Item ⋮ Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization ⋮ Spectral analysis of weighted Laplacians arising in data clustering ⋮ Classification and image processing with a semi‐discrete scheme for fidelity forced Allen–Cahn on graphs ⋮ Spectral gaps and error estimates for infinite-dimensional Metropolis-Hastings with non-Gaussian priors ⋮ Bayesian Inverse Problems Are Usually Well-Posed ⋮ Multilevel approximation of Gaussian random fields: Fast simulation ⋮ Data Based Construction of Kernels for Classification ⋮ Kernel Methods for Bayesian Elliptic Inverse Problems on Manifolds ⋮ Minimax lower bounds for function estimation on graphs ⋮ Posterior consistency of semi-supervised regression on graphs ⋮ Stability of Gibbs Posteriors from the Wasserstein Loss for Bayesian Full Waveform Inversion ⋮ Properly-weighted graph Laplacian for semi-supervised learning ⋮ Stochastic block models are a discrete surface tension ⋮ Ensemble Kalman inversion: a derivative-free technique for machine learning tasks ⋮ On the Well-posedness of Bayesian Inverse Problems ⋮ The Bayesian update: variational formulations and gradient flows ⋮ Analysis of $p$-Laplacian Regularization in Semisupervised Learning ⋮ Semi-supervised learning with summary statistics ⋮ Unnamed Item ⋮ Data-driven prediction of multistable systems from sparse measurements ⋮ The SPDE approach to Matérn fields: graph representations ⋮ Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds ⋮ Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds ⋮ Gaussian Process Landmarking on Manifolds ⋮ Graph-based prior and forward models for inverse problems on manifolds with boundaries

Uses Software

• MNIST
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Bayesian level set method for geometric inverse problems
• Multi-parameter regularization and its numerical realization
• Wavelets on graphs via spectral graph theory
• Weak convergence and optimal scaling of random walk Metropolis algorithms
• Nonparametric Bayesian label prediction on a graph
• Hierarchical Bayesian level set inversion
• \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
• Diffuse interface methods for multiclass segmentation of high-dimensional data
• Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
• Convergence of the graph Allen-Cahn scheme
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data
• On the Brittleness of Bayesian Inference
• Optimal Uncertainty Quantification
• An MBO Scheme on Graphs for Classification and Image Processing
• Introduction to Uncertainty Quantification
• MCMC METHODS FOR DIFFUSION BRIDGES
• Learning Theory
• Diffuse Interface Models on Graphs for Classification of High Dimensional Data
• MCMC methods for functions: modifying old algorithms to make them faster

This page was built for publication: Uncertainty Quantification in Graph-Based Classification of High Dimensional Data