{"id":"https://openalex.org/W3161100413","doi":"https://doi.org/10.14778/3467861.3467862","title":"How to design robust algorithms using noisy comparison Oracle","display_name":"How to design robust algorithms using noisy comparison Oracle","publication_year":2021,"publication_date":"2021-06-01","ids":{"openalex":"https://openalex.org/W3161100413","doi":"https://doi.org/10.14778/3467861.3467862","mag":"3161100413"},"language":"en","primary_location":{"id":"doi:10.14778/3467861.3467862","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3467861.3467862","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2105.05782","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025800378","display_name":"Raghavendra Addanki","orcid":"https://orcid.org/0000-0003-1478-083X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghavendra Addanki","raw_affiliation_strings":["UMass Amherst","[UMass, Amherst]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMass Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"[UMass, Amherst]","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038532934","display_name":"Sainyam Galhotra","orcid":"https://orcid.org/0000-0003-2529-4036"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sainyam Galhotra","raw_affiliation_strings":["UMass Amherst","[UMass, Amherst]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UMass Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"[UMass, Amherst]","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110611660","display_name":"Barna Saha","orcid":null},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barna Saha","raw_affiliation_strings":["UC Berkeley","UC Berkeley#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC Berkeley","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]},{"raw_affiliation_string":"UC Berkeley#TAB#","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1395,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44385201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"14","issue":"10","first_page":"1703","last_page":"1716"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9955999851226807,"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/oracle","display_name":"Oracle","score":0.7366365194320679},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.734952986240387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7096719145774841},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.6189002990722656},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5930899381637573},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5473964810371399},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4936996400356293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4745529294013977},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4602111876010895},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45813727378845215},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.44308263063430786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3414551019668579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24918147921562195}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7366365194320679},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.734952986240387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7096719145774841},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.6189002990722656},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5930899381637573},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5473964810371399},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4936996400356293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4745529294013977},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4602111876010895},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45813727378845215},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.44308263063430786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3414551019668579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24918147921562195},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.14778/3467861.3467862","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3467861.3467862","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2105.05782","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.05782","pdf_url":"https://arxiv.org/pdf/2105.05782","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3161100413","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2105.05782","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2105.05782","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2105.05782","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2105.05782","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.05782","pdf_url":"https://arxiv.org/pdf/2105.05782","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W782622320","https://openalex.org/W1496255159","https://openalex.org/W1576445103","https://openalex.org/W1830239953","https://openalex.org/W1899379166","https://openalex.org/W1971077223","https://openalex.org/W1973264045","https://openalex.org/W1974554406","https://openalex.org/W2038435918","https://openalex.org/W2056748234","https://openalex.org/W2060990051","https://openalex.org/W2066640191","https://openalex.org/W2092318232","https://openalex.org/W2106675345","https://openalex.org/W2107966677","https://openalex.org/W2120636855","https://openalex.org/W2183076570","https://openalex.org/W2237063244","https://openalex.org/W2301054524","https://openalex.org/W2342402489","https://openalex.org/W2399361902","https://openalex.org/W2552036965","https://openalex.org/W2613497313","https://openalex.org/W2614094703","https://openalex.org/W2740884862","https://openalex.org/W2755171335","https://openalex.org/W2769038130","https://openalex.org/W2788879826","https://openalex.org/W2797054769","https://openalex.org/W2798691796","https://openalex.org/W2799106927","https://openalex.org/W2803831948","https://openalex.org/W2883559670","https://openalex.org/W2947986740","https://openalex.org/W2950432447","https://openalex.org/W2962814365","https://openalex.org/W2962892929","https://openalex.org/W2962980889","https://openalex.org/W2963549845","https://openalex.org/W2963587548","https://openalex.org/W2964040819","https://openalex.org/W2964288644","https://openalex.org/W2970237991","https://openalex.org/W2970820939","https://openalex.org/W2971130537","https://openalex.org/W2993963457","https://openalex.org/W3012849342","https://openalex.org/W3029270599","https://openalex.org/W3046323564","https://openalex.org/W3098649723","https://openalex.org/W3105233790","https://openalex.org/W3176194034","https://openalex.org/W4297971002"],"related_works":["https://openalex.org/W2785373583","https://openalex.org/W2955439709","https://openalex.org/W2911757563","https://openalex.org/W2077989172","https://openalex.org/W2137162251","https://openalex.org/W3185024798","https://openalex.org/W2498925372","https://openalex.org/W2803831948","https://openalex.org/W3024808812","https://openalex.org/W2589548363","https://openalex.org/W3083582095","https://openalex.org/W1595562640","https://openalex.org/W178299396","https://openalex.org/W2118514472","https://openalex.org/W2946060932","https://openalex.org/W2902892638","https://openalex.org/W2309276681","https://openalex.org/W2626996263","https://openalex.org/W2187725551","https://openalex.org/W3168198363"],"abstract_inverted_index":{"Metric":[0],"based":[1],"comparison":[2,71,111],"operations":[3],"such":[4,19,82],"as":[5,20,83],"finding":[6,136],"maximum,":[7,137],"nearest":[8],"and":[9,24,47,54,124,162,179,188],"farthest":[10],"neighbor":[11,139],"are":[12,103],"fundamental":[13],"to":[14,88,93,105],"studying":[15],"various":[16,132,195],"clustering":[17,23,161],"techniques":[18,29,148,192],"k":[21,159],"-center":[22,160],"agglomerative":[25,163],"hierarchical":[26,164],"clustering.":[27,165],"These":[28],"crucially":[30],"rely":[31],"on":[32,194],"accurate":[33],"estimation":[34],"of":[35,44,69,190],"pairwise":[36,49],"distance":[37,77],"between":[38,78],"records.":[39],"However,":[40,96],"computing":[41],"exact":[42],"features":[43],"the":[45,67,75,79,147,186],"records,":[46],"their":[48,181],"distances":[50],"is":[51,98],"often":[52],"challenging,":[53],"sometimes":[55],"not":[56],"possible.":[57],"We":[58,113,166,184],"circumvent":[59],"this":[60,115,128],"challenge":[61],"by":[62,116],"leveraging":[63],"weak":[64],"supervision":[65],"in":[66],"form":[68],"a":[70,110,176],"oracle":[72],"that":[73,100,134,168],"compares":[74],"relative":[76],"queried":[80],"points":[81],"`Is":[84],"point":[85],"u":[86],"closer":[87,92],"v":[89],"or":[90],"w":[91],"x":[94],"?'.":[95],"it":[97],"possible":[99],"some":[101],"queries":[102],"easier":[104],"answer":[106],"than":[107],"others":[108],"using":[109],"oracle.":[112],"capture":[114],"introducing":[117],"two":[118],"different":[119],"noise":[120,143],"models":[121],"called":[122],"adversarial":[123],"probabilistic":[125],"noise.":[126],"In":[127],"paper,":[129],"we":[130,149,154],"study":[131],"problems":[133],"include":[135],"nearest/farthest":[138],"search":[140],"under":[141],"these":[142,152],"models.":[144],"Building":[145],"upon":[146],"develop":[150],"for":[151,158],"problems,":[153],"give":[155],"robust":[156],"algorithms":[157,170],"prove":[167],"our":[169,191],"achieve":[171],"good":[172],"approximation":[173],"guarantees":[174],"with":[175],"high":[177],"probability":[178],"analyze":[180],"query":[182],"complexity.":[183],"evaluate":[185],"effectiveness":[187],"efficiency":[189],"empirically":[193],"real-world":[196],"datasets.":[197]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}