English
Related papers

Related papers: Where are the logs?

200 papers

This paper presents uniform convergence rates for kernel regression estimators, in the setting of a structural nonlinear cointegrating regression model. We generalise the existing literature in three ways. First, the domain to which these…

Statistics Theory · Mathematics 2015-05-08 James A. Duffy

This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations…

Quantum Physics · Physics 2016-11-29 Felix Leditzky

We calculate the damping rate for transverse gluons with {\nineti finite} soft momentum to leading order in perturbative hot QCD. The internal momenta of the one-loop contributing diagrams are soft. This means we have to use effective…

High Energy Physics - Phenomenology · Physics 2007-05-23 A. Abada , O. Azi , A. Tadji

Non-asymptotic central limit theorem (CLT) rates play a central role in modern machine learning and operations research. In this paper, we study CLT rates for multivariate dependent data in Wasserstein-$p$ ($W_p$) distance, for general…

Probability · Mathematics 2026-04-21 Yixuan Zhang , Qiaomin Xie

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

Functional Analysis · Mathematics 2019-12-16 Nacib Gurgel Albuquerque , Lisiane Rezende

We derive a consistency result, in the $L_1$-sense, for incomplete U-statistics in the non-standard case where the kernel at hand has infinite second-order moments. Assuming that the kernel has finite moments of order $p(\geq 1)$, we obtain…

Statistics Theory · Mathematics 2021-12-30 Alexander Dürre , Davy Paindaveine

The problem of mismatched decoding with an additive metric $q$ for a discrete memoryless channel $W$ is addressed. The "product-space" improvement of the random coding lower bound on the mismatch capacity, $C_q^{(\infty)}(W)$, was…

Information Theory · Computer Science 2018-05-29 Anelia Somekh-Baruch

The growing use of high-throughput sequencing (HTS) has enabled the large-scale production of compositional count data, driving progress in microbiome research. However, such count data are often high-dimensional, over-dispersed, and…

Other Statistics · Statistics 2026-05-22 Wenqi Tang , Kamila Fačevicová , Klaus Nordhausen , Sara Taskinen

This short note shows a limiting behavior of integrals of some centered antipersistent stationary infinitely divisible moving averages as the compact integration domain in $d\ge 1$ dimensions extends to the whole positive quadrant…

Probability · Mathematics 2024-07-10 Evgeny Spodarev

A plug-in estimator of entropy is the entropy of the distribution where probabilities of symbols or blocks have been replaced with their relative frequencies in the sample. Consistency and asymptotic unbiasedness of the plug-in estimator…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

We prove that the Sinkhorn algorithm converges at a rate of $O(k^{-1} \log k)$ in $\ell_1$-norm marginal error, in the asymptotically scalable case. This almost closes the gap between the lower bound $\Omega(k^{-1})$ (Qu et al., 2025) and…

Optimization and Control · Mathematics 2026-05-15 Guillaume Wang

In this note we show that if a continuous-time, nonlinear, time-invariant, finite-dimensional system evolves on a compact subset of Rn and if the Jacobian of the vector field is Hurwitz at each point of the compact set, then there is a…

Optimization and Control · Mathematics 2016-09-06 Ravi Mazumdar , Christopher Nielsen , Arpan Mukhopadhyay

We study the entanglement between soft and hard particles produced in generic scattering processes in QED. The reduced density matrix for the hard particles, obtained via tracing over the entire spectrum of soft photons, is shown to have a…

High Energy Physics - Theory · Physics 2021-08-20 Anastasios Irakleous , Theodore N Tomaras , Nicolaos Toumbas

We prove that the ACC conjecture for minimal log discrepancies holds for threefolds in $[1-\delta,+\infty)$, where $\delta>0$ only depends on the coefficient set. We also study Reid's general elephant for pairs, and show Shokurov's…

Algebraic Geometry · Mathematics 2022-02-16 Jingjun Han , Jihao Liu , Yujie Luo

For any $s\in (1/2,1]$, the series$F_s(x)=\sum_{n=1}^{\infty} e^{i\pi n^2 x}/n^s$ converges almost everywhere on $[-1,1]$ by a result of Hardy-Littlewood, but not everywhere. However, there does not yet exist an intrinsic description of the…

Number Theory · Mathematics 2012-11-26 Tanguy Rivoal , Stéphane Seuret

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the…

Methodology · Statistics 2016-05-17 T. Tony Cai , Anru Zhang

We show that the Erd\H{o}s-Kac theorem is valid in almost all intervals $\left[x,x+h\right]$ as soon as $h$ tends to infinity with $x$. We also show that for all $k$ near $\log\log x$, almost all interval $\left[x,x+\exp\left(\left(\log\log…

Number Theory · Mathematics 2022-09-27 Élie Goudout

Nyquist criterion-based impedance ratio criteria (IRCs) have been widely applied for inspecting the risk of small-signal instability among converter-based AC power systems. Aided by a comparative study on voltage source converter, including…

Systems and Control · Electrical Eng. & Systems 2023-06-27 Chongbin Zhao , Qirong Jiang

We provide uniform convergence rates for kernel averages on $[0,1]$ under equally-spaced fixed design points of the form $x_{t,T}=t/T,\ t\in\{1,\dotsc, T\},\ T\in\mathbb{N}$. The rates of weak and strong uniform consistency are derived…

Statistics Theory · Mathematics 2026-03-06 Danilo Hiroshi Matsuoka , Hudson da Silva Torrent

We prove that every bounded function $f:\{-1,1\}^n\to[-1,1]$ of degree at most $d$ can be learned with $L_2$-accuracy $\varepsilon$ and confidence $1-\delta$ from $\log(\tfrac{n}{\delta})\,\varepsilon^{-d-1} C^{d^{3/2}\sqrt{\log d}}$ random…

Machine Learning · Computer Science 2022-03-10 Alexandros Eskenazis , Paata Ivanisvili