论文检索

ψ学习研究AI 解读

The concept of large margins have been recognized as an important principle in analyzing learning methodologies, including boosting, neural networks, and support vector machines (SVMs). However, this concept alone is not adequate for learning in nonseparable cases. We propose a learning methodology, called ψ-learning, that is derived from a direct consideration of generalization errors. We provide a theory for ψ-learning and show that it essentially attains the optimal rates…

摘要暂缺

空间信号的非参数假设检验AI 解读

Nonparametric hypothesis testing for a spatial signal can involve a large number of hypotheses. For instance, two satellite images of the same scene, taken before and after an event, could be used to test a hypothesis that the event has no environmental impact. This is equivalent to testing that the mean difference of “after-before” is zero at each of the (typically thousands of) pixels that make up the scene. In such a situation, conventional testing procedures that control…

半参数与非参数后验分布的渐近正态性AI 解读

In this article it is shown that the marginal semiparametric and nonparametric posterior distributions for a parameter of interest behave like an ordinary parametric posterior distribution. This in practice provides support of the utility of marginal semiparametric and nonparametric posterior distributions. In particular, the marginal semiparametric and nonparametric posterior distributions are asymptotically normal and centered at the corresponding maximum likelihood…

自适应模型选择AI 解读

Most model selection procedures use a fixed penalty penalizing an increase in the size of a model. These nonadaptive selection procedures perform well only in one type of situation. For instance, Bayesian information criterion (BIC) with a large penalty performs well for “small” models and poorly for “large” models, and Akaike's information criterion (AIC) does just the opposite. This article proposes an adaptive model selection procedure that uses a data-adaptive complexity…

后验分布的收敛速率AI 解读

We compute the rate at which the posterior distribution concentrates around the true parameter value. The spaces we work in are quite general and include in finite dimensional cases. The rates are driven by two quantities: the size of the space, as measured by bracketing entropy, and the degree to which the prior concentrates in a small ball around the true parameter. We consider two examples.

空间自适应回归样条与精确结点选择方案AI 解读

Spline procedures have proven effective in estimating smooth functions. However, spline procedures based on stepwise addition and/or deletion have some drawbacks. They suffer from the knot compounding problem, making their performance suboptimal. Furthermore, due to computational complexity, spline procedures may not achieve their full potential. In this article, we propose a novel knot selection algorithm for regression spline estimation in nonparametric regression. The…

当前状态数据下的线性回归AI 解读

In survival analysis, a linear model often provides an adequate approximation after a suitable transformation of the survival times and possibly of the covariates. This article proposes a semiparametric regression method for estimating the regression parameter in the linear model without specifying the distribution of the random error, where the response variable is subject to so-called case 1 interval censoring. The method uses a constructed random-sieve likelihood and…

随机筛似然与一般回归模型AI 解读

Consider a semiparametric regression model Y = f(θ, X, ϵ), where f is a known function, θ is an unknown vector, ϵ consists of a random error and possibly of some unobserved variables, and the distribution F(·) of (ϵ, X) is unspecified. This article introduces, in a general setting, new methodology for estimating θ and F(·). The proposed method constructs a profile likelihood defined on random-level sets (a random sieve). The proposed method is related to empirical likelihood…

弱依赖数据下的筛极值估计AI 解读

Many non/semiparametric time series estimates may be regarded as different forms of sieve extremum estimates. For stationary absolute regular mixing observations, the authors obtain convergence rates of sieve extremurn estimates and root-n asymptotic normality of 'plug-in' sieve extremum estimates of smooth functionals. As applications to time series models, they give convergence rates for nonparametric ARX(p,q) regression via neural networks, splines, wavelets; root-n…

论筛法与惩罚法AI 解读

We develop a general theory which provides a unified treatment for the asymptotic normality and efficiency of the maximum likelihood estimates (MLE's) in parametric, semiparametric and nonparametric models. We find that the asymptotic behavior of substitution estimates for estimating smooth functionals are essentially governed by two indices: the degree of smoothness of the functional and the local size of the underlying parameter space. We show that when the local size of…

似然比的概率不等式与筛最大似然估计的收敛率AI 解读

Let $Y_1,\ldots, Y_n$ be independent identically distributed with density $p_0$ and let $\mathscr{F}$ be a space of densities. We show that the supremum of the likelihood ratios $\prod^n_{i=1} p(Y_i)/p_0(Y_i)$, where the supremum is over $p \in \mathscr{F}$ with $\|p^{1/2} - p^{1/2}_0\|_2 \geq \varepsilon$, is exponentially small with probability exponentially close to 1. The exponent is proportional to $n\varepsilon^2$. The only condition required for this to hold is that $\varepsilon$…

筛估计的收敛速度AI 解读

In this paper, we develop a general theory for the convergence rate of sieve estimates, maximum likelihood estimates (MLE's) and related estimates obtained by optimizing certain empirical criteria in general parameter spaces. In many cases, especially when the parameter space is infinite dimensional, maximization over the whole parameter space is undesirable. In such cases, one has to perform maximization over an approximating space (sieve) of the original parameter space…