相关论文: Density functions for QuickQuant and QuickVal

Data consisting of samples of probability density functions are increasingly prevalent, necessitating the development of methodologies for their analysis that respect the inherent nonlinearities associated with densities. In many…

Let $X=(X_t, t\geq 0)$ be a superprocess in a random environment described by a Gaussian noise $W^g=\{W^g(t,x), t\geq 0, x\in \mathbb{R}^d\}$ white in time and colored in space with correlation kernel $g(x,y)$. We show that when $d=1$,…

Within the framework of hierarchical clustering we show that a simple Press-Schechter-like approximation, based on spherical dynamics, provides a good estimate of the evolution of the density field in the quasi-linear regime up to $\Sigma…

We study the convergence and shape correction to the limit distributions of extreme values due to the finite size (FS) of data sets. A renormalization method is introduced for the case of independent, identically distributed (iid)…

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Given a Lipschitz or smooth convex function $\, f:K \to \mathbb{R}$ for a bounded polytope $K \subseteq \mathbb{R}^d$ defined by $m$ inequalities, we consider the problem of sampling from the log-concave distribution $\pi(\theta) \propto…

One means of fitting functions to high-dimensional data is by providing smoothness constraints. Recently, the following smooth function approximation problem was proposed: given a finite set $E \subset \mathbb{R}^d$ and a function $f: E…

We estimate the $1$-level density of low-lying zeros of $L(s,\chi)$ with $\chi$ ranging over primitive Dirichlet characters of conductor $\in [Q/2,Q]$ and for test functions whose Fourier transform is supported in $[- 2 - 50/1093, 2 +…

We design an algorithm for finding counterfactuals with strong theoretical guarantees on its performance. For any monotone model $f : X^d \to \{0,1\}$ and instance $x^\star$, our algorithm makes \[ {S(f)^{O(\Delta_f(x^\star))}\cdot \log…

Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing…

We consider large deviations for nearest-neighbor random walk in a uniformly elliptic i.i.d. environment. It is easy to see that the quenched and the averaged rate functions are not identically equal. When the dimension is at least four and…

The convergence theory for the gradient sampling algorithm is extended to directionally Lipschitz functions. Although directionally Lipschitz functions are not necessarily locally Lipschitz, they are almost everywhere differentiable and…

Tests of fit to exact models in statistical analysis often lead to rejections even when the model is a useful approximate description of the random generator of the data. Among possible relaxations of a fixed model, the one defined by…

If a probability density p(\x) (\x\in\R^k) is bounded and R(t) := \int \exp(t\ell(\x)) \d\x < \infty for some linear functional \ell and all t\in(0,1), then, for each t\in(0,1) and all large enough n, the n-fold convolution of the t-tilted…

We obtain Lipschitz estimates for bounded minimizers of functionals with nonstandard $(p,q)$-growth satisfying the dimension-independent restriction $q<p+2$ with $p \geq 2$. This relation improves existing restrictions when $p \leq N-1$,…

We show a general phenomenon of the constrained functional value for densities satisfying general convexity conditions, which generalizes the observation in Bobkov and Madiman (2011) that the entropy per coordinate in a log-concave random…

We improve the universality theorem of the Riemann zeta-function in short intervals by establishing universality for significantly shorter intervals $[T,T+H]$. Assuming the Riemann Hypothesis, we prove that universality in such short…

We show that a randomly chosen linear map over a finite field gives a good hash function in the $\ell_\infty$ sense. More concretely, consider a set $S \subset \mathbb{F}_q^n$ and a randomly chosen linear map $L : \mathbb{F}_q^n \to…

In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes over $\mathbb F_q$ $\varepsilon$-close to capacity to…

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…