{"id":"https://openalex.org/W4289655368","doi":"https://doi.org/10.1109/isit50566.2022.9834702","title":"Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds","display_name":"Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655368","doi":"https://doi.org/10.1109/isit50566.2022.9834702"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834702","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5029262439","display_name":"Ruida Zhou","orcid":"https://orcid.org/0000-0002-8855-2031"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ruida Zhou","raw_affiliation_strings":["Texas A&M University,Department of Electrical & Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical & Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100675045","display_name":"Chao Tian","orcid":"https://orcid.org/0000-0001-8752-6141"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Tian","raw_affiliation_strings":["Texas A&M University,Department of Electrical & Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical & Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006265534","display_name":"Tie Liu","orcid":"https://orcid.org/0000-0002-6412-2432"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tie Liu","raw_affiliation_strings":["Texas A&M University,Department of Electrical & Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical & Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5029262439"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.3138,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.50241162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"690","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987000226974487,"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/T11901","display_name":"Bayesian Methods and Mixture Models","score":0.9976000189781189,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.996399998664856,"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/chaining","display_name":"Chaining","score":0.823529839515686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5992437601089478},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.537828266620636},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5315311551094055},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4856470823287964},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47750967741012573},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44199004769325256},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4232461750507355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4183283746242523},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4127099812030792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3883894383907318},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15933528542518616}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.823529839515686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5992437601089478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.537828266620636},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5315311551094055},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4856470823287964},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47750967741012573},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44199004769325256},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4232461750507355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4183283746242523},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4127099812030792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3883894383907318},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15933528542518616},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834702","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834702","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W586055246","https://openalex.org/W2151028883","https://openalex.org/W2151252184","https://openalex.org/W2158643165","https://openalex.org/W2170966036","https://openalex.org/W2258658829","https://openalex.org/W2617539226","https://openalex.org/W2910589063","https://openalex.org/W2914671377","https://openalex.org/W2962702650","https://openalex.org/W3019669224","https://openalex.org/W3024982789","https://openalex.org/W3081512036","https://openalex.org/W3093959689","https://openalex.org/W3100231902","https://openalex.org/W3106002857","https://openalex.org/W3110364518","https://openalex.org/W3123190877","https://openalex.org/W3137695714","https://openalex.org/W3176801395","https://openalex.org/W3196637718","https://openalex.org/W4236362309","https://openalex.org/W4287371499","https://openalex.org/W4288028699","https://openalex.org/W4289655368","https://openalex.org/W4293774175","https://openalex.org/W4300167521","https://openalex.org/W6692563690","https://openalex.org/W6738074204","https://openalex.org/W6751754507","https://openalex.org/W6759041096","https://openalex.org/W6763485134","https://openalex.org/W6767717172","https://openalex.org/W6772932235","https://openalex.org/W6775928558"],"related_works":["https://openalex.org/W2536200976","https://openalex.org/W2388420286","https://openalex.org/W3003692200","https://openalex.org/W1971753667","https://openalex.org/W2052275678","https://openalex.org/W2970356471","https://openalex.org/W2038812594","https://openalex.org/W2136053165","https://openalex.org/W1997271576","https://openalex.org/W1772550183"],"abstract_inverted_index":{"We":[0,101],"propose":[1,47],"a":[2,42,48,124,143],"new":[3],"approach":[4,28,50,71],"to":[5,15,82,91],"apply":[6],"the":[7,17,26,53,77,106,116,136,150],"chaining":[8,125,151],"technique":[9],"in":[10,67],"conjunction":[11],"with":[12,56],"information-theoretic":[13],"measures":[14],"bound":[16,126],"generalization":[18],"error":[19],"of":[20,41,88,108,118,138],"machine":[21],"learning":[22],"algorithms.":[23],"Different":[24],"from":[25],"deterministic":[27,78],"previously":[29],"proposed":[30],"by":[31,62],"Asadi":[32],"et":[33],"al.,":[34],"which":[35],"is":[36],"based":[37],"on":[38],"hierarchical":[39,54],"partitions":[40,55],"bounded":[43],"metric":[44,84],"space,":[45,85],"we":[46,122,141],"stochastic":[49,144],"that":[51,127,146],"replaces":[52],"an":[57,129],"abstract":[58],"Markov":[59],"model":[60],"inspired":[61],"successive":[63],"refinement":[64],"source":[65],"coding":[66],"information":[68],"theory.":[69],"Our":[70],"has":[72],"three":[73],"main":[74],"benefits":[75,104],"over":[76,132,149],"approach:":[79],"1)":[80],"applicability":[81],"unbounded":[83],"2)":[86],"feasibility":[87],"subsequent":[89],"analysis":[90],"yield":[92],"explicit":[93],"bounds,":[94],"and":[95,112],"3)":[96],"increased":[97],"flexibility":[98],"for":[99,135],"optimization.":[100],"illustrate":[102],"these":[103],"through":[105],"problems":[107],"estimating":[109,119],"Gaussian":[110,120],"mean":[111],"phase":[113,139],"retrieval.":[114],"For":[115],"problem":[117,137],"mean,":[121],"derive":[123],"provides":[128],"order-wise":[130],"improvement":[131],"previous":[133],"results;":[134],"retrieval,":[140],"construct":[142],"chain":[145],"allows":[147],"optimization":[148],"parameter.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}