English
Related papers

Related papers: A Unified Framework for Testing Linear-Invariant P…

200 papers

Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and…

Probability · Mathematics 2007-05-23 David Gamarnik

The (low soundness) linearity testing problem for the middle slice of the Boolean cube is as follows. Let $\varepsilon>0$ and $f$ be a function on the middle slice on the Boolean cube, such that when choosing a uniformly random quadruple…

Combinatorics · Mathematics 2024-08-02 Gil Kalai , Noam Lifshitz , Dor Minzer , Tamar Ziegler

We give a distributed algorithm in the {\sf CONGEST} model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (DISC 2016), who recently initiated the study of property…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-15 Reut Levi , Moti Medina , Dana Ron

This paper uses model symmetries in the instrumental variable (IV) regression to derive an invariant test for the causal structural parameter. Contrary to popular belief, we show that there exist model symmetries when equation errors are…

Statistics Theory · Mathematics 2021-09-02 Marcelo J. Moreira , Mahrad Sharifvaghefi , Geert Ridder

Law-invariant functionals are central to risk management and assign identical values to random prospects sharing the same distribution under an atomless reference probability measure. This measure is typically assumed fixed. Here, we adopt…

Risk Management · Quantitative Finance 2026-02-10 Felix-Benedikt Liebrich , Ruodu Wang

We detail and extend the results of [Milman {\it et al.}, Phys. Rev. Lett. {\bf 99}, 130405 (2007)] on Bell-type inequalities based on correlations between measurements of continuous observables performed on trapped molecular systems. We…

Quantum Physics · Physics 2019-04-04 P. Milman , A. Keller , E. Charron , O. Atabek

The parametrization theorem is derived in a flat nD pseudo-complex affine space. The pseudo-complex hyperbolic space accomodates n-number of uncompactified time-like extra dimensions with sugnature (s,r), where s and r are the numbers of…

Differential Geometry · Mathematics 2010-03-02 Minh Q. Truong

In this paper we show how some metric properties of the unit sphere of a normed space can help to approach a solution to Tingley's problem. In our main result we show that if an onto isometry between the spheres of strictly convex spaces is…

Metric Geometry · Mathematics 2024-02-09 Javier Cabello Sánchez

We initiate the study of property testing problems concerning relations between permutations. In such problems, the input is a tuple $(\sigma_1,\dotsc,\sigma_d)$ of permutations on $\{1,\dotsc,n\}$, and one wishes to determine whether this…

Data Structures and Algorithms · Computer Science 2024-07-11 Oren Becker , Alexander Lubotzky , Jonathan Mosheiff

Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function via an oracle that returns function values at all queried domain points. In many realistic…

Data Structures and Algorithms · Computer Science 2016-07-21 Kashyap Dixit , Sofya Raskhodnikova , Abhradeep Thakurta , Nithin Varma

All models may be wrong -- but that is not necessarily a problem for inference. Consider the standard $t$-test for the significance of a variable $X$ for predicting response $Y$ whilst controlling for $p$ other covariates $Z$ in a random…

Statistics Theory · Mathematics 2022-05-20 Rajen D. Shah , Peter Bühlmann

The problem of stationary robust L_infinity-induced deconvolution filtering for the uncertain continuous-time linear stochastic systems is addressed. The state space model of the system contains state- and input-dependent noise and…

Systems and Control · Computer Science 2013-12-31 Mehrdad Tabarraie

Classically, data interpolation with a parametrized model class is possible as long as the number of parameters is larger than the number of equations to be satisfied. A puzzling phenomenon in deep learning is that models are trained with…

Machine Learning · Computer Science 2022-12-27 Sébastien Bubeck , Mark Sellke

We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden…

Data Structures and Algorithms · Computer Science 2018-11-20 Omri Ben-Eliezer

A Boolean function $f:\{0,1\}^d \mapsto \{0,1\}$ is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make…

Computational Complexity · Computer Science 2017-06-02 Roksana Baleshzar , Deeparnab Chakrabarty , Ramesh Krishnan S. Pallavoor , Sofya Raskhodnikova , C. Seshadhri

The singularity confinement test is very useful for isolating integrable cases of discrete-time dynamical systems, but it does not provide a sufficient criterion for integrability. Quite recently a new property of the bilinear equations…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 A. N. W. Hone

Hyperproperties are properties of systems that relate different executions traces, with many applications from security to symmetry, consistency models of concurrency, etc. In recent years, different linear-time logics for specifying…

Logic in Computer Science · Computer Science 2022-07-08 Laura Bozzelli , Adriano Peron , Cesar Sanchez

We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…

Logic in Computer Science · Computer Science 2026-01-27 Ruotong Cheng , Azadeh Farzan

The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…

Computational Complexity · Computer Science 2025-09-03 Xi Chen , Anindya De , Yizhi Huang , Yuhao Li , Shivam Nadimpalli , Rocco A. Servedio , Tianqi Yang

We study monotonicity testing of Boolean functions over the hypergrid $[n]^d$ and design a non-adaptive tester with $1$-sided error whose query complexity is $\tilde{O}(d^{5/6})\cdot \text{poly}(\log n,1/\epsilon)$. Previous to our work,…

Discrete Mathematics · Computer Science 2017-10-31 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri