SearcharxivSearch

arXiv · 1601.06844

Multivariate convex regression: global risk bounds and adaptation

Abstract

We study the problem of estimating a multivariate convex function defined on a convex body in a regression setting with random design. We are interested in optimal rates of convergence under a squared global continuous $l_2$ loss in the multivariate setting $(d\geq 2)$. One crucial fact is that the minimax risks depend heavily on the shape of the support of the regression function. It is shown that the global minimax risk is on the order of $n^{-2/(d+1)}$ when the support is sufficiently smooth, but that the rate $n^{-4/(d+4)}$ is when the support is a polytope. Such differences in rates are due to difficulties in estimating the regression function near the boundary of smooth regions. We then study the natural bounded least squares estimators (BLSE): we show that the BLSE nearly attains the optimal rates of convergence in low dimensions, while suffering rate-inefficiency in high dimensions. We show that the BLSE adapts nearly parametrically to polyhedral functions when the support is polyhedral in low dimensions by a local entropy method. We also show that the boundedness constraint cannot be dropped when risk is assessed via continuous $l_2$ loss. Given rate sub-optimality of the BLSE in higher dimensions, we further study rate-efficient adaptive estimation procedures. Two general model selection methods are developed to provide sieved adaptive estimators (SAE) that achieve nearly optimal rates of convergence for particular "regular" classes of convex functions, while maintaining nearly parametric rate-adaptivity to polyhedral functions in arbitrary dimensions. Interestingly, the uniform boundedness constraint is unnecessary when risks are measured in discrete $l_2$ norms.

Explore related subjects

Keep this discovery

BibTeXRIS

Qiyang Han, Jon A. Wellner. 2016-01-25. Multivariate convex regression: global risk bounds and adaptation. https://arxiv.org/abs/1601.06844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Scale Invariance Property of PCA

The PCA algorithm is sensitive to changes in measurement scale. Measuring one variable of a system in inches rather than centimeters, say, alters both its principal axes and principal eigenvalues. Although this scale dependence is generally complicated, we show here that it nevertheless obeys a strict invariance property: under a continuous scale adjustment, the initial state's $k$-th largest principal component (ordered by eigenvalue) continuously evolves into the final state's $k$-th largest principal component, for each $k$. In this sense, we can say that the modes of PCA are "order-stable" with respect to changes in measurement scale. A special case occurs when scaling along directions that are orthogonal to some modes. Here, apparent eigenvalue crossings can occur. However, we show that we can interpret these apparent crossings as cases where the modes instantaneously swap their orientation, in this way maintaining the required order stability.

math.ST

Small noise asymptotics for linear parabolic SPDEs in two space dimensions with unknown damping factors

We study parametric estimation for second order linear parabolic stochastic partial differential equations in two space dimensions with a small volatility parameter driven by a $Q$-Wiener process with an unknown damping parameter using high frequency spatio-temporal data. We first provide an estimator for the damping parameter of the $Q$-Wiener process utilizing realized quadratic variations based on spatial and temporal increments. We next propose minimum contrast estimators of the diffusive and advective parameters in the SPDE using a contrast function with the proposed estimator of the damping parameter. We then construct a quasi-maximum likelihood estimator of the reaction parameter in the SPDE using the approximate coordinate process derived from the estimators of the diffusive and advective parameters. We also provide simulation results of the proposed estimators.

math.ST

Spike Estimation from Heteroscedastic Noise via Random Splitting

In this paper, we consider a spiked Wigner type matrix with a heteroscedastic and unknown variance profile. It is well known that in the supercritical regime of the BBP transition, strong spikes can create outliers in the spectrum. Unfortunately, in the heteroscedastic case, in general it is not possible to estimate the spike strength from these observed outlier consistently, as the latter is a solution to a Dyson equation with unknown parameters from the variance profile. In this paper, inspired by the work on sparse matrix completion \citep{BordenaveCosteNadakuditi2023}, we introduce an asymmetrized model by randomly splitting the spiked matrix into two parts, which transforms the noisy Wigner type matrix into a non Hermitian random matrix, while preserving the Hermitian spikes at the cost of a dilution. We establish a BBP type transition for the asymmetrized model, from which we can estimate the strength of the spikes precisely, even without knowing the variance profile of the noise part. We then further apply our approach to study the correlation between two correlated spiked models, where the spike/signal parts of the two models are correlated, and the noise parts are independent but may both be heteroscedastic. By applying our asymmetrization approach to the two models separately and also jointly, we are able to obtain a precise estimate of the correlation between the signal parts of the two models.

math.ST