English
Related papers

Related papers: $L_p$-Testers for Bounded Derivative Properties on…

200 papers

This paper continues the study of the mixed problem for the Laplacian. We consider a bounded Lipschitz domain $\Omega\subset \reals^n$, $n\geq2$, with boundary that is decomposed as $\partial\Omega=D\cup N$, $D$ and $N$ disjoint. We let…

Analysis of PDEs · Mathematics 2013-05-02 Justin L. Taylor , Katharine A. Ott , Russell M. Brown

We consider the goodness-of-fit testing problem of distinguishing whether the data are drawn from a specified distribution, versus a composite alternative separated from the null in the total variation metric. In the discrete case, we…

Statistics Theory · Mathematics 2017-07-03 Sivaraman Balakrishnan , Larry Wasserman

Property testing algorithms are highly efficient algorithms, that come with probabilistic accuracy guarantees. For a property P, the goal is to distinguish inputs that have P from those that are far from having P with high probability…

Logic in Computer Science · Computer Science 2020-09-17 Isolde Adler , Polly Fahey

For $1< p <2$ we obtain sharp inequalities for the supremum of products of homogeneous polynomials on $L_p(\mu)$, whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in the…

Functional Analysis · Mathematics 2013-04-22 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from $s$ distributions, $p_1, p_2, \ldots, p_s$, we design testers for the…

Data Structures and Algorithms · Computer Science 2019-11-19 Maryam Aliakbarpour , Sandeep Silwal

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal

In this paper we discuss the stability properties of convolutional neural networks. Convolutional neural networks are widely used in machine learning. In classification they are mainly used as feature extractors. Ideally, we expect similar…

Machine Learning · Computer Science 2017-01-20 Radu Balan , Maneesh Singh , Dongmian Zou

In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and…

Data Structures and Algorithms · Computer Science 2017-08-17 Tuğkan Batu , Clément L. Canonne

We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…

Numerical Analysis · Mathematics 2025-12-10 Erich Novak , Friedrich Pillichshammer

One of the most fundamental questions in graph property testing is to characterize the combinatorial structure of properties that are testable with a constant number of queries. We work towards an answer to this question for the…

Data Structures and Algorithms · Computer Science 2018-11-08 Hendrik Fichtenberger , Pan Peng , Christian Sohler

The Lipschitz constant is an important quantity that arises in analysing the convergence of gradient-based optimization methods. It is generally unclear how to estimate the Lipschitz constant of a complex model. Thus, this paper studies an…

Machine Learning · Statistics 2023-02-10 Calypso Herrera , Florian Krach , Josef Teichmann

In the first part of the paper we study absolute error of sampling discretization of the integral $L_p$-norm for function classes of continuous functions. We use basic approaches from chaining technique to provide general upper bounds for…

Numerical Analysis · Mathematics 2024-08-12 E. D. Kosov , V. N. Temlyakov

We obtain sharp ranges of $L^p$-boundedness for domains in a wide class of Reinhardt domains representable as sub-level sets of monomials, by expressing them as quotients of simpler domains. We prove a general transformation law relating…

Complex Variables · Mathematics 2021-11-16 Chase Bender , Debraj Chakrabarti , Luke D. Edholm , Meera Mainkar

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

We introduce a new class of multivariate elliptically symmetric distributions including elliptically symmetric logistic distributions and Kotz type distributions. We investigate the various probabilistic properties including marginal…

Statistics Theory · Mathematics 2020-08-04 Yeshunying Wang , Chuancun Yin

This article explores the extension of the classical approximation property and its variants to the nonlinear framework of Lipschitz operator theory. Building on Grothendieck's tensor product methodology, we characterize the Lipschitz…

Functional Analysis · Mathematics 2025-12-09 Arindam Mandal

Given samples from an unknown multivariate distribution $p$, is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether…

Data Structures and Algorithms · Computer Science 2019-07-12 Constantinos Daskalakis , Nishanth Dikkala , Gautam Kamath

In this paper we study the $L^p$ boundary value problems for $\mathcal{L}(u)=0$ in $\mathbb{R}^{d+1}_+$, where $\mathcal{L}=-\text{div}(A\nabla)$ is a second order elliptic operator with real and symmetric coefficients. Assume that $A$ is…

Analysis of PDEs · Mathematics 2009-08-18 Carlos E. Kenig , Zhongwei Shen

A bound uniform over various loss-classes is given for data generated by stationary and phi-mixing processes, where the mixing time (the time needed to obtain approximate independence) enters the sample complexity only in an additive way.…

Machine Learning · Computer Science 2023-06-02 Andreas Maurer

We obtain a probabilistic proof of the local Lipschitz continuity for the optimal stopping boundary of a class of problems with state space $[0,T]\times\mathbb{R}^d$, $d\ge 1$. To the best of our knowledge this is the only existing proof…

Optimization and Control · Mathematics 2018-12-11 Tiziano De Angelis , Gabriele Stabile