Translator Disclaimer
2018 Minimax lower bounds for function estimation on graphs
Alisa Kirichenko, Harry van Zanten
Electron. J. Statist. 12(1): 651-666 (2018). DOI: 10.1214/18-EJS1407

Abstract

We study minimax lower bounds for function estimation problems on large graph when the target function is smoothly varying over the graph. We derive minimax rates in the context of regression and classification problems on graphs that satisfy an asymptotic shape assumption and with a smoothness condition on the target function, both formulated in terms of the graph Laplacian.

Citation

Download Citation

Alisa Kirichenko. Harry van Zanten. "Minimax lower bounds for function estimation on graphs." Electron. J. Statist. 12 (1) 651 - 666, 2018. https://doi.org/10.1214/18-EJS1407

Information

Received: 1 September 2017; Published: 2018
First available in Project Euclid: 27 February 2018

zbMATH: 1388.62097
MathSciNet: MR3769191
Digital Object Identifier: 10.1214/18-EJS1407

JOURNAL ARTICLE
16 PAGES


SHARE
Vol.12 • No. 1 • 2018
Back to Top