M Brandon Westover,Joseph A O&#x;Sullivan
M Brandon Westover
Biological and machine pattern recognition systems face a common challenge: Given sensory data about an unknown pattern, classify the pattern by searching for the best match within a library of representations stored in memory. In many case...
Eric C Hall,Garvesh Raskutti,Rebecca M Willett
Eric C Hall
Vector autoregressive models characterize a variety of time series in which linear combinations of current and past observations can be used to accurately predict future observations. For instance, each element of an observation vector coul...
M Brandon Westover
M Brandon Westover
We present a simple geometrical interpretation for the solution to the multiple hypothesis testing problem in the asymptotic limit. Under this interpretation, the optimal decision rule is a nearest neighbor classifier on the probability sim...
Abram Magner,Krzysztof Turowski,Wojciech Szpankowski
Abram Magner
Compression schemes for advanced data structures have become a central modern challenge. Information theory has traditionally dealt with conventional data such as text, images, or video. In contrast, most data available today is multitype a...
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes [0.03%]
二次相似性查询的压缩：有限块长和实用方案
Fabian Steiner,Steffen Dempfle,Amir Ingber et al.
Fabian Steiner et al.
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem - the minimal com...
Kittipong Kittichokechai,Yeow-Khiang Chia,Tobias J Oechtering et al.
Kittipong Kittichokechai et al.
We consider secure multi-terminal source coding problems in the presence of a public helper. Two main scenarios are studied: 1) source coding with a helper where the coded side information from the helper is eavesdropped by an external eave...
Albert No,Tsachy Weissman
Albert No
We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components b...
Himanshu Asnani,Ilan Shomorony,A Salman Avestimehr et al.
Himanshu Asnani et al.
We study the problem of communicating a distributed correlated memoryless source over a memoryless network, from source nodes to destination nodes, under quadratic distortion constraints. We establish the following two complementary results...
Jiantao Jiao,Kartik Venkat,Yanjun Han et al.
Jiantao Jiao et al.
We propose a general methodology for the construction and analysis of essentially minimax estimators for a wide class of functionals of finite dimensional parameters, and elaborate on the case of discrete distributions, where the support si...
Amir Ingber,Thomas Courtade,Tsachy Weissman
Amir Ingber
The problem of performing similarity queries on compressed data is considered. We focus on the quadratic similarity measure, and study the fundamental tradeoff between compression rate, sequence length, and reliability of queries performed ...