{"id":"https://openalex.org/W4405909470","doi":"https://doi.org/10.1109/itw61385.2024.10807019","title":"On Information Theoretic Fairness: Compressed Representations with Perfect Demographic Parity","display_name":"On Information Theoretic Fairness: Compressed Representations with Perfect Demographic Parity","publication_year":2024,"publication_date":"2024-11-24","ids":{"openalex":"https://openalex.org/W4405909470","doi":"https://doi.org/10.1109/itw61385.2024.10807019"},"language":"en","primary_location":{"id":"doi:10.1109/itw61385.2024.10807019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw61385.2024.10807019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-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":["KTH Royal Institute of Technology,Division of Information Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041149980","display_name":"Borja Rodr\u00edguez-G\u00e1lvez","orcid":"https://orcid.org/0000-0002-0862-1333"},"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":"Borja Rodr\u00edguez-G\u00e1lvez","raw_affiliation_strings":["KTH Royal Institute of Technology,Division of Information Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering","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":["KTH Royal Institute of Technology,Division of Information Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology,Division of Information Science and Engineering","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":null,"apc_paid":null,"fwci":1.2831,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78028722,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.581948459148407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54981929063797},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4197232127189636},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.41697192192077637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31391581892967224},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1915399432182312},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1007651686668396}],"concepts":[{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.581948459148407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54981929063797},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4197232127189636},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.41697192192077637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31391581892967224},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1915399432182312},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1007651686668396},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw61385.2024.10807019","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw61385.2024.10807019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2071342505","https://openalex.org/W2077145963","https://openalex.org/W2146705998","https://openalex.org/W2161001052","https://openalex.org/W2886523564","https://openalex.org/W2963412800","https://openalex.org/W2967916697","https://openalex.org/W2976116280","https://openalex.org/W3108844855","https://openalex.org/W3121783531","https://openalex.org/W3123181209","https://openalex.org/W3127536994","https://openalex.org/W3173593876","https://openalex.org/W3182521736","https://openalex.org/W3215441929","https://openalex.org/W4387789705","https://openalex.org/W4389332325","https://openalex.org/W6640850671","https://openalex.org/W6684072790","https://openalex.org/W6691148622","https://openalex.org/W6728551298","https://openalex.org/W6762534589","https://openalex.org/W6764294493","https://openalex.org/W6769457035"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"In":[0,183],"this":[1],"article,":[2],"we":[3,39,50,85,91,132,138,186],"study":[4,202],"the":[5,9,24,52,95,101,105,109,127,142,150,154,161,168,191,196,203,206,225],"fundamental":[6],"limits":[7],"in":[8],"design":[10,53,88,135],"of":[11,26,54,64,111,170,190,205],"fair":[12],"and/or":[13,20],"private":[14],"representations":[15],"achieving":[16],"perfect":[17,21,220],"demographic":[18],"parity":[19],"privacy":[22,221],"through":[23],"lens":[25],"information":[27,63,96,143],"theory.":[28],"More":[29],"precisely,":[30],"given":[31],"some":[32,65],"useful":[33],"data":[34],"<tex":[35,47,57,70,77,97,120,144,177],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[36,48,58,71,78,98,121,145,178],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$X$</tex>":[37],"that":[38,60,73,76,100,116,119,149,173,176],"wish":[40],"to":[41,43,93,140],"employ":[42,187],"solve":[44],"a":[45,55,87,134,217,229],"task":[46,155],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$T$</tex>,":[49],"consider":[51,81,86,133],"representation":[56,102,151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$Y$</tex>":[59],"has":[61],"no":[62],"sensitive":[66,162,226],"attribute":[67,163,227],"or":[68,164],"secret":[69],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$s$</tex>,":[72],"is,":[74,117,174],"such":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$I(Y;S)=0$</tex>.":[79],"We":[80],"two":[82],"scenarios.":[83],"First,":[84],"desiderata":[89,136],"where":[90,137],"want":[92,139],"maximize":[94,141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$I(Y;T)$</tex>":[99],"contains":[103,152],"about":[104,153],"task,":[106],"while":[107,166],"constraining":[108,167],"level":[110],"compression":[112],"(or":[113],"encoding":[114],"rate),":[115],"ensuring":[118,175],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$I(Y;X)\\leq":[122],"r$</tex>.":[123,182],"Second,":[124],"inspired":[125],"by":[126,160,223],"Conditional":[128],"Fairness":[129],"Bottleneck":[130],"problem,":[131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$I(Y,\\":[146],"T\\vert":[147],"S)$</tex>":[148],"which":[156],"is":[157],"not":[158],"shared":[159],"secret,":[165],"amount":[169],"irrelevant":[171],"information,":[172],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$I(Y;X\\vert":[179],"T,\\":[180],"S)\\leq":[181],"both":[184],"cases,":[185],"extended":[188],"versions":[189],"Functional":[192,198],"Representation":[193,199],"Lemma":[194,200],"and":[195,201],"Strong":[197],"tightness":[204],"obtained":[207],"bounds.":[208],"Every":[209],"result":[210],"here":[211],"can":[212],"also":[213],"be":[214],"interpreted":[215],"as":[216,228],"coding":[218],"with":[219],"problem":[222],"considering":[224],"secret.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}