{"id":"https://openalex.org/W4415367830","doi":"https://doi.org/10.1109/isit63088.2025.11195403","title":"Optimal Bounded-Influence Procedure for Robust Sequential Change-Point Detection","display_name":"Optimal Bounded-Influence Procedure for Robust Sequential Change-Point Detection","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367830","doi":"https://doi.org/10.1109/isit63088.2025.11195403"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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/A5101944948","display_name":"Ruizhi Zhang","orcid":"https://orcid.org/0000-0002-1317-0063"},"institutions":[{"id":"https://openalex.org/I165733156","display_name":"University of Georgia","ror":"https://ror.org/00te3t702","country_code":"US","type":"education","lineage":["https://openalex.org/I165733156"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ruizhi Zhang","raw_affiliation_strings":["University of Georgia,Department of Statistics"],"affiliations":[{"raw_affiliation_string":"University of Georgia,Department of Statistics","institution_ids":["https://openalex.org/I165733156"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101944948"],"corresponding_institution_ids":["https://openalex.org/I165733156"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3750078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.909500002861023,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.909500002861023,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T10876","display_name":"Fault Detection and Control Systems","score":0.9074000120162964,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7871000170707703},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6280999779701233},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.6194000244140625},{"id":"https://openalex.org/keywords/false-alarm","display_name":"False alarm","score":0.6047000288963318},{"id":"https://openalex.org/keywords/constant-false-alarm-rate","display_name":"Constant false alarm rate","score":0.53329998254776},{"id":"https://openalex.org/keywords/statistic","display_name":"Statistic","score":0.42489999532699585},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.39559999108314514},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.3619999885559082}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7871000170707703},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6280999779701233},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.6194000244140625},{"id":"https://openalex.org/C2776836416","wikidata":"https://www.wikidata.org/wiki/Q1364844","display_name":"False alarm","level":2,"score":0.6047000288963318},{"id":"https://openalex.org/C77052588","wikidata":"https://www.wikidata.org/wiki/Q644307","display_name":"Constant false alarm rate","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48660001158714294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.484499990940094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4440999925136566},{"id":"https://openalex.org/C89128539","wikidata":"https://www.wikidata.org/wiki/Q1949963","display_name":"Statistic","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37220001220703125},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C739882","wikidata":"https://www.wikidata.org/wiki/Q3560506","display_name":"Anomaly detection","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C80478641","wikidata":"https://www.wikidata.org/wiki/Q195771","display_name":"Sequential analysis","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C67226441","wikidata":"https://www.wikidata.org/wiki/Q1665389","display_name":"Robust statistics","level":3,"score":0.31700000166893005},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C2779119184","wikidata":"https://www.wikidata.org/wiki/Q294350","display_name":"ALARM","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.28450000286102295},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C86426650","wikidata":"https://www.wikidata.org/wiki/Q7452504","display_name":"Sequential estimation","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195403","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195403","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6734435470","display_name":null,"funder_award_id":"ECCS-2236565","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W203730404","https://openalex.org/W1981904416","https://openalex.org/W2004094275","https://openalex.org/W2018319586","https://openalex.org/W2045067839","https://openalex.org/W2046033161","https://openalex.org/W2136915286","https://openalex.org/W2166426063","https://openalex.org/W2518887247","https://openalex.org/W2989891887","https://openalex.org/W3205763908","https://openalex.org/W4249116379","https://openalex.org/W4388485935"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,52,93,144],"study":[4],"the":[5,21,25,43,95,106,112,118,127,133,146,149,153],"problem":[6],"of":[7,20,45,57,152],"robust":[8,28,58,97,155],"sequential":[9,47],"change-point":[10],"detection":[11,49,59,90,108,150],"under":[12],"Huber's":[13],"gross":[14],"error":[15],"model.":[16],"We":[17],"incorporate":[18],"ideas":[19],"influence":[22,39,66,75,121],"function":[23,40,76,122],"from":[24],"classical":[26],"offline":[27],"statistics":[29],"literature":[30],"and":[31,61,117,138,148],"propose":[32,53],"a":[33,54,140],"new":[34],"definition":[35],"called":[36],"false":[37,64,113,119],"alarm":[38,65,114,120],"to":[41,111],"quantify":[42],"robustness":[44,147],"general":[46,55,102],"change":[48],"procedures.":[50],"Then,":[51],"family":[56,103],"procedures":[60],"derive":[62],"their":[63,89],"function.":[67],"The":[68],"result":[69],"shows":[70],"they":[71],"all":[72],"have":[73,85],"bounded":[74],"which":[77],"implies":[78],"any":[79],"single":[80],"arbitrary":[81],"outlier":[82],"will":[83],"only":[84],"limit":[86],"impact":[87],"on":[88,132],"performance.":[91],"Furthermore,":[92],"construct":[94],"optimal":[96,128,154],"bounded-influence":[98,156],"procedure":[99,129,157],"in":[100],"that":[101,104],"has":[105,139],"smallest":[107],"delay":[109],"subject":[110],"rate":[115],"constraint":[116],"constraint.":[123],"It":[124],"turns":[125],"out":[126],"is":[130],"based":[131],"truncated":[134],"likelihood":[135],"ratio":[136],"statistic":[137],"simple":[141],"form.":[142],"Finally,":[143],"demonstrate":[145],"efficiency":[151],"through":[158],"extensive":[159],"simulations.":[160]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}