论文检索

贪婪算法的逼近与学习AI 解读

We consider the problem of approximating a given element f from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the existing theory of convergence rates for both the orthogonal greedy algorithm and the relaxed greedy algorithm, as well as for the forward stepwise projection algorithm. For all these algorithms, we prove convergence results for a variety…

利用指数族序列逼近概率密度函数AI 解读

Probability density functions are estimated by the method of maximum likelihood in sequences of regular exponential families. This method is also familiar as entropy maximization subject to empirical constraints. The approximating families of log-densities that we consider are polynomials, splines and trigonometric series. Bounds on the relative entropy (Kullback-Leibler distance) between the true density and the estimator are obtained and rates of convergence are…

具有一致功效的拟合优度检验AI 解读

The simple hypothesis is tested that the distribution of independent random variables $X_1, X_2, \cdots, X_n$ is a given probability measure $P_0$. Let $\pi_n$ be any sequence of partitions. The alternative hypothesis is the set of probability measures $P$ with $\sum_{A\in \pi_n}|P(A) - P_0(A)| \geq \delta$, where $\delta > 0$. Note the dependence of this set of alternatives on the sample size. It is shown that if the effective cardinality of the partitions is of the same…