Related papers: Dimer lambda_3 = .453 +/- .001 and Some Other Very…
The theory of summability of divergent series is a major branch of mathematical analysis that has found important applications in engineering and science. It addresses methods of assigning natural values to divergent sums, whose…
We analyze the practices of reservoir computing in the framework of statistical learning theory. In particular, we derive finite sample upper bounds for the generalization error committed by specific families of reservoir computing systems…
We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…
Intuitively, unfamiliarity should lead to lack of confidence. In reality, current algorithms often make highly confident yet wrong predictions when faced with relevant but unfamiliar examples. A classifier we trained to recognize gender is…
We consider the vacant set of random interlacements on Z^d, with d bigger or equal to 3, in the percolative regime. Motivated by the large deviation principles obtained in our recent work arXiv:1304.7477, we investigate the asymptotic…
We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaussian design, we show that under mild conditions the prediction error of the Lasso is up to smaller order terms dominated by the prediction…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…
We study the properties of several likelihood-based statistics commonly used in testing for the presence of a known signal under a mixture model with known background, but unknown signal fraction. Under the null hypothesis of no signal, all…
This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda(x,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi(x,y)$, is asymptotic to…
For the zone of moderate deviation probabilities the local asymptotic minimax lower bound of asymptotic efficiency of estimators is established. The estimation parameter is multidimensional. The lower bound admits the interpretation as the…
We propose a deep supervised learning algorithm based on low-discrepancy sequences as the training set. By a combination of theoretical arguments and extensive numerical experiments we demonstrate that the proposed algorithm significantly…
Let $\Delta(x)$ be the error term of the Dirichlet divisor problem. An asymptotic formula with the error term $O(T^{53/28+\epsilon})$ is established for the integral $\int_1^T\Delta^4(x)dx.$ Similar results are also established for some…
This study proposes a robust estimator for stochastic frontier models by integrating the idea of Basu et al. [1998, Biometrika 85, 549-559] into such models. We verify that the suggested estimator is strongly consistent and asymptotic…
The paper provides new upper and lower bounds for the multivariate Laplace approximation under weak local assumptions. Their range of validity is also given. An application to an integral arising in the extension of the Dixon's identity is…
This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…
Standard variational lower bounds used to train latent variable models produce biased estimates of most quantities of interest. We introduce an unbiased estimator of the log marginal likelihood and its gradients for latent variable models…
This paper considers the problem of soft guessing under a logarithmic loss distortion measure while allowing errors. We find an optimal guessing strategy, and derive single-shot upper and lower bounds for the minimal guessing moments as…
Walley's Imprecise Dirichlet Model (IDM) for categorical i.i.d. data extends the classical Dirichlet model to a set of priors. It overcomes several fundamental problems which other approaches to uncertainty suffer from. Yet, to be useful in…
Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…