{"id":"https://openalex.org/W7135018887","doi":"https://doi.org/10.48550/arxiv.2603.10318","title":"Optimising two-block averaging kernels to speed up Markov chains","display_name":"Optimising two-block averaging kernels to speed up Markov chains","publication_year":2026,"publication_date":"2026-03-11","ids":{"openalex":"https://openalex.org/W7135018887","doi":"https://doi.org/10.48550/arxiv.2603.10318"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.10318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10318","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":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.2603.10318","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128879119","display_name":"Ryan J. Y. Lim","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lim, Ryan J. Y.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058187515","display_name":"Michael C. H. Choi","orcid":"https://orcid.org/0000-0003-0309-3217"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choi, Michael C. H.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5128879119"],"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":false,"primary_topic":{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.37059998512268066,"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"}},"topics":[{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.37059998512268066,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.2897000014781952,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.038100000470876694,"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/markov-chain","display_name":"Markov chain","score":0.695900022983551},{"id":"https://openalex.org/keywords/mixing","display_name":"Mixing (physics)","score":0.6306999921798706},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.553600013256073},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.5054000020027161},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4896000027656555},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.47589999437332153},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.4717000126838684},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.41530001163482666},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.695900022983551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6747999787330627},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.6306999921798706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.564300000667572},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.553600013256073},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.5054000020027161},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4896000027656555},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.47589999437332153},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4717000126838684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4487999975681305},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.41530001163482666},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.36890000104904175},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.3513000011444092},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.2957000136375427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29260000586509705},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.273499995470047},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C62100291","wikidata":"https://www.wikidata.org/wiki/Q1936288","display_name":"Total variation","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.10318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10318","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.10318","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.10318","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,35,93],"study":[1],"the":[2,11,25,30,43,48,51,63,67,121,134,138],"problem":[3,89],"of":[4,13,50,62,137],"selecting":[5],"optimal":[6,77,118],"two-block":[7,82],"partitions":[8],"to":[9,33,109,130],"accelerate":[10],"mixing":[12],"finite":[14],"Markov":[15],"chains":[16],"under":[17,120],"group-averaging":[18],"transformations.":[19],"The":[20],"main":[21],"objectives":[22,41,123],"considered":[23],"are":[24],"Kullback-Leibler":[26],"(KL)":[27],"divergence":[28],"and":[29,42,101,132],"Frobenius":[31,68],"distance":[32,129],"stationarity.":[34],"establish":[36],"explicit":[37,57],"connections":[38],"between":[39],"these":[40],"induced":[44],"projection":[45],"chain.":[46],"In":[47],"case":[49],"KL":[52],"divergence,":[53],"this":[54],"reduction":[55],"yields":[56],"decay":[58],"rates":[59],"in":[60],"terms":[61],"log-Sobolev":[64],"constant.":[65],"For":[66],"distance,":[69],"we":[70],"identify":[71],"a":[72,85],"Cheeger-type":[73],"functional":[74],"that":[75,117],"characterises":[76],"cuts.":[78],"This":[79],"formulation":[80],"recasts":[81],"selection":[83],"as":[84,105],"structured":[86],"combinatorial":[87,111],"optimisation":[88],"admitting":[90],"difference-of-submodular":[91],"decompositions.":[92],"further":[94],"propose":[95],"several":[96],"algorithmic":[97],"approximations,":[98],"including":[99],"majorisation-minimisation":[100],"coordinate":[102],"descent":[103],"schemes,":[104],"computationally":[106],"feasible":[107],"alternatives":[108],"exhaustive":[110],"search.":[112],"Our":[113],"numerical":[114],"experiments":[115],"reveal":[116],"cuts":[119],"two":[122],"can":[124],"substantially":[125],"reduce":[126],"total":[127],"variation":[128],"stationarity":[131],"demonstrate":[133],"practical":[135],"effectiveness":[136],"proposed":[139],"approximation":[140],"algorithms.":[141]},"counts_by_year":[],"updated_date":"2026-03-13T14:25:03.468858","created_date":"2026-03-13T00:00:00"}