Related papers: Weighted Approximation By Max-Product Generalized …
This work proposes and analyzes a compressed sensing approach to polynomial approximation of complex-valued functions in high dimensions. Of particular interest is the setting where the target function is smooth, characterized by a rapidly…
In this paper, we study, in a nonlinear setting, the asymptotic behaviour of a generalized viscosity approximation method associated with a countable family of nonexpansive mappings satisfying resolvent-like conditions. We apply proof…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
Variable Muckenhoupt weights are considered in variable exponent Lebesgue spaces. Applications are given for polynomial approximation in these spaces. Boundedness of averaging operator is proved to gain a transference result. Almost all…
The paper studies the asymptotic behaviour of weighted functionals of long-range dependent data over increasing observation windows. Various important statistics, including sample means, high order moments, occupation measures can be given…
Let $(X_k)_{k\geq1}$ be a Gaussian long-range dependent process with $EX_1=0$, $EX_1^2=1$ and covariance function $r(k)=k^{-D}L(k)$. For any measurable function $G$ let $(Y_k)_{k\geq1}=(G(X_k))_{k\geq1}$. We study the asymptotic behaviour…
We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is that it provides quantitative convergence guarantees at a much…
This thesis studies high-dimensional, continuous-valued pairwise Markov Random Fields. We are particularly interested in approximating pairwise densities whose logarithm belongs to a Sobolev space. For this problem we propose the method of…
We investigate the properties of a sequential Monte Carlo method where the particle weight that appears in the algorithm is estimated by a positive, unbiased estimator. We present broadly-applicable convergence results, including a central…
We demonstrate the convergence of the characteristic polynomial of several random matrix ensembles to a limiting universal function, at the microscopic scale. The random matrix ensembles we treat are classical compact groups and the…
A new sampling methodology based on incomplete cosine expansion series is presented as an alternative to the traditional sinc function approach. Numerical integration shows that this methodology is efficient and practical. Applying the…
In this paper we discuss a closed-form approximation of the likelihood functions of an arbitrary diffusion process. The approximation is based on an exponential ansatz of the transition probability for a finite time step $\Delta t$, and a…
By employing an accelerated weighting method, we establish arbitrary polynomial and exponential pointwise convergence for multiple ergodic averages under general balancing conditions in both discrete and continuous settings, including…
We study the convergence behavior of the Expectation Maximization (EM) algorithm on Gaussian mixture models with an arbitrary number of mixture components and mixing weights. We show that as long as the means of the components are separated…
To deal with very large datasets a mini-batch version of the Monte Carlo Markov Chain Stochastic Approximation Expectation-Maximization algorithm for general latent variable models is proposed. For exponential models the algorithm is shown…
Classical results on the statistical complexity of linear models have commonly identified the norm of the weights $\|w\|$ as a fundamental capacity measure. Generalizations of this measure to the setting of deep networks have been varied,…
We study the problem of estimating the covariance parameters of a one-dimensional Gaussian process with exponential covariance function under fixed-domain asymptotics. We show that the weighted pairwise maximum likelihood estimator of the…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…