{"id":"https://openalex.org/W7161259840","doi":"https://doi.org/10.1109/tit.2026.3693890","title":"On Information Theoretic Fairness: From Perfect to Bounded Demographic Parity","display_name":"On Information Theoretic Fairness: From Perfect to Bounded Demographic Parity","publication_year":2026,"publication_date":"2026-05-15","ids":{"openalex":"https://openalex.org/W7161259840","doi":"https://doi.org/10.1109/tit.2026.3693890"},"language":null,"primary_location":{"id":"doi:10.1109/tit.2026.3693890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3693890","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068807935","display_name":"Amirreza Zamani","orcid":"https://orcid.org/0000-0001-9296-4939"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Amirreza Zamani","raw_affiliation_strings":["Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-9296-4939","affiliations":[{"raw_affiliation_string":"Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119449097","display_name":"Abolfazl Changizi","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Abolfazl Changizi","raw_affiliation_strings":["Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0009-0004-9662-9002","affiliations":[{"raw_affiliation_string":"Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041348422","display_name":"Mikael Skoglund","orcid":"https://orcid.org/0000-0002-7926-5081"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Skoglund","raw_affiliation_strings":["Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-7926-5081","affiliations":[{"raw_affiliation_string":"Department of Information Science and Engineering, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.45373236,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"7","first_page":"5122","last_page":"5138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10883","display_name":"Ethics and Social Impacts of AI","score":0.6075000166893005,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10883","display_name":"Ethics and Social Impacts of AI","score":0.6075000166893005,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.04340000078082085,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.012600000016391277,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6772000193595886},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4415000081062317},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.42289999127388},{"id":"https://openalex.org/keywords/information-transmission","display_name":"Information transmission","score":0.28360000252723694},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.2809999883174896}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6772000193595886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5583000183105469},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4415000081062317},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40700000524520874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3425000011920929},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3122999966144562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28610000014305115},{"id":"https://openalex.org/C2983568541","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Information transmission","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2777999937534332},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2026.3693890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2026.3693890","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5089064240455627,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,264],"paper,":[2],"we":[3,100,105,111,147,153,192,227],"study":[4,249],"the":[5,9,21,29,56,65,82,115,119,123,127,142,157,161,165,172,177,195,200,217,232,237,250,253,289],"fundamental":[6],"limits":[7],"in":[8,256,263],"design":[10,30,108,150,260,273],"of":[11,23,129,179,231,252],"fair":[12],"representations":[13],"under":[14],"different":[15],"demographic":[16,34,71,84,98,190,219],"(statistical)":[17],"parity":[18,72,85,220],"constraints":[19],"through":[20],"lens":[22],"information":[24,63],"theory.":[25],"We":[26,79],"first":[27],"consider":[28,87,101,106,148],"problem":[31,109,151,261,274],"achieving":[32],"perfect":[33,70,83,97,277],"parity.":[35],"More":[36],"specifically,":[37],"an":[38],"agent":[39,57],"uses":[40],"some":[41,51],"useful":[42],"dataXto":[43],"solve":[44],"a":[45,59,88,107,149,204,271,280,285,293],"taskT.":[46],"Since":[47],"bothXandTare":[48],"correlated":[49],"with":[50,275],"sensitive":[52,66,173,290],"attribute":[53,291],"or":[54,279],"secretS,":[55],"designs":[58],"representationYthat":[60],"has":[61],"no":[62],"about":[64,122,164],"attributeS,":[67],"i.e.,":[68],"satisfying":[69,203],"constraint,":[73,90,210],"implying":[74,91],"thatI(Y":[75,92,137,185,214],";":[76,93,117,159,198,222],"S)=":[77],"0.":[78],"then":[80],"relax":[81],"and":[86,236,248,284],"bounded-parity":[89],"S)\u2264":[94,223],"\u03f5.":[95,224],"Under":[96,188],"parity,":[99,191],"two":[102],"scenarios.":[103],"First,":[104],"where":[110,152],"want":[112,154],"to":[113,155],"maximize":[114,156],"informationI(Y":[116,158,197],"T)that":[118],"representation":[120,162],"contains":[121,163],"task,":[124],"while":[125,175,202],"constraining":[126,176],"level":[128],"compression":[130,206],"(or":[131,207],"encoding":[132,208],"rate),":[133],"that":[134,182,211],"is,":[135,183,212],"ensuring":[136,184,213],";X)\u2264r.":[138,215],"Second,":[139],"inspired":[140],"by":[141,171],"Conditional":[143],"Fairness":[144],"Bottleneck":[145],"problem,":[146],"T|S)that":[160],"task":[166,201],"which":[167,242],"is":[168],"not":[169],"shared":[170],"attribute,":[174],"amount":[178],"irrelevant":[180],"information,":[181],";X|T,":[186],"S)\u2264r.":[187],"bounded":[189,205,218,281],"designYthat":[193],"maximizes":[194],"mutual":[196],"T)about":[199],"rate)":[209],"Simultaneously,Ysatisfies":[216],"constraintI(Y":[221],"To":[225],"designY,":[226],"use":[228],"extended":[229],"versions":[230],"Functional":[233,239],"Representation":[234,240],"Lemma":[235,241],"Strong":[238],"are":[243],"based":[244],"on":[245],"randomization":[246],"techniques":[247],"tightness":[251],"obtained":[254],"bounds":[255],"special":[257],"cases.":[258],"Every":[259],"studied":[262],"paper":[265],"can":[266],"also":[267],"be":[268],"interpreted":[269],"as":[270,292],"code":[272],"either":[276],"privacy":[278],"leakage":[282],"constraint":[283],"limited":[286],"rate,":[287],"considering":[288],"secret.":[294]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-05-16T00:00:00"}