{"id":"https://openalex.org/W6929369307","doi":"https://doi.org/10.48550/arxiv.2507.02394","title":"On the Adversarial Robustness of Online Importance Sampling","display_name":"On the Adversarial Robustness of Online Importance Sampling","publication_year":2025,"publication_date":"2025-07-03","ids":{"openalex":"https://openalex.org/W6929369307","doi":"https://doi.org/10.48550/arxiv.2507.02394"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2507.02394","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.02394","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2507.02394","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kenneth-Mordoch, Yotam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth-Mordoch, Yotam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Sapir, Shay","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sapir, Shay","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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":true,"primary_topic":{"id":"https://openalex.org/T11013","display_name":"Skin Protection and Aging","score":0.11339999735355377,"subfield":{"id":"https://openalex.org/subfields/2708","display_name":"Dermatology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11013","display_name":"Skin Protection and Aging","score":0.11339999735355377,"subfield":{"id":"https://openalex.org/subfields/2708","display_name":"Dermatology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T13206","display_name":"Neonatal skin health care","score":0.08950000256299973,"subfield":{"id":"https://openalex.org/subfields/3616","display_name":"Speech and Hearing"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T11964","display_name":"Pregnancy and Medication Impact","score":0.027799999341368675,"subfield":{"id":"https://openalex.org/subfields/2739","display_name":"Public Health, Environmental and Occupational Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6359000205993652},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6083999872207642},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5590999722480774},{"id":"https://openalex.org/keywords/data-stream","display_name":"Data stream","score":0.5256999731063843},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.49939998984336853},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.4832000136375427},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.476500004529953},{"id":"https://openalex.org/keywords/data-stream-mining","display_name":"Data stream mining","score":0.46880000829696655}],"concepts":[{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6359000205993652},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6083999872207642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.599399983882904},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5590999722480774},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.5256999731063843},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.49939998984336853},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.4832000136375427},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.476500004529953},{"id":"https://openalex.org/C89198739","wikidata":"https://www.wikidata.org/wiki/Q3079880","display_name":"Data stream mining","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.43470001220703125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4339999854564667},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4318999946117401},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4171999990940094},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37299999594688416},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3179999887943268},{"id":"https://openalex.org/C2986087404","wikidata":"https://www.wikidata.org/wiki/Q15946010","display_name":"Online learning","level":2,"score":0.31369999051094055},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31360000371932983},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.29600000381469727},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2786000072956085},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2507.02394","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.02394","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":"doi:10.48550/arxiv.2507.02394","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.02394","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,53,59,99,148,152],"adversarial-robustness":[4,100],"of":[5,23,61,69,101,129,138,151],"importance-sampling":[6,70,84,134],"(aka":[7],"sensitivity":[8],"sampling);":[9],"a":[10,104,136],"useful":[11],"algorithmic":[12],"technique":[13],"that":[14,43,68,79],"samples":[15],"elements":[16,57,130],"with":[17,37],"probabilities":[18],"proportional":[19],"to":[20,144,161],"some":[21],"measure":[22],"their":[24,139],"importance.":[25],"A":[26],"streaming":[27,80],"or":[28],"online":[29,102,133,164],"algorithm":[30,50],"is":[31],"called":[32],"adversarially-robust":[33,163],"if":[34],"it":[35,91],"succeeds":[36],"high":[38],"probability":[39],"on":[40,48,83,98],"input":[41,125],"streams":[42],"may":[44,85],"change":[45],"adaptively":[46],"depending":[47],"previous":[49],"outputs.":[51],"Unfortunately,":[52],"dependence":[54],"between":[55],"stream":[56,128],"breaks":[58],"analysis":[60],"most":[62],"randomized":[63],"algorithms,":[64],"and":[65,112,173],"in":[66],"particular":[67],"algorithms.":[71],"Previously,":[72],"Braverman":[73],"et":[74],"al.":[75],"[NeurIPS":[76],"2021]":[77],"suggested":[78],"algorithms":[81,165],"based":[82],"be":[86],"adversarially-robust;":[87],"however,":[88],"they":[89],"proved":[90],"only":[92],"for":[93,166],"well-behaved":[94],"inputs.":[95],"We":[96,156],"focus":[97],"importance-sampling,":[103],"natural":[105],"variant":[106],"where":[107],"sampling":[108],"decisions":[109],"are":[110],"irrevocable":[111],"made":[113],"as":[114,124],"data":[115],"arrives.":[116],"Our":[117],"main":[118],"technical":[119],"result":[120,160],"shows":[121],"that,":[122],"given":[123],"an":[126],"adaptive":[127],"$x_1,\\ldots,x_T\\in":[131],"\\mathbb{R}_+$,":[132],"maintains":[135],"$(1\\pm\u03b5)$-approximation":[137],"sum":[140],"while":[141],"matching":[142],"(up":[143],"lower":[145],"order":[146],"terms)":[147],"storage":[149],"guarantees":[150],"oblivious":[153],"(non-adaptive)":[154],"case.":[155],"then":[157],"apply":[158],"this":[159],"develop":[162],"two":[167],"fundamental":[168],"problems:":[169],"hypergraph":[170],"cut":[171],"sparsification":[172],"$\\ell_p$":[174],"subspace":[175],"embedding.":[176]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}