English
Related papers

Related papers: On the Optimal Boolean Function for Prediction und…

200 papers

We study the task of noiseless linear regression under Gaussian covariates in the presence of additive oblivious contamination. Specifically, we are given i.i.d.\ samples from a distribution $(x, y)$ on $\mathbb{R}^d \times \mathbb{R}$ with…

Data Structures and Algorithms · Computer Science 2025-10-14 Ilias Diakonikolas , Chao Gao , Daniel M. Kane , John Lafferty , Ankit Pensia

The trade-off between the cost of acquiring and processing data, and uncertainty due to a lack of data is fundamental in machine learning. A basic instance of this trade-off is the problem of deciding when to make noisy and costly…

Machine Learning · Statistics 2017-03-30 Christopher R. Dance , Tomi Silander

One of the most controversial problems in neural decoding is quantifying the information loss caused by ignoring noise correlations during optimal brain computations. For more than a decade, the measure here called $ \Delta I^{DL} $ has…

Neurons and Cognition · Quantitative Biology 2017-01-16 Hugo Gabriel Eyherabide

We propose a novel Bayesian approach to solve stochastic optimization problems that involve finding extrema of noisy, nonlinear functions. Previous work has focused on representing possible functions explicitly, which leads to a two-step…

Machine Learning · Statistics 2012-11-13 Pedro A. Ortega , Jordi Grau-Moya , Tim Genewein , David Balduzzi , Daniel A. Braun

We demonstrate the achievability of a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over the single-mode lossy bosonic channel if either the eavesdropper's measurements or…

Information Theory · Computer Science 2014-03-25 Boulat A. Bash , Saikat Guha , Dennis Goeckel , Don Towsley

The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input…

Information Theory · Computer Science 2014-05-16 Brian M. Kurkoski , Hideki Yagi

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

Machine Learning · Computer Science 2023-09-08 Apollo Albright , Boris Gelfand , Michael Dixon

A parameter estimation problem is considered, in which dispersed sensors transmit to the statistician partial information regarding their observations. The sensors observe the paths of continuous semimartingales, whose drifts are linear…

Methodology · Statistics 2013-02-01 Georgios Fellouris

We show that "full-bang" control is optimal in a problem that combines features of (i) sequential least-squares {\it estimation} with Bayesian updating, for a random quantity observed in a bath of white noise; (ii) bounded {\it control} of…

Probability · Mathematics 2022-11-10 Erik Ekström , Ioannis Karatzas

We consider the problem of estimating how well a model class is capable of fitting a distribution of labeled data. We show that it is often possible to accurately estimate this "learnability" even when given an amount of data that is too…

Machine Learning · Computer Science 2019-03-26 Weihao Kong , Gregory Valiant

We study the problem of estimating the value of a known smooth function $f$ at an unknown point $\boldsymbol{\mu} \in \mathbb{R}^n$, where each component $\mu_i$ can be sampled via a noisy oracle. Sampling more frequently components of…

Machine Learning · Computer Science 2022-03-22 Tavor Z. Baharav , Gary Cheng , Mert Pilanci , David Tse

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah

Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the…

Information Theory · Computer Science 2013-12-19 Mohammad Naghshvar , Tara Javidi

We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an online algorithm to find a minimizer $\mathbf{x}^{*}$ for a…

Data Structures and Algorithms · Computer Science 2023-11-21 Avrim Blum , Meghal Gupta , Gene Li , Naren Sarayu Manoj , Aadirupa Saha , Yuanyuan Yang

We consider a discrete-time linear quadratic Gaussian networked control setting where the (full information) observer and controller are separated by a fixed-rate noiseless channel. The minimal rate required to stabilize such a system has…

Systems and Control · Computer Science 2018-09-14 Anatoly Khina , Yorie Nakahira , Yu Su , Hikmet Yıldız , Babak Hassibi

The article is devoted to the nonparametric estimation of the quadratic covariation of non-synchronously observed It\^o processes in an additive microstructure noise model. In a high-frequency setting, we aim at establishing an asymptotic…

Statistics Theory · Mathematics 2011-06-22 Markus Bibinger

We study convex empirical risk minimization for high-dimensional inference in binary models. Our first result sharply predicts the statistical performance of such estimators in the linear asymptotic regime under isotropic Gaussian features.…

Statistics Theory · Mathematics 2020-02-27 Hossein Taheri , Ramtin Pedarsani , Christos Thrampoulidis

We consider the problem of detecting the overlap between a pair of short fragments sampled in random locations from an exponentially longer sequence, via their possibly noisy reads. We consider a noiseless setting, in which the reads are…

Information Theory · Computer Science 2025-02-20 Nir Luria , Nir Weinberger

A binary string of length $2^k$ induces the Boolean function of $k$ variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The…

Information Theory · Computer Science 2011-11-08 J. Kieffer , P. Flajolet , E. -h. Yang

We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by…

Probability · Mathematics 2022-08-16 Ronen Eldan , Dan Mikulincer , Prasad Raghavendra
‹ Prev 1 3 4 5 6 7 10 Next ›