{"id":"https://openalex.org/W3156621611","doi":"https://doi.org/10.1109/infocom42981.2021.9488800","title":"Minimizing Entropy for Crowdsourcing with Combinatorial Multi-Armed Bandit","display_name":"Minimizing Entropy for Crowdsourcing with Combinatorial Multi-Armed Bandit","publication_year":2021,"publication_date":"2021-05-10","ids":{"openalex":"https://openalex.org/W3156621611","doi":"https://doi.org/10.1109/infocom42981.2021.9488800","mag":"3156621611"},"language":"en","primary_location":{"id":"doi:10.1109/infocom42981.2021.9488800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom42981.2021.9488800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","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/A5025228078","display_name":"Yiwen Song","orcid":"https://orcid.org/0000-0002-9243-9955"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yiwen Song","raw_affiliation_strings":["Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087534120","display_name":"Haiming Jin","orcid":"https://orcid.org/0000-0002-3790-3743"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haiming Jin","raw_affiliation_strings":["John Hopcroft Center for Computer Science, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"John Hopcroft Center for Computer Science, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025228078"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":4.6504,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.9478577,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9998000264167786,"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.9998000264167786,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7400870323181152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6367054581642151},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5865945219993591},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.555889904499054},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.549851655960083},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5258179903030396},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.5109735727310181},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.5017280578613281},{"id":"https://openalex.org/keywords/multi-armed-bandit","display_name":"Multi-armed bandit","score":0.4984428882598877},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4782401919364929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44388267397880554},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32373976707458496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2465900480747223}],"concepts":[{"id":"https://openalex.org/C62230096","wikidata":"https://www.wikidata.org/wiki/Q275969","display_name":"Crowdsourcing","level":2,"score":0.7400870323181152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6367054581642151},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5865945219993591},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.555889904499054},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.549851655960083},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5258179903030396},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.5109735727310181},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.5017280578613281},{"id":"https://openalex.org/C123197309","wikidata":"https://www.wikidata.org/wiki/Q2882343","display_name":"Multi-armed bandit","level":3,"score":0.4984428882598877},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4782401919364929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44388267397880554},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32373976707458496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2465900480747223},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom42981.2021.9488800","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom42981.2021.9488800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W35251828","https://openalex.org/W1814633089","https://openalex.org/W2111241577","https://openalex.org/W2117521099","https://openalex.org/W2143996311","https://openalex.org/W2146062338","https://openalex.org/W2499215323","https://openalex.org/W2542446008","https://openalex.org/W2574161003","https://openalex.org/W2605194399","https://openalex.org/W2612206112","https://openalex.org/W2613712382","https://openalex.org/W2751899817","https://openalex.org/W2790586091","https://openalex.org/W2790607499","https://openalex.org/W2790911479","https://openalex.org/W2791911050","https://openalex.org/W2792859805","https://openalex.org/W2808216250","https://openalex.org/W2884206572","https://openalex.org/W2890020788","https://openalex.org/W2892324583","https://openalex.org/W2898344539","https://openalex.org/W2910458483","https://openalex.org/W2918314918","https://openalex.org/W2949093218","https://openalex.org/W2951665052","https://openalex.org/W2963860006","https://openalex.org/W2964121406","https://openalex.org/W2965870078","https://openalex.org/W2998432688","https://openalex.org/W3037511534","https://openalex.org/W3047004582","https://openalex.org/W3047040106","https://openalex.org/W3047382256","https://openalex.org/W3101169423","https://openalex.org/W3124229194","https://openalex.org/W6601392155","https://openalex.org/W6638380517","https://openalex.org/W6676817345","https://openalex.org/W6677593936","https://openalex.org/W6684381734","https://openalex.org/W6729106829","https://openalex.org/W6743777737","https://openalex.org/W6749220538","https://openalex.org/W6754434200","https://openalex.org/W6754855666","https://openalex.org/W6764988152","https://openalex.org/W6774079664"],"related_works":["https://openalex.org/W4289341771","https://openalex.org/W3114769327","https://openalex.org/W3191284239","https://openalex.org/W2996787464","https://openalex.org/W2958076322","https://openalex.org/W2964268945","https://openalex.org/W2619553246","https://openalex.org/W4294988689","https://openalex.org/W3174419385","https://openalex.org/W3172572974"],"abstract_inverted_index":{"Nowadays,":[0],"crowdsourcing":[1,19,66],"has":[2,165],"become":[3],"an":[4,108,132],"increasingly":[5],"popular":[6],"paradigm":[7],"for":[8,22,139],"large-scale":[9],"data":[10],"collection,":[11],"annotation,":[12],"and":[13,110,143,158,185],"classification.":[14],"Today's":[15],"rapid":[16],"growth":[17],"of":[18,44,65,81,117,134,170],"platforms":[20],"calls":[21],"effective":[23],"worker":[24,36,73,91,106],"selection":[25,74,92],"mechanisms,":[26],"which":[27,47,103,172],"oftentimes":[28],"have":[29],"to":[30,61,155],"operate":[31],"with":[32,181],"a":[33,58,72,98,166,183],"priori":[34],"unknown":[35],"reliability.":[37],"We":[38],"discover":[39],"that":[40,76,119,163,190],"the":[41,49,52,63,78,82,114,121,135],"empirical":[42,79,123,140],"entropy":[43,80,141,149],"workers'":[45],"results,":[46,55],"measures":[48],"uncertainty":[50],"in":[51,146],"final":[53],"aggregated":[54],"naturally":[56],"becomes":[57],"suitable":[59],"metric":[60],"evaluate":[62],"outcome":[64],"tasks.":[67],"Therefore,":[68],"this":[69],"paper":[70],"designs":[71],"mechanism":[75],"minimizes":[77],"results":[83],"submitted":[84],"by":[85],"participating":[86],"workers.":[87],"Specifically,":[88],"we":[89,129,161],"formulate":[90],"under":[93],"sequentially":[94],"arriving":[95],"tasks":[96],"as":[97,107],"combinatorial":[99],"multi-armed":[100],"bandit":[101],"problem,":[102],"treats":[104],"each":[105],"arm,":[109],"aims":[111],"at":[112],"learning":[113],"best":[115],"combination":[116],"arms":[118],"minimize":[120],"cumulative":[122],"entropy.":[124],"By":[125],"information":[126],"theoretic":[127],"methods,":[128],"carefully":[130],"derive":[131],"estimation":[133],"upper":[136,150,168],"confidence":[137,151],"bound":[138,152,169],"minimization,":[142],"leverage":[144],"it":[145],"our":[147,191],"minimum":[148],"(ME-UCB)":[153],"algorithm":[154,193],"balance":[156],"exploration":[157],"exploitation.":[159],"Theoretically,":[160],"prove":[162],"ME-UCB":[164,192],"regret":[167],"O(1),":[171],"surpasses":[173],"existing":[174],"submodular":[175],"UCB":[176],"algorithms.":[177],"Our":[178],"extensive":[179],"experiments":[180],"both":[182],"synthetic":[184],"real-world":[186],"dataset":[187],"empirically":[188],"demonstrate":[189],"outperforms":[194],"other":[195],"state-of-the-art":[196],"approaches.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-03T09:05:47.796612","created_date":"2025-10-10T00:00:00"}