Related papers: Pointwise Convergence in Probability of General Sm…
Here we introduce a generalization of the exponential sampling series of optical physics and establish pointwise and uniform convergence theorem, also in a quantitative form. Moreover we compare the error of approximation for Mellin…
Spectral clustering is one of the most popular clustering methods for finding clusters in a graph, which has found many applications in data mining. However, the input graph in those applications may have many missing edges due to error in…
Modern machine learning is dominated by complex, overparameterized architectures capable of interpolating data and achieving zero training loss. For such models, we investigate the convergence properties of two popular modifications to…
We consider solving nonconvex composite optimization problems in which the sum of a smooth function and a nonsmooth function is minimized. Many of convergence analyses of proximal gradient-type methods rely on global descent property…
Weak lensing peak counts are a powerful statistical tool for constraining cosmological parameters. So far, this method has been applied only to surveys with relatively small areas, up to several hundred square degrees. As future surveys…
The article addresses the convergence of implicit and semi-implicit, fully discrete approximations of a class of nonlinear parabolic evolution problems. Such schemes are popular in the numerical solution of evolutions defined with the…
This note proves a weak type of the sharpness principle as conjectured by Gneiting, Balabdaoui, and Raftery in 2007 in connection with probabilistic forecasting subject to calibration constraints. A strong version of such a principle still…
We consider the gradient method with variable step size for minimizing functions that are definable in o-minimal structures on the real field and differentiable with locally Lipschitz gradients. We prove that global convergence holds if…
We consider non-convex stochastic optimization using first-order algorithms for which the gradient estimates may have heavy tails. We show that a combination of gradient clipping, momentum, and normalized gradient descent yields convergence…
Consider the problem when $X_1,X_2,..., X_n$ are distributed on a circle following an unknown distribution $F$ on $S^1$. In this article we have consider the absolute general set-up where the density can have local features such as…
We argue that complex systems must possess long range correlations and illustrate this idea on the example of the mean field spin glass model. Defined on the complete graph, this model has no genuine concept of distance, but the long range…
Let a continuous random process $X$ defined on $[0,1]$ be $(m+\beta)$-smooth, $0\le m, 0<\beta\le 1$, in quadratic mean for all $t>0$ and have an isolated singularity point at $t=0$. In addition, let $X$ be locally like a $m$-fold…
In this paper we address the question of the pointwise almost everywhere limit of nonlinear Schr\"odinger flows to the initial data, in both the continuous and the periodic settings. Then we show how, in some cases, certain smoothing…
We prove convergence of a single time-scale stochastic subgradient method with subgradient averaging for constrained problems with a nonsmooth and nonconvex objective function having the property of generalized differentiability. As a tool…
In this paper, we consider the estimation of a change-point for possibly high-dimensional data in a Gaussian model, using a k-means method. We prove that, up to a logarithmic term, this change-point estimator has a minimax rate of…
We prove that Abelian sandpiles with random initial states converge almost surely to unique scaling limits. The proof follows the Armstrong-Smart program for stochastic homogenization of uniformly elliptic equations. Using simple random…
In this paper, we find some error estimates for periodic homogenization of p-Laplace type equations under the same structure assumption on homogenized equations. The main idea is that by adjusting the size of the difference quotient of the…
A basis expansion with regularization methods is much appealing to the flexible or robust nonlinear regression models for data with complex structures. When the underlying function has inhomogeneous smoothness, it is well known that…
We consider the Stefan problem, firstly with regular data and secondly with irregular data. In both cases is given a proof for the convergence of an approximation obtained by regularising the problem. These proofs are based on weak…
Fine stratification survey is useful in many applications as its point estimator is unbiased, but the variance estimator under the design cannot be easily obtained, particularly when the sample size per stratum is as small as one unit. One…