Displaying similar documents to “Compact hypothesis and extremal set estimators”

Estimator selection in the gaussian setting

Yannick Baraud, Christophe Giraud, Sylvie Huet (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider the problem of estimating the mean f of a Gaussian vector Y with independent components of common unknown variance σ 2 . Our estimation procedure is based on estimator selection. More precisely, we start with an arbitrary and possibly infinite collection 𝔽 of estimators of f based on Y and, with the same data Y , aim at selecting an estimator among 𝔽 with the smallest Euclidean risk. No assumptions on the estimators are made and their dependencies with respect to Y may be unknown....

Orthogonal series regression estimation under long-range dependent errors

Waldemar Popiński (2001)

Applicationes Mathematicae

Similarity:

This paper is concerned with general conditions for convergence rates of nonparametric orthogonal series estimators of the regression function. The estimators are obtained by the least squares method on the basis of an observation sample Y i = f ( X i ) + η i , i=1,...,n, where X i A d are independently chosen from a distribution with density ϱ ∈ L¹(A) and η i are zero mean stationary errors with long-range dependence. Convergence rates of the error n - 1 i = 1 n ( f ( X i ) - f ̂ N ( X i ) ) ² for the estimator f ̂ N ( x ) = k = 1 N c ̂ k e k ( x ) , constructed using an orthonormal system...

Optimal estimators in learning theory

V. N. Temlyakov (2006)

Banach Center Publications

Similarity:

This paper is a survey of recent results on some problems of supervised learning in the setting formulated by Cucker and Smale. Supervised learning, or learning-from-examples, refers to a process that builds on the base of available data of inputs x i and outputs y i , i = 1,...,m, a function that best represents the relation between the inputs x ∈ X and the corresponding outputs y ∈ Y. The goal is to find an estimator f z on the base of given data z : = ( ( x , y ) , . . . , ( x m , y m ) ) that approximates well the regression function...

Spatially adaptive density estimation by localised Haar projections

Florian Gach, Richard Nickl, Vladimir Spokoiny (2013)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Given a random sample from some unknown density f 0 : [ 0 , ) we devise Haar wavelet estimators for f 0 with variable resolution levels constructed from localised test procedures (as in Lepski, Mammen and Spokoiny ( (1997) 927–947)). We show that these estimators satisfy an oracle inequality that adapts to heterogeneous smoothness of f 0 , simultaneously for every point x in a fixed interval, in sup-norm loss. The thresholding constants involved in the test procedures can be chosen in...

On orthogonal series estimation of bounded regression functions

Waldemar Popiński (2001)

Applicationes Mathematicae

Similarity:

The problem of nonparametric estimation of a bounded regression function f L ² ( [ a , b ] d ) , [a,b] ⊂ ℝ, d ≥ 1, using an orthonormal system of functions e k , k=1,2,..., is considered in the case when the observations follow the model Y i = f ( X i ) + η i , i=1,...,n, where X i and η i are i.i.d. copies of independent random variables X and η, respectively, the distribution of X has density ϱ, and η has mean zero and finite variance. The estimators are constructed by proper truncation of the function f ̂ ( x ) = k = 1 N ( n ) c ̂ k e k ( x ) , where the coefficients c ̂ , . . . , c ̂ N ( n ) ...

On the strong Brillinger-mixing property of α -determinantal point processes and some applications

Lothar Heinrich (2016)

Applications of Mathematics

Similarity:

First, we derive a representation formula for all cumulant density functions in terms of the non-negative definite kernel function C ( x , y ) defining an α -determinantal point process (DPP). Assuming absolute integrability of the function C 0 ( x ) = C ( o , x ) , we show that a stationary α -DPP with kernel function C 0 ( x ) is “strongly” Brillinger-mixing, implying, among others, that its tail- σ -field is trivial. Second, we use this mixing property to prove rates of normal convergence for shot-noise processes and sketch...

Density estimation via best L 2 -approximation on classes of step functions

Dietmar Ferger, John Venz (2017)

Kybernetika

Similarity:

We establish consistent estimators of jump positions and jump altitudes of a multi-level step function that is the best L 2 -approximation of a probability density function f . If f itself is a step-function the number of jumps may be unknown.

Robin functions and extremal functions

T. Bloom, N. Levenberg, S. Ma'u (2003)

Annales Polonici Mathematici

Similarity:

Given a compact set K N , for each positive integer n, let V ( n ) ( z ) = V K ( n ) ( z ) := sup 1 / ( d e g p ) V p ( K ) ( p ( z ) ) : p holomorphic polynomial, 1 ≤ deg p ≤ n. These “extremal-like” functions V K ( n ) are essentially one-variable in nature and always increase to the “true” several-variable (Siciak) extremal function, V K ( z ) := max[0, sup1/(deg p) log|p(z)|: p holomorphic polynomial, | | p | | K 1 ]. Our main result is that if K is regular, then all of the functions V K ( n ) are continuous; and their associated Robin functions ϱ V K ( n ) ( z ) : = l i m s u p | λ | [ V K ( n ) ( λ z ) - l o g ( | λ | ) ] increase to ϱ K : = ϱ V K for all z outside a pluripolar...

Estimating composite functions by model selection

Yannick Baraud, Lucien Birgé (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider the problem of estimating a function s on [ - 1 , 1 ] k for large values of k by looking for some best approximation of s by composite functions of the form g u . Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions g , u and statistical frameworks. In particular, we handle the problems of approximating s by additive functions, single and multiple index models, artificial neural networks, mixtures...

Notes on strongly Whyburn spaces

Masami Sakai (2016)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce the notion of a strongly Whyburn space, and show that a space X is strongly Whyburn if and only if X × ( ω + 1 ) is Whyburn. We also show that if X × Y is Whyburn for any Whyburn space Y , then X is discrete.

On reliability analysis of consecutive k -out-of- n systems with arbitrarily dependent components

Ebrahim Salehi (2016)

Applications of Mathematics

Similarity:

In this paper, we consider the linear and circular consecutive k -out-of- n systems consisting of arbitrarily dependent components. Under the condition that at least n - r + 1 components ( r n ) of the system are working at time t , we study the reliability properties of the residual lifetime of such systems. Also, we present some stochastic ordering properties of residual lifetime of consecutive k -out-of- n systems. In the following, we investigate the inactivity time of the component with lifetime...

Complex series and connected sets

B. Jasek

Similarity:

CONTENTSPREFACE..........................................................................................................................................................................3INTRODUCTION............................................................................................................................................................. 41. Notation. 2. Subject of the paper.Chapter I. DECOMPOSITION OF Σ INTO Σ 1 , Σ 2 , Σ 3 , Σ 4 INESSENTIAL RESTRICTIONOF GENERALITY ...............................................................................................................................................................

Orthogonal series estimation of band-limited regression functions

Waldemar Popiński (2014)

Applicationes Mathematicae

Similarity:

The problem of nonparametric function fitting using the complete orthogonal system of Whittaker cardinal functions s k , k = 0,±1,..., for the observation model y j = f ( u j ) + η j , j = 1,...,n, is considered, where f ∈ L²(ℝ) ∩ BL(Ω) for Ω > 0 is a band-limited function, u j are independent random variables uniformly distributed in the observation interval [-T,T], η j are uncorrelated or correlated random variables with zero mean value and finite variance, independent of the observation points. Conditions...

Positivity and anti-maximum principles for elliptic operators with mixed boundary conditions

Catherine Bandle, Joachim von Below, Wolfgang Reichel (2008)

Journal of the European Mathematical Society

Similarity:

We consider linear elliptic equations - Δ u + q ( x ) u = λ u + f in bounded Lipschitz domains D N with mixed boundary conditions u / n = σ ( x ) λ u + g on D . The main feature of this boundary value problem is the appearance of λ both in the equation and in the boundary condition. In general we make no assumption on the sign of the coefficient σ ( x ) . We study positivity principles and anti-maximum principles. One of our main results states that if σ is somewhere negative, q 0 and D q ( x ) d x > 0 then there exist two eigenvalues λ - 1 , λ 1 such the positivity...

Comparison between two types of large sample covariance matrices

Guangming Pan (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Let { X i j } , i , j = , be a double array of independent and identically distributed (i.i.d.) real random variables with E X 11 = μ , E | X 11 - μ | 2 = 1 and E | X 11 | 4 l t ; . Consider sample covariance matrices (with/without empirical centering) 𝒮 = 1 n j = 1 n ( 𝐬 j - 𝐬 ¯ ) ( 𝐬 j - 𝐬 ¯ ) T and 𝐒 = 1 n j = 1 n 𝐬 j 𝐬 j T , where 𝐬 ¯ = 1 n j = 1 n 𝐬 j and 𝐬 j = 𝐓 n 1 / 2 ( X 1 j , ... , X p j ) T with ( 𝐓 n 1 / 2 ) 2 = 𝐓 n , non-random symmetric non-negative definite matrix. It is proved that central limit theorems of eigenvalue statistics of 𝒮 and 𝐒 are different as n with p / n approaching a positive constant. Moreover, it is also proved that such a different behavior is not observed in the...

On graceful colorings of trees

Sean English, Ping Zhang (2017)

Mathematica Bohemica

Similarity:

A proper coloring c : V ( G ) { 1 , 2 , ... , k } , k 2 of a graph G is called a graceful k -coloring if the induced edge coloring c ' : E ( G ) { 1 , 2 , ... , k - 1 } defined by c ' ( u v ) = | c ( u ) - c ( v ) | for each edge u v of G is also proper. The minimum integer k for which G has a graceful k -coloring is the graceful chromatic number χ g ( G ) . It is known that if T is a tree with maximum degree Δ , then χ g ( T ) 5 3 Δ and this bound is best possible. It is shown for each integer Δ 2 that there is an infinite class of trees T with maximum degree Δ such that χ g ( T ) = 5 3 Δ . In particular, we investigate for each...

Computing the greatest 𝐗 -eigenvector of a matrix in max-min algebra

Ján Plavka (2016)

Kybernetika

Similarity:

A vector x is said to be an eigenvector of a square max-min matrix A if A x = x . An eigenvector x of A is called the greatest 𝐗 -eigenvector of A if x 𝐗 = { x ; x ̲ x x ¯ } and y x for each eigenvector y 𝐗 . A max-min matrix A is called strongly 𝐗 -robust if the orbit x , A x , A 2 x , reaches the greatest 𝐗 -eigenvector with any starting vector of 𝐗 . We suggest an O ( n 3 ) algorithm for computing the greatest 𝐗 -eigenvector of A and study the strong 𝐗 -robustness. The necessary and sufficient conditions for strong 𝐗 -robustness are introduced...

On the regularity of the one-sided Hardy-Littlewood maximal functions

Feng Liu, Suzhen Mao (2017)

Czechoslovak Mathematical Journal

Similarity:

In this paper we study the regularity properties of the one-dimensional one-sided Hardy-Littlewood maximal operators + and - . More precisely, we prove that + and - map W 1 , p ( ) W 1 , p ( ) with 1 < p < , boundedly and continuously. In addition, we show that the discrete versions M + and M - map BV ( ) BV ( ) boundedly and map l 1 ( ) BV ( ) continuously. Specially, we obtain the sharp variation inequalities of M + and M - , that is, Var ( M + ( f ) ) Var ( f ) and Var ( M - ( f ) ) Var ( f ) if f BV ( ) , where Var ( f ) is the total variation of f on and BV ( ) is the set of all functions f : satisfying Var ( f ) < .