English
Related papers

Related papers: Self-Predicting Boolean Functions

200 papers

A statistical functional, such as the mean or the median, is called elicitable if there is a scoring function or loss function such that the correct forecast of the functional is the unique minimizer of the expected score. Such scoring…

Statistics Theory · Mathematics 2016-08-10 Tobias Fissler , Johanna F. Ziegel

A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using…

Computational Complexity · Computer Science 2011-12-30 Noga Alon , Amit Weinstein

The problem we concentrate on is as follows: given (1) a convex compact set $X$ in ${\mathbb{R}}^n$, an affine mapping $x\mapsto A(x)$, a parametric family $\{p_{\mu}(\cdot)\}$ of probability densities and (2) $N$ i.i.d. observations of the…

Statistics Theory · Mathematics 2009-08-24 Anatoli B. Juditsky , Arkadi S. Nemirovski

Calibration is a classical notion from the forecasting literature which aims to address the question: how should predicted probabilities be interpreted? In a world where we only get to observe (discrete) outcomes, how should we evaluate a…

Machine Learning · Computer Science 2025-09-03 Parikshit Gopalan , Lunjia Hu

Loss minimization is a dominant paradigm in machine learning, where a predictor is trained to minimize some loss function that depends on an uncertain event (e.g., "will it rain tomorrow?''). Different loss functions imply different…

Machine Learning · Computer Science 2021-09-14 Parikshit Gopalan , Adam Tauman Kalai , Omer Reingold , Vatsal Sharan , Udi Wieder

When the distributions of the training and test data do not coincide, the problem of understanding generalization becomes considerably more complex, prompting a variety of questions. Prior work has shown that, for some fixed learning…

Machine Learning · Computer Science 2025-12-03 Jordi Pérez-Guijarro

Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…

Metric Geometry · Mathematics 2020-02-25 Mikhail Nevskii

Items in a test are often used as a basis for making decisions and such tests are therefore required to have good psychometric properties, like unidimensionality. In many cases the sum score is used in combination with a threshold to decide…

Methodology · Statistics 2020-07-14 Lourens Waldorp , Maarten Marsman , Denny Borsboom

Optimal prediction approximates the average solution of a large system of ordinary differential equations by a smaller system. We present how optimal prediction can be applied to a typical problem in the field of molecular dynamics, in…

Mathematical Physics · Physics 2008-11-15 Benjamin Seibold

A function that is analytic on a domain of $\mathbb{C}^n$ is holonomic if it is the solution to a holonomic system of linear homogeneous differential equations with polynomial coefficients. We define and study the Bernstein-Sato polynomial…

Algebraic Geometry · Mathematics 2021-02-02 András Cristian Lőrincz

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean…

Cryptography and Security · Computer Science 2012-02-07 Hui Wang , Jie Peng , Yuan Li , Haibin Kan

Extensive studies of Boolean functions are carried in many fields. The Mobius transform is often involved for these studies. In particular, it plays a central role in coincident functions, the class of Boolean functions invariant by this…

Cryptography and Security · Computer Science 2015-07-21 Morgan Barbier , Hayat Cheballah , Jean-Marie Le Bars

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results…

Machine Learning · Statistics 2016-11-15 Joel Predd , Robert Seiringer , Elliott H. Lieb , Daniel Osherson , Vincent Poor , Sanjeev Kulkarni

Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…

Classical Analysis and ODEs · Mathematics 2020-06-05 S. V. Kislyakov , P. S. Perstneva

Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…

Cellular Automata and Lattice Gases · Physics 2020-05-19 Luca Mariot , Martina Saletta , Alberto Leporati , Luca Manzoni

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

Information Theory · Computer Science 2009-11-18 WeiGuo Zhang , GuoZhen Xiao

We study the optimal linear prediction of a random function that takes values in an infinite dimensional Hilbert space. We begin by characterizing the mean square prediction error (MSPE) associated with a linear predictor and discussing the…

Statistics Theory · Mathematics 2025-09-10 Won-Ki Seo

The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…

Numerical Analysis · Mathematics 2023-08-14 Luisa Fermo , Concetta Laurita , Maria Grazia Russo

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Symbolic Computation · Computer Science 2014-08-12 Qing-Hu Hou , Rong-Hua Wang

The calculation of autocorrelation functions represents a routinely used tool to characterise quantum states of light. In this paper, we evaluate the $g^{(2)}$ function for detected photons in the case of mesoscopic multi-mode twin-beam…

Quantum Physics · Physics 2018-12-10 Giovanni Chesi , Alessia Allevi , Maria Bondani
‹ Prev 1 8 9 10 Next ›