English
Related papers

Related papers: Determining optimal test functions for $2$-level d…

200 papers

We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…

Data Structures and Algorithms · Computer Science 2015-08-25 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

This work is concerned with the detection of a mixture distribution from a $\mathbb{R}$-valued sample. Given a sample $X_1,\dots,X_n$ and an even density $\phi$, our aim is to detect whether the sample distribution is $\phi(\cdot-\mu)$ for…

Statistics Theory · Mathematics 2016-01-22 Béatrice Laurent , Clément Marteau , Cathy Maugis-Rabusseau

We study the decay of convolution powers of probability measures without second moment but satisfying some weaker finite moment condition. For any locally compact unimodular group G and any positive function $\rho:G \rightarrow…

Probability · Mathematics 2012-10-30 Alexander Bendikov , Laurent Saloff-Coste

We study the numerical approximation of integrals over $\mathbb{R}^s$ with respect to the standard Gaussian measure for integrands which lie in certain Hermite spaces of functions. The decay rate of the associated sequence is specified by a…

Numerical Analysis · Mathematics 2017-11-16 Josef Dick , Christian Irrgeher , Gunther Leobacher , Friedrich Pillichshammer

We propose a new powerful family of tests of univariate normality. These tests are based on an initial value problem in the space of characteristic functions originating from the fixed point property of the normal distribution in the zero…

Statistics Theory · Mathematics 2020-02-28 Bruno Ebner

Consider the following problem: given two arbitrary densities $q_1,q_2$ and a sample-access to an unknown target density $p$, find which of the $q_i$'s is closer to $p$ in total variation. A remarkable result due to Yatracos shows that this…

Machine Learning · Computer Science 2025-12-16 Olivier Bousquet , Daniel Kane , Shay Moran

We introduce a new family of estimators for unnormalized statistical models. Our family of estimators is parameterized by two nonlinear functions and uses a single sample from an auxiliary distribution, generalizing Maximum Likelihood Monte…

Machine Learning · Computer Science 2012-03-19 Miika Pihlaja , Michael Gutmann , Aapo Hyvarinen

For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , V. I. Vasyunin

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

Classical Analysis and ODEs · Mathematics 2014-03-25 A. S. Serdyuk , T. A. Stepaniuk

Let $\left(\Omega,\Sigma,p\right)$ be a probability measure space and let $X:\Omega\to{\mathbb{R}}^k$ be a (vector valued) random variable. We suppose that the probability $p_X$ induced by $X$ is absolutely continuous with respect to the…

Probability · Mathematics 2021-12-06 Luigi Negro

We consider parametric hypotheses testing for multidimensional ergodic diffusion processes observed at discrete time. We propose a family of test statistics, related to the so called $\phi$-divergence measures. By taking into account the…

Statistics Theory · Mathematics 2011-11-14 Alessandro De Gregorio , Stefano Iacus

Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…

Data Structures and Algorithms · Computer Science 2009-06-16 Karthekeyan Chandrasekaran , Amit Deshpande , Santosh Vempala

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

Discrete Mathematics · Computer Science 2016-11-29 Corinna Gottschalk , Britta Peis

We propose and analyze nonparametric tests of the null hypothesis that a function belongs to a specified parametric family. The tests are based on BIC approximations, \pi_{BIC}, to the posterior probability of the null model, and may be…

Statistics Theory · Mathematics 2007-06-13 Marc Aerts , Gerda Claeskens , Jeffrey D. Hart

Let $\mathfrak{F}_n$ be the set of unitary cuspidal automorphic representations of $\mathrm{GL}_n$ over a number field $F$, and let $S\subseteq\mathfrak{F}_n$ be an arbitrary finite subset. Given $\pi_0\in\mathfrak{F}_{n_0}$, we establish…

Number Theory · Mathematics 2025-09-16 Alexandru Pascadi , Jesse Thorner

We study Density Functional Theory models for systems which are translationally invariant in some directions, such as a homogeneous 2-d slab in the 3-d space. We show how the different terms of the energy are modified and we derive reduced…

Mathematical Physics · Physics 2021-12-24 David Gontier , Salma Lahbabi , Abdallah Maichine

Let $\xi = \{x^j\}_{j=1}^n$ be a grid of $n$ points in the $d$-cube ${\II}^d:=[0,1]^d$, and $\Phi = \{\phi_j\}_{j =1}^n$ a family of $n$ functions on ${\II}^d$. We define the linear sampling algorithm $L_n(\Phi,\xi,\cdot)$ for an…

Functional Analysis · Mathematics 2010-09-23 Dinh Dũng

We establish asymptotic estimates for the least upper bounds of approximations in the uniform metric by Fourier sums of order $n-1$ of classes of $2\pi$-periodic Weyl--Nagy differentiable functions, $W^r_{\beta,p}, 1\le p\le \infty,…

Classical Analysis and ODEs · Mathematics 2022-02-08 A. S. Serdyuk , I. V. Sokolenko

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…

Data Structures and Algorithms · Computer Science 2011-12-30 Eric Blais , Amit Weinstein , Yuichi Yoshida

We study the complexity of approximating integrals of smooth functions at absolute precision $\varepsilon > 0$ with confidence level $1 - \delta \in (0,1)$. The optimal error rate for multivariate functions from classical isotropic Sobolev…

Numerical Analysis · Mathematics 2018-09-27 Robert J. Kunsch , Daniel Rudolf