相关论文: A Smoothed GPY Sieve

Fine-tuning all parameters of large language models (LLMs) necessitates substantial computational power and extended time. Latest advancements in parameter-efficient fine-tuning (PEFT) techniques, such as Adapter tuning and LoRA, allow for…

Unfortunately, some proofs in the first version of this paper were incorrect. In this revised version, some minor gaps are fixed, one serious mistake found. The main theorem is now claimed only under a restrictive technical assumption. This…

Gaussian processes (GPs) offer a flexible class of priors for nonparametric Bayesian regression, but popular GP posterior inference methods are typically prohibitively slow or lack desirable finite-data guarantees on quality. We develop an…

For a set of primes $\mathcal{P}$, let $\Psi(x, \mathcal{P})$ be the number of positive integers $n \leq x$ all of whose prime factors lie in $\mathcal{P}$. In this paper we classify the sets of primes $\mathcal{P}$ such that $\Psi(x,…

In this paper, continuing our previous work, we investigate the third gap problem in the Simon conjecture for closed minimal surfaces in the unit sphere. By developing refined third-order Simons-type integral identities and establishing new…

Time-varying mixture densities occur in many scenarios, for example, the distributions of keywords that appear in publications may evolve from year to year, video frame features associated with multiple targets may evolve in a sequence. Any…

Penalized spline regression is a popular method for scatterplot smoothing, but there has long been a debate on how to construct confidence intervals for penalized spline fits. Due to the penalty, the fitted smooth curve is a biased estimate…

The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…

We show that at least 1/3 of positive real numbers are in the set of limit points of normalized prime gaps. More precisely, if $p_n$ denotes the $n$th prime and $\mathbb{L}$ is the set of limit points of the sequence $\{(p_{n+1}-p_n)/\log…

This paper gives an explicit version of Selberg's 1943 mean-value estimate for the prime number theorem in intervals under the Riemann hypothesis. Two applications are given: for primes in short intervals, and Goldbach numbers (sums of two…

We investigate the effects of finite size corrections on the overlap probabilities in the Generalized Random Energy Model (GREM) in two situations where replica symmetry is broken in the thermodynamic limit. Our calculations do not use…

Combining a continuous "slab" density with discrete "spike" mass at zero, spike-and-slab priors provide important tools for inducing sparsity and carrying out variable selection in Bayesian models. However, the presence of discrete mass…

For any rational prime $p$, we define a certain $p$-stabilization of holomorphic Siegel Eisenstein series for the symplectic group $\text{Sp}(2n)_{/\mathbb{Q}}$ of an arbitrary genus $n \ge 1$. In addition, we derive an explicit formula for…

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…

We consider the problem of constructing honest and adaptive confidence sets in Lp-loss (with p>=1 and p < infinity) over sets of Sobolev-type classes, in the setting of non-parametric Gaussian regression. The objective is to adapt the…

We propose a novel a posteriori error estimator for conforming finite element discretizations of two- and three-dimensional Helmholtz problems. The estimator is based on an equilibrated flux that is computed by solving patchwise mixed…

Kernel smoothing is a widely used nonparametric method in modern statistical analysis. The problem of efficiently conducting kernel smoothing for a massive dataset on a distributed system is a problem of great importance. In this work, we…

The proximal gradient algorithm for minimizing the sum of a smooth and a nonsmooth convex function often converges linearly even without strong convexity. One common reason is that a multiple of the step length at each iteration may…

We investigate the convergence properties of a stochastic primal-dual splitting algorithm for solving structured monotone inclusions involving the sum of a cocoercive operator and a composite monotone operator. The proposed method is the…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…