参数θ的函数f(θ)的极大似然估计

在微积分范围内给出了参数θ的函数f(θ)的极大似然估计.     

矩阵损失函数下参数估计的几个结果

在本文中,设随机向量 Y 的样本空间和分布族为((?)P_θ),θ∈(?),(?)为 p 维欧氏空间 R~p 中的 Borel 集.要估计θ的函数的向量 h(θ)=(h_1(θ),…,h_k(θ))'.文献[1]中第二章的定理1.4指出,若存在 h(θ)的无偏估计δ(Y),使得 E_θ(δ(Y)—h(θ))′(δ(Y)—h(θ))<∞,一切θ∈(?),则在损失函数(α—h(θ))′(α—h(θ))下,(?)(Y)是 h(θ)的一致最优无偏估计的充要条件是对 h(θ)的任何风险函数有限的无偏估     

定数截尾两参数指数——威布尔分布形状参数的Bayes估计

在不同的损失函数下,本文研究了两参数指数—威布尔分布(EWD)形状参数的Bayes估计问题.基于定数截尾试验,当其中一个形状参数α已知时,给出了另一个形状参数θ在三种不同损失函数下的Bayes估计表达式,并求得了可靠度函数的Bayes点估计.最后运用随机模拟方法,将Bayes估计和极大似然估计进行了比较.结果表明,LINEX损失下Bayes估计的精度比极大似然估计高.     

一类分布族的损失函数和风险函数的Bayes推断

本文考虑如下一类分布族:F(t)=[g(t)]θ,-∞A0(1)其中g(t)是关于t单调递增的可微函数,且g(A)=0,g(B)=1.在共轭先验分布下研究了未知参数η=1θ的损失函数和风险函数的B ayes估计及其保守性质,并给出相应的B ayes估计的合理性.     

不同损失函数下Pareto分布参数的Bayes估计

首先给出了Pareto分布参数的极大似然估计;其次在对称损失,二次损失,Mlinex损失函数下,给出了参数的Bayes估计,并证明了所给估计都是容许的;最后通过实例,对所给的几个估计的优良性进行了分析,结果表明在Mlinex损失下,参数θ的Bayes估计值更接近真实值     

Mlinex损失函数下一类分布族参数的Bayes估计

考虑分布函数形如F(x;θ)=1-[g(x)]~θ或[1—g(x)]~θ,A≤x≤B,θ0的分布族,其中g(x)是关于x单调递减的可微函数,且g(A)=1,g(B)=0.在Mlinex损失函数下,给出了其中参数θ的Bayes估计及其容许性,并对分布的一个充分统计量的逆线性形式的容许性进行讨论.最后通过蒙特卡洛模拟说明Bayes估计在小样本情形时的优良表现.     

指数分布参数的稳健估计

为了估计未知参数θ,传统的方法多是采用一致最小方差无偏估计(UMVUE)或极大似然估计(MLE),这里,它们恰好一样(参见[4]),为[1]对样本均值及其泛函的不稳健性进行了详细讨论.本文主要利用 Hampel 的影响函数方法,给出模型(1)参数θ的最优 M 估计,并给出具体数值,以便实际应用.     

函数型部分线性乘积模型的B-样条估计

本文研究了函数型部分线性乘积模型,该模型可用于响应变量为正数的函数型数据的统计建模问题,经过对数变换后模型转化为函数型部分线性模型.基于B-样条,通过极小化最小一乘相对误差(LARE)和最小乘积相对误差(LPRE),分别给出模型的LARE估计和LPRE估计,其中B-样条基的维数利用Schwarz信息准则选取.对两种估计方法分别给出斜率函数估计的相合性和参数部分估计的渐近正态性,并且证明了斜率函数的收敛率达到了非参数函数估计的最优速率.蒙特卡洛模拟用来比较所提出的方法与最小一乘(LAD)估计和最小二乘(LS)估计在不同误差分布下的有限样本性质,模拟结果表明所提方法是有效和实用的.最后通过一个实际数据分析的例子来说明模型的应用.     

双边截断型分布族参数函数的渐近最优经验Bayes估计

本文考虑一维双边截断型分布族参数函数在平方损失下的经验 Bayes估计问题 .给定θ,X的条件分布为f (x|θ) =ω(θ1,θ2 ) h(x) I[θ1,θ2 ] (x) dx其中θ =(θ1,θ2 )T(x) =(t1(x) ,t2 (x) ) =(min(x1,… ,xm) ,max(x1,… ,xm) )是充分统计量 ,其边缘密度为 f (t) ,本文通过 f (t)的核估计构造出θ的函数的经验 Bayes估计 ,并证明在一定的条件下是渐近最优的 (a.0 .)     

一类线性结构模型参数的极大似然估计及拟极大似然估计的渐近性质

不少作者探讨过参数的极大似然估计(以下简记为 MLE)的渐近性质.一些统计工作者还把极大似然估计方法用于估计部分参数.即在参数为θ=(θ′_1,θ′_2)′的模型中,当不易求出θ的 MLE,而我们的目的是估计 θ_2时,可将似然函数中其余的参数θ_1用它们的估计(?)来代替,然后极大化这个经代换后的似然函数来求得 θ_2的估计.这就是所谓拟极大似然估计(以下简记为 PMLE).     

Estimating the mean function of a Gaussian process and the Stein effect

The problem of global estimation of the mean function θ(·) of a quite arbitrary Gaussian process is considered. The loss function in estimating θ by a function a(·) is assumed to be of the form L(θ, a) = ∫ [θ(t) ? a(t)]²μ(dt), and estimators are evaluated in terms of their risk function (expected loss). The usual minimax estimator of θ is shown to be inadmissible via the Stein phenomenon; in estimating the function θ we are trying to simultaneously estimate a larger number of normal means. Estimators improving upon the usual minimax estimator are constructed, including an estimator which allows the incorporation of prior information about θ. The analysis is carried out by using a version of the Karhunen-Loéve expansion to represent the original problem as the problem of estimating a countably infinite sequence of means from independent normal distributions.     

Minimax pointwise estimation of an anisotropic regression function with unknown density of the design

Our aim in this paper is to estimate with best possible accuracy an unknown multidimensional regression function at a given point where the design density is also unknown. To reach this goal, we will follow the minimax approach: it will be assumed that the regression function belongs to a known anisotropic Hölder space. In contrast to the parameters defining the Hölder space, the density of the observations is assumed to be unknown and will be treated as a nuisance parameter. New minimax rates are exhibited as well as local polynomial estimators which achieve these rates. As these estimators depend on a tuning parameter, the problem of its selection is also discussed.     

A Kalman filter as a minimax estimator

A minimax terminal state estimation problem is posed for a linear plant and a generalized quadratic loss function. Sufficient conditions are developed to insure that a Kalman filter will provide a minimax estimate for the terminal state of the plant. It is further shown that this Kalman filter will not generally be a minimax estimate for the terminal state if the observation interval is arbitrarily long. Consequently, a subminimax estimate is defined, subject to a particular existence condition. This subminimax estimate is related to the Kalman filter, and it may provide a useful estimate for the terminal state when the performance of the Kalman filter is no longer satisfactory.     

Optimal rates of convergence in the Weibull model based on kernel-type estimators

Let F be a distribution function in the maximal domain of attraction of the Gumbel distribution such that −log(1−F(x))=x^1/θL(x) for a positive real number θ, called the Weibull tail index, and a slowly varying function L. It is well known that the estimators of θ have a very slow rate of convergence. We establish here a sharp optimality result in the minimax sense, that is when L is treated as an infinite dimensional nuisance parameter belonging to some functional class. We also establish the rate optimal asymptotic property of a data-driven choice of the sample fraction that is used for estimation.     

Parametric Borwein-Preiss variational principle and applications

A parametric version of the Borwein-Preiss smooth variational principle is presented, which states that under suitable assumptions on a given convex function depending on a parameter, the minimum point of a smooth convex perturbation of it depends continuously on the parameter. Some applications are given: existence of a Nash equilibrium and a solution of a variational inequality for a system of partially convex functions, perturbed by arbitrarily small smooth convex perturbations when one of the functions has a non-compact domain; a parametric version of the Kuhn-Tucker theorem which contains a parametric smooth variational principle with constraints; existence of a continuous selection of a subdifferential mapping depending on a parameter.

The tool for proving this parametric smooth variational principle is a useful lemma about continuous -minimizers of quasi-convex functions depending on a parameter, which has independent interest since it allows direct proofs of Ky Fan's minimax inequality, minimax equalities for quasi-convex functions, Sion's minimax theorem, etc.

     

Minimax estimation of the Wigner function in quantum homodyne tomography with ideal detectors

We estimate the quantum state of a light beam from results of quantum homodyne measurements performed on identically prepared pulses. The state is represented through the Wigner function, a “quasi-probability density” on ℝ² which may take negative values and must satisfy intrinsic positivity constraints imposed by quantum physics. The data consists of n i.i.d. observations from a probability density equal to the Radon transform of the Wigner function. We construct an estimator for the Wigner function and prove that it is minimax efficient for the pointwise risk over a class of infinitely differentiable functions. A similar result was previously derived by Cavalier in the context of positron emission tomography. Our work extends this result to the space of smooth Wigner functions, which is the relevant parameter space for quantum homodyne tomography.      

Minimax estimators that shift towards a hypersphere for location vectors of spherically symmetric distributions

Let X be a p-dimensional random vector with density f(6X?θ6) where θ is an unknown location vector. For p ≥ 3, conditions on f are given for which there exist minimax estimators θ?(X) satisfying 6Xt6 · 6θ?(X) ? X6 ≤ C, where C is a known constant depending on f. (The positive part estimator is among them.) The loss function is a nondecreasing concave function of 6θ?? θ6². If θ is assumed likely to lie in a ball in $\text{R}$^p, then minimax estimators are given which shrink from the observation X outside the ball in the direction of P(X) the closest point on the surface of the ball. The amount of shrinkage depends on the distance of X from the ball.     

Minimax adjustment technique in a parameter restricted linear model

We consider an approach yielding a minimax estimator in the linear regression model with a priori information on the parameter vector, e.g., ellipsoidal restrictions. This estimator is computed directly from the loss function and can be motivated by the general Pitman nearness criterion. It turns out that this approach coincides with the projection estimator which is obtained by projecting an initial arbitrary estimate on the subset defined by the restrictions.     

Robust regression function estimation

A robust estimator of the regression function is proposed combining kernel methods as introduced for density estimation and robust location estimation techniques. Weak and strong consistency and asymptotic normality are shown under mild conditions on the kernel sequence. The asymptotic variance is a product from a factor depending only on the kernel and a factor similar to the asymptotic variance in robust estimation of location. The estimation is minimax robust in the sense of Huber (1964). Robust estimation of a location parameter. Ann. Math. Statist.33 73–101.     

R（0，θ）分布族参数的矩估计与最大似然估计

本文讨论了均匀分布族｛Ｒ（０，θ），θ＞０｝中参数θ的矩估计及最大似然估计的效率及相合性，结果表明θ修正后的最大似然估计要优于θ的矩估计。