Abstract
We study the problem of inference (estimation and uncertainty quantification problems) on the unknown parameter in the biclustering model by using the penalization method. The underlying biclustering structure is that the high-dimensional parameter consists of a few blocks of equal coordinates. The quality of the inference procedures is measured by the local quantity, the oracle rate, which is the best trade-off between the approximation error by a biclustering structure and the complexity of that approximating biclustering structure. The approach is also robust in that the additive errors are assumed to satisfy only certain mild condition (allowing non-iid errors with unknown joint distribution). By using the penalization method, we construct a confidence set and establish its local (oracle) optimality. Interestingly, as we demonstrate, there is (almost) no deceptiveness issue for the uncertainty quantification problem in the biclustering model. Adaptive minimax results for the biclustering, stochastic block model (with implications for network modeling) and graphon scales follow from our local results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. M. Airoldi, and S. H. Chan, “A Consistent Histogram Estimator for Exchangeable Graph Models”, J. Machine Learn. Res. 32, 208–216 (2014).
E. M. Airoldi, T. B. Costa, and S. H. Chan, “Stochastic Block Model Approximation of a Graphon: Theory and Consistent Estimation”, Adv. Neural Inf. Process. Syst. 26, 692–700 (2013).
A. Babenko and E. Belitser, “Oracle Projection Convergence Rate of Posterior”, Math. Methods Statist. 19, 219–245 (2010).
Y. Baraud, “Confidence Balls in Gaussian Regression”, Ann. Statist. 32, 528–551 (2004).
E. Belitser, “On Coverage and Local Radial Rates of Credible Sets”, Ann. Statist. 45, 1124–1151 (2017).
E. Belitser and N. Nurushev, “Needles and Straw in a Haystack: Robust Empirical Bayes Confidence for Possibly Sparse Sequences”, ArXiv:1511.01803 (2015).
L. Birgé and P. Massart, “Gaussian Model Selection”, J. Europ. Math. Soc. 3, 203–268 (2001).
C. Gao, Y. Lu, and H. H. Zhou, “Rate-Optimal Graphon Estimation”, Ann. Statist. 43, 2624–2652 (2015).
C. Gao, Y. Lu, Z. Ma, and H. H. Zhou, “Optimal Estimation and Completion of Matrices with Biclustering Structures”, J. Machine Learn. Res. 17, 1–29 (2016).
J. A. Hartigan, “Direct Clustering of a Data Matrix”, J. Amer. Statist. Assoc. 67, 123–129 (1972).
O. Klopp, A. B. Tsybakov, and N. Verzelen, “Oracle Inequalities for Network Models and Sparse Graphon Estimation”, Ann. Statist. 45, 316–354 (2017).
K.-C. Li, “Honest Confidence Regions for Nonparametric Regression”, Ann. Statist. 17, 1001–1008 (1989).
S. C. Olhede and P. J. Wolfe, “Nonparametric Graphon Estimation”, ArXiv:1309.5936 (2013).
S. C. Olhede and P. J. Wolfe, “Network Histograms and Universality of Blockmodel Approximation”, Proc. Natl. Acad. Sci. USA 111, 14722–14727 (2014).
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Belitser, E., Nurushev, N. Local Inference by Penalization Method for Biclustering Model. Math. Meth. Stat. 27, 163–183 (2018). https://doi.org/10.3103/S1066530718030018
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066530718030018