Minimax kernels for density estimation with biased data

This paper considers the asymptotic properties of two kernel estimates % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\], which have been proposed by Bhattacharyya et al. (1988, Comm. Statist. Theory Methods, A17, 3629–3644) and Jones (1991, Biometrika, 78, 511–519), respectively, for estimating the underlying density f at a point under a general selection biased model. The asymptotic optimality of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]is measured by the corresponding asymptotic minimax mean squared errors under a compactly supported Lipschitz continuous family of the underlying densities. It is shown that, in general, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]is a superior local estimate than % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]in the sense that the asymptotic minimax risk of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]is lower than that of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaacamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E82!\[\tilde f_{_n }\]. The minimax kernels and bandwidths of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaGqaciqa-zgagaqcamaaBaaaleaadaWgaaadbaGaa8NBaaqabaaa% leqaaaaa!3E83!\[\hat f_{_n }\]are computed explicity and shown to have simple forms and depend on the weight functions of the model.     

A hybrid descent method for solving a convex constrained optimization problem with applications

The purpose of this paper is to introduce a hybrid descent algorithm for finding a common point in fixed‐point sets of quasi‐nonexpansive mappings and solution sets of variational inequality problems. In the framework of Hilbert spaces, the strong convergence of the hybrid descent algorithm is established. Numerical experiments for the bandwidth allocation, which demonstrate the effectiveness, performance, and convergence of the proposed algorithm, are provided.     

测线调查样本密度推定中核函数选择的几点注记

对于半正态探知函数,使用两个最佳带幅宽和六个属于相同的函数族、不同的核函数(其中3个是经常被使用、著名的核函数,另外3个是我们作成的核函数)来进行密度推定,通过计算机数值模拟产生测线调查样本;用统计量RRMSE和RB对密度推定值进行评价,来验证核函数的优劣。     

Robust guaranteed cost control for discrete‐time systems via partially delay‐dependent controller with linear fractional uncertainties

In this article, a partially delay‐dependent controller is designed to analyze the guaranteed performance analysis of a class of uncertain discrete‐time systems with time‐varying delays. By constructing suitable Lyapunov–Krasovskii Functional (LKF), sufficient conditions are derived to ensure the system to be robustly stochastically stable in mean square sense by using Wirtinger‐based inequality and convex reciprocal lemma. The proper cost function is chosen to guarantee an adequate level of performance. The derived conditions are expressed in terms of linear matrix inequalities (LMIs) which can be easily solved by LMI Toolbox in MATLAB. Further, the advantage of employing the obtained results is illustrated via numerical examples. © 2016 Wiley Periodicals, Inc. Complexity 21: 113–122, 2016     

LMI‐based criterion for the robust guaranteed cost control of uncertain switched neutral systems with time‐varying mixed delays and nonlinear perturbations by dynamic output feedback

This article reports on an investigation into robust guaranteed cost control (GCC) for uncertain switched neutral systems (USNSs) with interval time‐varying mixed delays and nonlinear perturbations via dynamic output feedback. Delay‐dependent sufficient conditions are suggested to guarantee the robust exponential stability and to obtain robust GCC for USNSs using the average dwell time approach and the piecewise Lyapunov function technique in terms of a set of linear matrix inequalities. The problem of uncertainty in the system model is solved by deploying the Yakubovich lemma. Lastly, two examples (i.e., a numerical example and the water‐quality dynamic model for the Nile River) are given to verify the efficiency of the propounded theories. © 2016 Wiley Periodicals, Inc. Complexity 21: 555–578, 2016     

Spanning embeddings of arrangeable graphs with sublinear bandwidth

The Bandwidth Theorem of Böttcher, et al. [Mathematische Annalen 343 (2009), 175–205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a‐arrangeable graphs H with , where n is the number of vertices of H. Our result implies that sufficiently large n‐vertex graphs G with minimum degree at least contain almost all planar graphs on n vertices as subgraphs. Using techniques developed by Allen, et al. [Combinatorica 33 (2013), 125–160] we can also apply our methods to show that almost all planar graphs H have Ramsey number at most . We obtain corresponding results for graphs embeddable on different orientable surfaces. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 270–289, 2016     

Decentralized Guaranteed Cost Control for Uncertain Large-Scale Systems Using Delayed Feedback: LMI Optimization Approach

In this paper, we propose a design method of guaranteed cost controllers for uncertain large-scale systems with time delays in subsystem interconnections using delayed feedback. Using the Lyapunov method, a linear matrix inequality (LMI) optimization problem is formulated to design a delayed feedback controller which minimizes the upper bound of a given quadratic cost function. A numerical example is included to illustrate the design procedures.Communicated by Q. C. ZhaoThe authors thank the Associate Editor and three anonymous referees for careful reading and useful suggestions.     

基于局部多项式展开的多元非参数模型贝叶斯带宽选择

在多元非参数模型中带宽和阶的选择对局部多项式估计量的表现十分重要。本文基于交叉验证准则提出一个自适应贝叶斯带宽选择方法。在给定的误差密度函数下,该方法可推导出对应的似然函数,并构造带宽参数的后验密度函数。随后,通过带宽的后验期望可同时获得阶和带宽的估计。数值模拟的结果表明,该方法不仅比大拇指准则方法精确,且比交叉验证方法耗时更少。与此同时,与Nadaraya-Watson估计相比,所提带宽选择方法对多元非参数模型的适应性要更好。最后,本文通过一组实际数据说明有限样本下所提贝叶斯带宽选择的表现很好。     

The Asymptotic Variance of the Continuous-Time Kernel Estimator with Applications to Bandwidth Selection

We derive simple expressions for the asymptotic variance of the kernel-density estimator of a stationary continuous-time process in one and d dimensions and relate convergence rates to sample path smoothness. Important applications include methods for selecting optimal smoothing parameters and construction of confidence bands for testing hypotheses about the density. In a simulation study the results are applied to bandwidth selection for discrete-time processes that can be modelled as continuous-time processes sampled at a high rate.     

部分线性回归模型变窗宽一步局部M-估计

讨论了部分线性回归模型的变窗宽一步局部M-估计.用一步局部M-估计给出未知函数的估计,用平均方法给出参数估计.进一步通过两个引理证明一步M-估计的渐近正态性.所提出的方法继承了局部多项式的优点并且克服了最小二乘法缺乏稳健性的缺点.