English
Related papers

Related papers: Inference under Information Constraints I: Lower B…

200 papers

In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…

Information Theory · Computer Science 2015-12-17 Reza K. Farsani , Amir K. Khandani

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

We investigate a generalized empirical likelihood approach in a two-group setting where the constraints on parameters have a form of U-statistics. In this situation, the summands that consist of the constraints for the empirical likelihood…

Methodology · Statistics 2015-05-04 Jihnhee Yu , Luge Yang , Albert Vexler , Alan D. Hutson

In typical high dimensional statistical inference problems, confidence intervals and hypothesis tests are performed for a low dimensional subset of model parameters under the assumption that the parameters of interest are unconstrained.…

Methodology · Statistics 2019-11-19 Ming Yu , Varun Gupta , Mladen Kolar

Boundary samples are special inputs to artificial neural networks crafted to identify the execution environment used for inference by the resulting output label. The paper presents and evaluates algorithms to generate transparent boundary…

Machine Learning · Computer Science 2021-06-15 Alexander Schlögl , Tobias Kupek , Rainer Böhme

We study the problem of discrete distribution testing in the two-party setting. For example, in the standard closeness testing problem, Alice and Bob each have $t$ samples from, respectively, distributions $a$ and $b$ over $[n]$, and they…

Data Structures and Algorithms · Computer Science 2018-11-12 Alexandr Andoni , Tal Malkin , Negev Shekel Nosatzki

The mutual information is bounded from above by a decreasing affine function of the square of the distance between the input distribution and the set of all capacity-achieving input distributions $\Pi_{\mathcal{A}}$, on small enough…

Information Theory · Computer Science 2025-04-24 Barış Nakiboğlu , Hao-Chung Cheng

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…

Information Theory · Computer Science 2015-03-17 Xiang He , Aylin Yener

We provide a general framework for computing lower-bounds on the sample complexity of recovering the underlying graphs of Ising models, given i.i.d samples. While there have been recent results for specific graph classes, these involve…

Machine Learning · Computer Science 2014-12-09 Karthikeyan Shanmugam , Rashish Tandon , Alexandros G. Dimakis , Pradeep Ravikumar

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

Constraints can be interpreted in a broad sense as any kind of explicit restriction over the parameters. While some constraints are defined directly on the parameter space, when they are instead defined by known behaviour on the model,…

Methodology · Statistics 2015-02-27 Shirin Golchi , David A. Campbell

A distributed inference scheme which uses bounded transmission functions over a Gaussian multiple access channel is considered. When the sensor measurements are decreasingly reliable as a function of the sensor index, the conditions on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-16 Sivaraman Dasarathan , Cihan Tepedelenlioglu

We consider a setup in which confidential i.i.d. samples $X_1,\dotsc,X_n$ from an unknown finite-support distribution $\boldsymbol{p}$ are passed through $n$ copies of a discrete privatization channel (a.k.a. mechanism) producing outputs…

Machine Learning · Computer Science 2018-11-30 Adriano Pastore , Michael Gastpar

We propose a practical methodology to protect a user's private data, when he wishes to publicly release data that is correlated with his private data, in the hope of getting some utility. Our approach relies on a general statistical…

Cryptography and Security · Computer Science 2015-10-28 Salman Salamatian , Amy Zhang , Flavio du Pin Calmon , Sandilya Bhamidipati , Nadia Fawaz , Branislav Kveton , Pedro Oliveira , Nina Taft

With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…

Information Theory · Computer Science 2015-07-28 Yi Lu

The problem of statistical learning is to construct an accurate predictor of a random variable as a function of a correlated random variable on the basis of an i.i.d. training sample from their joint distribution. Allowable predictors are…

Information Theory · Computer Science 2009-04-30 Maxim Raginsky

In the "correlated sampling" problem, two players are given probability distributions $P$ and $Q$, respectively, over the same finite set, with access to shared randomness. Without any communication, the two players are each required to…

Computational Complexity · Computer Science 2020-11-24 Mohammad Bavarian , Badih Ghazi , Elad Haramaty , Pritish Kamath , Ronald L. Rivest , Madhu Sudan

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…

Information Theory · Computer Science 2016-04-12 Parthajit Mohapatra , Chandra R. Murthy , Jemin Lee

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

For testing goodness of fit it is very popular to use either the chi square statistic or G statistics (information divergence). Asymptotically both are chi square distributed so an obvious question is which of the two statistics that has a…

Statistics Theory · Mathematics 2012-06-19 Peter Harremoës , Gábor Tusnády
‹ Prev 1 3 4 5 6 7 10 Next ›