{"id":"https://openalex.org/W7204868462","doi":"https://doi.org/10.48550/arxiv.2608.29491","title":"Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality","display_name":"Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality","publication_year":2026,"publication_date":"2026-08-30","ids":{"openalex":"https://openalex.org/W7204868462","doi":"https://doi.org/10.48550/arxiv.2608.29491"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.29491","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29491","pdf_url":"https://arxiv.org/pdf/2608.29491","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.29491","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054103414","display_name":"Ali Tajer","orcid":"https://orcid.org/0000-0002-3513-4135","observed_orcids":["https://orcid.org/0000-0002-3513-4135"]},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tajer, Ali","raw_affiliation_strings":["Computer, and Systems Engineering Department Rensselaer Polytechnic Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer, and Systems Engineering Department Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054103414"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T11443","display_name":"Advanced Statistical Process Monitoring","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11443","display_name":"Advanced Statistical Process Monitoring","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T13500","display_name":"Probability and Statistical Research","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.00019999999494757503,"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/quickest-change-detection","display_name":"quickest change detection","score":0.9629999995231628},{"id":"https://openalex.org/keywords/shiryaev-roberts-procedure","display_name":"Shiryaev-Roberts procedure","score":0.8500000238418579}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.9316999912261963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.67330002784729},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6061000227928162},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5241000056266785},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.44449999928474426},{"id":"https://openalex.org/C89128539","wikidata":"https://www.wikidata.org/wiki/Q1949963","display_name":"Statistic","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.39959999918937683},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C2778153524","wikidata":"https://www.wikidata.org/wiki/Q4241335","display_name":"Optimality criterion","level":2,"score":0.33390000462532043},{"id":"https://openalex.org/C80478641","wikidata":"https://www.wikidata.org/wiki/Q195771","display_name":"Sequential analysis","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25839999318122864},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.29491","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29491","pdf_url":"https://arxiv.org/pdf/2608.29491","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.29491","doi":"https://doi.org/10.48550/arxiv.2608.29491","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.29491","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.29491","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.29491","pdf_url":"https://arxiv.org/pdf/2608.29491","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204868462.pdf","grobid_xml":"https://content.openalex.org/works/W7204868462.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2137103582","https://openalex.org/W2473935990","https://openalex.org/W2511148020","https://openalex.org/W1552534071","https://openalex.org/W2949570816","https://openalex.org/W2953018226","https://openalex.org/W7095167999","https://openalex.org/W2124196232","https://openalex.org/W7207776166","https://openalex.org/W3003617883"],"abstract_inverted_index":{"Although":[0,101],"Pollak's":[1,85],"minimax":[2,86,122,219],"formulation":[3,103],"is":[4,76,104,168,175],"one":[5],"of":[6,63,84,110,118,182,225],"the":[7,15,28,55,60,82,108,119,145,173,179,188,194,198,204,214],"central":[8],"frameworks":[9],"in":[10,126],"quickest":[11],"change":[12,70,226],"detection":[13],"(QCD),":[14],"strongest":[16],"general":[17,56],"optimality":[18],"results":[19,37],"available":[20,44],"for":[21,38,46,68,132,221],"it":[22,106],"are":[23,150],"predominantly":[24],"\\emph{asymptotic},":[25],"applying":[26],"as":[27,91,203],"average":[29],"run-length-to-false-alarm":[30],"constraint,":[31],"$\u03b3$,":[32],"tends":[33],"to":[34,144],"infinity.":[35],"Exact":[36],"finite":[39],"$\u03b3$":[40],"have":[41],"previously":[42],"been":[43],"only":[45],"special":[47,206],"models":[48],"or":[49],"restricted":[50],"regimes.":[51],"This":[52,124],"paper":[53],"addresses":[54],"finite-$\u03b3$":[57,120],"problem":[58],"over":[59,88,97,178],"complete":[61],"class":[62,181,224],"randomized,":[64,183],"history-dependent":[65,184],"stopping":[66,89,135,185],"rules":[67,136,149],"i.i.d.":[69],"models.":[71,227],"The":[72,147],"key":[73],"technical":[74],"development":[75],"a":[77,129,153,171,210,222],"\\emph{survival-process":[78],"representation}":[79],"that":[80],"recasts":[81],"optimization":[83,96,174],"criterion":[87],"times":[90],"an":[92,111,115],"equivalent":[93],"linear":[94],"variational":[95],"admissible":[98],"survival":[99],"processes.":[100],"this":[102,166],"infinite-dimensional,":[105],"establishes":[107],"existence":[109],"optimizer":[112],"and":[113,163,187],"provides":[114,128],"exact":[116,218],"characterization":[117],"Pollak":[121],"value.":[123],"characterization,":[125],"turn,":[127],"principled":[130],"basis":[131],"constructing":[133],"computable":[134],"whose":[137],"performance":[138],"can":[139],"be":[140],"made":[141],"arbitrarily":[142],"close":[143],"optimum.":[146],"resulting":[148],"driven":[151],"by":[152],"recursively":[154],"updated":[155],"weighted":[156],"likelihood-ratio":[157,211],"statistic":[158],"with":[159],"generally":[160],"time-varying":[161],"injections":[162],"boundaries.":[164],"Importantly,":[165],"structure":[167],"not":[169],"imposed":[170],"priori:":[172],"carried":[176],"out":[177],"full":[180],"rules,":[186],"Shiryaev--Roberts":[189,200],"form":[190],"emerges":[191],"naturally":[192],"from":[193],"solution.":[195],"In":[196],"particular,":[197],"classical":[199],"recursion":[201],"arises":[202],"time-homogeneous":[205],"case.":[207],"Finally,":[208],"under":[209],"floor":[212],"condition,":[213],"framework":[215],"yields":[216],"closed-form":[217],"solutions":[220],"nontrivial":[223]},"counts_by_year":[],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2026-09-02T00:00:00"}