Our purpose in this paper is to provide a general approach to model selection via penalization for Gaussian regression and to develop our point of view about this subject. The advantage and importance of model selection come from the fact that it provides a suitable approach to many different types of problems, starting from model selection per se (among a family of parametric models, which one is more suitable for the data at hand), which includes for instance variable selection in regression models,...

We prove asymptotic formulas for the behavior of Gelfand and Kolmogorov numbers of Sobolev embeddings between Besov and Triebel-Lizorkin spaces of radial distributions. Our method works also for Weyl numbers.

For a precompact subset K of a Hilbert space we prove the following inequalities: $n^{1/2}cₙ\left(cov\left(K\right)\right)\le c_K(1+{\sum }_{k=1}^{ⁿ}{k}^{-1/2}{e}_k\left(K\right))$, n ∈ ℕ, and $k^{1/2}{c}_{k+n}\left(cov\left(K\right)\right)\le c[lo{g}^{1/2}(n+1)\epsilon ₙ\left(K\right)+{\sum }_{j=n+1}^{\infty }{\epsilon }_j\left(K\right)/\left(jlo{g}^{1/2}(j+1)\right)]$, k,n ∈ ℕ, where cₙ(cov(K)) is the nth Gelfand number of the absolutely convex hull of K and ${\epsilon }_k\left(K\right)$ and $e_k\left(K\right)$ denote the kth entropy and kth dyadic entropy number of K, respectively. The inequalities are, essentially, a reformulation of the corresponding inequalities given in [CKP] which yield asymptotically optimal estimates of the Gelfand numbers cₙ(cov(K)) provided that the entropy numbers εₙ(K) are slowly...

By a general Franklin system corresponding to a dense sequence of knots 𝓣 = (tₙ, n ≥ 0) in [0,1] we mean a sequence of orthonormal piecewise linear functions with knots 𝓣, that is, the nth function of the system has knots t₀, ..., tₙ. The main result of this paper is a characterization of sequences 𝓣 for which the corresponding general Franklin system is a basis or an unconditional basis in H¹[0,1].

We show that each general Haar system is permutatively equivalent in $L^p\left([0,1]\right)$, 1 < p < ∞, to a subsequence of the classical (i.e. dyadic) Haar system. As a consequence, each general Haar system is a greedy basis in $L^p\left([0,1]\right)$, 1 < p < ∞. In addition, we give an example of a general Haar system whose tensor products are greedy bases in each $L^p\left({[0,1]}^d\right)$, 1 < p < ∞, d ∈ ℕ. This is in contrast to [11], where it has been shown that the tensor products of the dyadic Haar system are not greedy bases in $L^p\left({[0,1]}^d\right)$ for 1...

We study the uniform approximation properties of general multivariate singular integral operators on ${ℝ}^N$, N ≥ 1. We establish their convergence to the unit operator with rates. The estimates are pointwise and uniform. The established inequalities involve the multivariate higher order modulus of smoothness. We list the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators to which this theory can be applied directly.

We investigate generalized Bochner-Riesz means at the critical index on spaces generated by smooth blocks and give some approximation theorems.

We present algorithms for the determination of polynomials orthogonal with respect to a positive weight function multiplied by a polynomial with simple roots inside the interval of integration. We apply these algorithms to search for and calculate all possible sequences of imbedded quadratures of maximal polynomials order of precision for the generalized Laguerre and Hermite weight functions.