{"id":"https://openalex.org/W7127076631","doi":"https://doi.org/10.48550/arxiv.2601.23221","title":"Optimal Fair Aggregation of Crowdsourced Noisy Labels using Demographic Parity Constraints","display_name":"Optimal Fair Aggregation of Crowdsourced Noisy Labels using Demographic Parity Constraints","publication_year":2026,"publication_date":"2026-01-30","ids":{"openalex":"https://openalex.org/W7127076631","doi":"https://doi.org/10.48550/arxiv.2601.23221"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.23221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124787491","display_name":"Gabriel Singer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singer, Gabriel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124785765","display_name":"Samuel Gruffaz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gruffaz, Samuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124760703","display_name":"Olivier Vo Van","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Van, Olivier Vo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031522235","display_name":"Nicolas Vayatis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vayatis, Nicolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124827013","display_name":"Argyris Kalogeratos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kalogeratos, Argyris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10883","display_name":"Ethics and Social Impacts of AI","score":0.024700000882148743,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.0007999999797903001,"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/crowdsourcing","display_name":"Crowdsourcing","score":0.76910001039505},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5210000276565552},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5055000185966492},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42289999127388},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.40849998593330383},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.3531999886035919},{"id":"https://openalex.org/keywords/fairness-measure","display_name":"Fairness measure","score":0.3257000148296356}],"concepts":[{"id":"https://openalex.org/C62230096","wikidata":"https://www.wikidata.org/wiki/Q275969","display_name":"Crowdsourcing","level":2,"score":0.76910001039505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438000202178955},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5210000276565552},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34470000863075256},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3400999903678894},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3382999897003174},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33399999141693115},{"id":"https://openalex.org/C11867375","wikidata":"https://www.wikidata.org/wiki/Q5430671","display_name":"Fairness measure","level":4,"score":0.3257000148296356},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.30869999527931213},{"id":"https://openalex.org/C2986046992","wikidata":"https://www.wikidata.org/wiki/Q16773055","display_name":"Information aggregation","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C82578977","wikidata":"https://www.wikidata.org/wiki/Q16773055","display_name":"Data aggregator","level":3,"score":0.29649999737739563},{"id":"https://openalex.org/C160234255","wikidata":"https://www.wikidata.org/wiki/Q812535","display_name":"Bayesian inference","level":3,"score":0.28450000286102295},{"id":"https://openalex.org/C153668964","wikidata":"https://www.wikidata.org/wiki/Q27636","display_name":"Majority rule","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2639000117778778},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2554999887943268}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.23221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.23221","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.23221","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.23221","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"As":[0],"acquiring":[1],"reliable":[2],"ground-truth":[3,128,133],"labels":[4],"is":[5,17],"usually":[6],"costly,":[7],"or":[8],"infeasible,":[9],"crowdsourcing":[10],"and":[11,49,80,167,176],"aggregation":[12,40,71,162],"of":[13,69,97,102,106,117,126,173],"noisy":[14],"human":[15],"annotations":[16],"the":[18,66,74,85,94,103,107,114,118,127,148,151,171,178],"typical":[19],"resort.":[20],"Aggregating":[21],"subjective":[22],"labels,":[23],"though,":[24],"may":[25,135],"amplify":[26],"individual":[27,108],"biases,":[28],"particularly":[29],"regarding":[30],"sensitive":[31],"features,":[32],"raising":[33],"fairness":[34,37,67,95,104,115,144],"concerns.":[35],"Nonetheless,":[36],"in":[38,100],"crowdsourced":[39,70],"remains":[41],"largely":[42],"unexplored,":[43],"with":[44],"no":[45],"existing":[46],"convergence":[47],"guarantees":[48],"only":[50],"limited":[51],"post-processing":[52,145],"approaches":[53],"for":[54,77],"enforcing":[55],"$\\varepsilon$-fairness":[56,75],"under":[57,129],"demographic":[58,157],"parity.":[59],"We":[60,110],"address":[61],"this":[62],"gap":[63,96,116],"by":[64],"analyzing":[65],"s":[68],"methods":[72],"within":[73],"framework,":[76],"Majority":[78,98],"Vote":[79,99],"Optimal":[81],"Bayesian":[82],"aggregation.":[83],"In":[84],"small-crowd":[86],"regime,":[87],"we":[88,139],"derive":[89],"an":[90],"upper":[91],"bound":[92],"on":[93,165],"terms":[101],"gaps":[105],"annotators.":[109],"further":[111],"show":[112],"that":[113,125],"aggregated":[119],"consensus":[120],"converges":[121],"exponentially":[122],"fast":[123],"to":[124,150,160],"interpretable":[130],"conditions.":[131],"Since":[132],"itself":[134],"still":[136],"be":[137],"unfair,":[138],"generalize":[140],"a":[141],"state-of-the-art":[142],"multiclass":[143],"algorithm":[146],"from":[147],"continuous":[149],"discrete":[152],"setting,":[153],"which":[154],"enforces":[155],"strict":[156],"parity":[158],"constraints":[159],"any":[161],"rule.":[163],"Experiments":[164],"synthetic":[166],"real":[168],"datasets":[169],"demonstrate":[170],"effectiveness":[172],"our":[174],"approach":[175],"corroborate":[177],"theoretical":[179],"insights.":[180]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-03T00:00:00"}