6 problems
- 0 votes0 replies1 view
Near-optimality of the ℓ₀-penalised least-squares method for piecewise polynomials
Near-optimality conjecture. For all , the -penalised least-squares method should itself be nearly optimal in both the signal-strength condition and the loca…
- 0 votes0 replies0 views
Tanaka's convergence-rate conjecture for the monotone single index estimator
Let , where is a -dimensional random vector, is an unknown monotone link function,…
- 0 votes0 replies0 views
Conjecture on sieve-free selection of least squares estimators for piecewise monotone signals
Let denote the least squares estimator associated with a model or cone indexed by . In the model-selection setting for piecewise monotone signals, one see…
- 0 votes0 replies1 view
Unrestricted least-squares rate conjecture for anti-Monge matrices
Let y=\theta^*(\boldsymbol{[?])+[?] be observed under the latent-permutation anti-Monge model, and let denote the unrestricted anti-Monge parameter space. The…
- 0 votes0 replies0 views
The mixed-design convergence-rate conjecture for the monotone single index model
Let be a covariate vector whose components may be continuous or discrete, and consider the bundled least-squares estimator in the monotone single index model. Mixed-design conv…
- 0 votes0 replies1 view
The n^{-1/2} rate conjecture for the convex least-squares estimator under misspecification
Let the true function be non-convex, and let its projection onto the class of convex functions have linear components, called misspecified regions. Let the LSE denote the convex le…