Related papers: A Smoothed GPY Sieve

Let $k\geq 2$ and $\mathcal{P} (n) = (A_1 n + B_1 ) \cdots (A_k n + B_k)$ where all the $A_i, B_i$ are integers. Suppose that $\mathcal{P} (n)$ has no fixed prime divisors. For each choice of $k$ it is known that there exists an integer…

In a recent joint work with D.A. Goldston and C.Y. Yildirim we just missed by a hairbreadth a proof that bounded gaps between primes occur infinitely often. In the present work it is shown that adding to the primes a much thinner set,…

As computational machines become larger and more complex, the probability of hardware failure rises. ``Silent errors'', or bit flips, may not be immediately apparent but can cause detrimental effects to algorithm behavior. In this work, we…

We propose a general yet simple theorem describing the convergence of SGD under the arbitrary sampling paradigm. Our theorem describes the convergence of an infinite array of variants of SGD, each of which is associated with a specific…

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…

It is a classic result of Selberg in the 1950's that $\theta_2 = 2/3$, where $\theta_2$ is the level of distribution of the divisor function in arithmetic progressions (defined more precisely below). Selberg applies this estimate, together…

This paper presents a comprehensive analysis of a broad range of variations of the stochastic proximal point method (SPPM). Proximal point methods have attracted considerable interest owing to their numerical stability and robustness…

With the prevalence of pre-training-fine-tuning paradigm, how to efficiently adapt the pre-trained model to the downstream tasks has been an intriguing issue. Parameter-Efficient Fine-Tuning (PEFT) methods have been proposed for low-cost…

We correct an error and an oversight in [IP]. The sign of the curvature in (8.7) is wrong, requiring a new proof of Proposition 8.1. Also, several lemmas addressed only the basic case of maps with intersection multiplicity s=1; the general…

The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by…

A gap in the proof of Theorem 3.5 in the paper ``A new iteration process for approximation of common fixed points for finite families of total asymtotically nonexpansive mappings". Int. J. Math. Math. Sci. vol. 2009,…

We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…

In this tutorial we explain the inference procedures developed for the sparse Gaussian process (GP) regression and Gaussian process latent variable model (GPLVM). Due to page limit the derivation given in Titsias (2009) and Titsias &…

In many applications that involve the inference of an unknown smooth function, the inference of its derivatives will often be just as important as that of the function itself. To make joint inferences of the function and its derivatives, a…

Scalable Gaussian process (GP) inference is essential for sequential decision-making tasks, yet improving GP scalability remains a challenging problem with many open avenues of research. This paper focuses on iterative GPs, where iterative…

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

This work develops user-friendly a posteriori error estimates of finite element methods, based on smoothers of linear iterative solvers. The proposed method employs simple smoothers, such as Jacobi or Gauss-Seidel iteration, on an auxiliary…

We aim at giving a rigorous proof of the state-ments on the smoothness and the dimension of Severi varieties wherethere are gaps in the proofs in some standard literature. The method isa mixture of algebraic and analytic methods.