Distributed cooperative information bottleneck

This paper investigates a scenario where two distant nodes separately observe memoryless process, namely X 1 and X 2 , and can cooperate through multiple exchanges of messages with the goal of enabling a third node to learn "relevant information" (measured in terms of a multi-letter mutual...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / IEEE International Symposium on Information Theory pp. 709 - 713
Main Authors: Vera, Matias, Rey Vega, Leonardo, Piantanida, Pablo
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2017
Subjects:
ISSN:2157-8117
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper investigates a scenario where two distant nodes separately observe memoryless process, namely X 1 and X 2 , and can cooperate through multiple exchanges of messages with the goal of enabling a third node to learn "relevant information" (measured in terms of a multi-letter mutual information) about some hidden memoryless process Y, which is arbitrarily dependent on (X 1 , X 2 ). These interactive exchanges yield an explicit cooperation that helps the third node to identify, from the distributed observations X 1 and X 2 , useful features for the inference of Y. An inner and an outer bound to the rate-relevance region of this problem is derived. Optimal characterization of the rate-relevance region under two different conditions on the dependence structures of the involved variables is showed. Also, two examples for Gaussian sources are studied.
AbstractList This paper investigates a scenario where two distant nodes separately observe memoryless process, namely X 1 and X 2 , and can cooperate through multiple exchanges of messages with the goal of enabling a third node to learn "relevant information" (measured in terms of a multi-letter mutual information) about some hidden memoryless process Y, which is arbitrarily dependent on (X 1 , X 2 ). These interactive exchanges yield an explicit cooperation that helps the third node to identify, from the distributed observations X 1 and X 2 , useful features for the inference of Y. An inner and an outer bound to the rate-relevance region of this problem is derived. Optimal characterization of the rate-relevance region under two different conditions on the dependence structures of the involved variables is showed. Also, two examples for Gaussian sources are studied.
Author Vera, Matias
Piantanida, Pablo
Rey Vega, Leonardo
Author_xml – sequence: 1
  givenname: Matias
  surname: Vera
  fullname: Vera, Matias
  email: mvera@fi.uba.ar
  organization: Fac. de Ing., Univ. de Buenos Aires, Buenos Aires, Argentina
– sequence: 2
  givenname: Leonardo
  surname: Rey Vega
  fullname: Rey Vega, Leonardo
  email: lrey@fi.uba.ar
  organization: Fac. de Ing., UBA, Buenos Aires, Argentina
– sequence: 3
  givenname: Pablo
  surname: Piantanida
  fullname: Piantanida, Pablo
  email: pablo.piantanida@centralesupelec.fr
  organization: Lab. des Signaux et Syst., Univ. Paris-Sud, Gif-sur-Yvette, France
BookMark eNotj81KAzEURqMo2NY-gLiZF5jx5v9mKfVvoODCui7JzB2MtpOSiYJvb8GuvrM6nG_OLsY0EmM3HBrOwd21b-2mEcBtgwDGCDhjS2eRa3CgwBl1zmaCa1sj5_aKzafpE0BaCWLGmoc4lRzDd6G-6lI6UPYl_lAVxyHl_ZHTWIVUyo5G6r6u2eXgdxMtT7tg70-Pm9VLvX59blf36_pDgCt1J1BLJCTudOeI1BB659HAoAC0UdZZkJ3lzgRxrOwDBh8GRAheaIVSLtjtvzcS0faQ497n3-3pnvwDMxVE8w
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ISIT.2017.8006620
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781509040964
150904096X
EISSN 2157-8117
EndPage 713
ExternalDocumentID 8006620
Genre orig-research
GroupedDBID 6IE
6IH
6IK
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-h209t-c28538e8e195c9ee4fbd9a860f40056479703c7196b2509db8babf880ba254833
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000430345200143&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:05:09 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-h209t-c28538e8e195c9ee4fbd9a860f40056479703c7196b2509db8babf880ba254833
PageCount 5
ParticipantIDs ieee_primary_8006620
PublicationCentury 2000
PublicationDate 2017-June
PublicationDateYYYYMMDD 2017-06-01
PublicationDate_xml – month: 06
  year: 2017
  text: 2017-June
PublicationDecade 2010
PublicationTitle Proceedings / IEEE International Symposium on Information Theory
PublicationTitleAbbrev ISIT
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0037302
Score 1.630456
Snippet This paper investigates a scenario where two distant nodes separately observe memoryless process, namely X 1 and X 2 , and can cooperate through multiple...
SourceID ieee
SourceType Publisher
StartPage 709
SubjectTerms Distortion
Distributed Source Coding
Electronic mail
Information Bottleneck
Interactive Lossy Source Coding
Markov processes
Mutual information
Random variables
Shannon theory
Source coding
Title Distributed cooperative information bottleneck
URI https://ieeexplore.ieee.org/document/8006620
WOSCitedRecordID wos000430345200143&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8eCpaiu-2YNH02Z34yZzVosFKQUr9FbymKAI3VJbf7_J7rYiePEWAiFMksnMJDPfB3BDzqWSZ5qFaJmYKLhgSmDKvPA8N8oqQxWI67Mcj9VshpMW3O5qYYioSj6jfmxWf_mutJv4VDZQFV55CND3pJR1rdb21s3DSc2aX8uU42D0MprGxC3Zbwb9Yk-pjMew879pD6H3U4WXTHb25QhatDiGzpaGIWm0sgv9hwh-G3mryCW2LJdUo3knDShqXPokMoYFA0P2owevw8fp_RNraBDYW8ZxzWwWTKoiRSneWSQS3jjUquBeRCBPITForZVBlUzwZ9AZZbTxQS-NDtGfyvMTaC_KBZ1ColMfHJrgVAiPQheZ5oRI6LQvhNJYnEE3ij9f1kgX80by87-7L-AgrnCdOHUJ7fVqQ1ewb7_W75-r62p7vgGCUJDv
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1KFfRUtRXr5x48mja7m-5mzmppsZaCFXorSXaCInRLbf39JrvbiuDFWwiEMEkmM5PMvAdwS1kWpjxSzEXLxETCBZMCQ2aF5bGWRmoqQFxH6XgsZzOc1OBuVwtDREXyGXV8s_jLz3Kz8U9lXVnglbsAfa8nRBSW1Vrbezd2ZzWq_i1Djt3hy3DqU7fSTjXsF39KYT76jf9NfAStnzq8YLKzMMdQo8UJNLZEDEGll03oPHj4W89cRVlg8nxJJZ53UMGi-sUPPGeYMzFkPlrw2n-c3g9YRYTA3iKOa2YiZ1QlSQqxZ5BIWJ2hkgm3wkN5ihSd3prUKZN2Hg1mWmqlrdNMrVz8J-P4FOqLfEFnEKjQOpfGuRXColBJpDghEmbKJkIqTNrQ9OLPlyXWxbyS_Pzv7hs4GEyfR_PRcPx0AYd-tcs0qkuor1cbuoJ987V-_1xdF1v1DT5VlDY
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+IEEE+International+Symposium+on+Information+Theory&rft.atitle=Distributed+cooperative+information+bottleneck&rft.au=Vera%2C+Matias&rft.au=Rey+Vega%2C+Leonardo&rft.au=Piantanida%2C+Pablo&rft.date=2017-06-01&rft.pub=IEEE&rft.eissn=2157-8117&rft.spage=709&rft.epage=713&rft_id=info:doi/10.1109%2FISIT.2017.8006620&rft.externalDocID=8006620