On Optimal Data Compression in Multiterminal Statistical Inference

By Shun-ichi Amari. 2011

20 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Control and Systems Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Ayfer Özgür
2. Leighton Pate Barnes
3. Yanjun Han
4. Tsachy Weissman
5. Sewoong Oh
6. Xiyang Liu
7. Jayadev Acharya

In Computer Networks and Communications

1. Leighton Pate Barnes
2. Ayfer Özgür
3. Yanjun Han
4. Tsachy Weissman
5. Jayadev Acharya
6. Clément Louis Canonne
7. Himanshu Tyagi
8. Ziteng Sun

In Control and Systems Engineering

1. Ayfer Özgür
2. Tsachy Weissman
3. Yanjun Han
4. Leighton Pate Barnes

Citations in the corpus

• Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints (2018, background): “This geometric problem is closely related to the optimal data compression in multiterminal statistical inference Amari (2011). We prove the following proposition: Proposition 16 Under the previous setting, we have max A⊂Ω:|A|=2d−1 ∥”
• A Geometric Characterization of Fisher Information from Quantized Samples with Applications to Distributed Statistical Estimation (2018, background): “The first lemma is a slight variant of Theorems 1 and 2 from [3], and our debt to that work is clear.”
• Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information (2019, background): “The following two lemmas establish a geometric interpretation of the trace Tr(IM (θ)), and are slight variants of Theorems 1 and 2 from ichi Amari (2011).”