{"id":"https://openalex.org/W2104522014","doi":"https://doi.org/10.1109/isit.2011.6033954","title":"Near-optimal rates for limited-delay universal lossy source coding","display_name":"Near-optimal rates for limited-delay universal lossy source coding","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2104522014","doi":"https://doi.org/10.1109/isit.2011.6033954","mag":"2104522014"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"conference-paper","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/A5041609088","display_name":"Andr\u00e1s Gy\u00f6rgy","orcid":"https://orcid.org/0000-0003-0586-4337"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Andras Gyorgy","raw_affiliation_strings":["Machine Learning Research Group Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Machine Learning Research Group Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I4210117195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077167635","display_name":"Gergely Neu","orcid":"https://orcid.org/0000-0001-6287-3796"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]},{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"government","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Gergely Neu","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University of Technology & Economics, Budapest, Hungary","Machine Learning Research Group Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology & Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Machine Learning Research Group Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260","https://openalex.org/I4210117195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2218","last_page":"2222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9919000267982483,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6744425892829895},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.634876549243927},{"id":"https://openalex.org/keywords/rate\u2013distortion-theory","display_name":"Rate\u2013distortion theory","score":0.6326426267623901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5895689129829407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5476884841918945},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5421678423881531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46696072816848755},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.449631929397583},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.42176276445388794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33796361088752747},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.33717307448387146},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3369910717010498},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28385603427886963},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1842339038848877},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1532616913318634}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6744425892829895},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.634876549243927},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.6326426267623901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5895689129829407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5476884841918945},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5421678423881531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46696072816848755},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.449631929397583},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.42176276445388794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33796361088752747},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.33717307448387146},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3369910717010498},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28385603427886963},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1842339038848877},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1532616913318634},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2011.6033954","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.434.1509","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.1509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.szit.bme.hu/~gya/publications/GyNe14.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.sztaki.hu:6638","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/6638/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W177617673","https://openalex.org/W1527666879","https://openalex.org/W1561073169","https://openalex.org/W1570963478","https://openalex.org/W2009487047","https://openalex.org/W2049518225","https://openalex.org/W2093825590","https://openalex.org/W2096352571","https://openalex.org/W2098123283","https://openalex.org/W2104522014","https://openalex.org/W2129962685","https://openalex.org/W2132652091","https://openalex.org/W2133472798","https://openalex.org/W2137154577","https://openalex.org/W2148649706","https://openalex.org/W2158455534","https://openalex.org/W2611627047","https://openalex.org/W3149261725","https://openalex.org/W4248175720","https://openalex.org/W6607198235"],"related_works":["https://openalex.org/W2964258959","https://openalex.org/W2547124190","https://openalex.org/W2385628723","https://openalex.org/W2888954728","https://openalex.org/W2552401318","https://openalex.org/W108076602","https://openalex.org/W3180760233","https://openalex.org/W4384342390","https://openalex.org/W3035703949","https://openalex.org/W4247601675"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,12,22,37,40,44,49,54,64,69,98,115,118,140,148,158,169,183,195],"problem":[3,170],"of":[4,8,32,43,48,61,86,104,157,171,186,189,199],"limited-delay":[5],"lossy":[6],"coding":[7,33,51],"individual":[9],"sequences.":[10],"Here":[11],"goal":[13],"is":[14,101,131,145,165,179],"to":[15,20,28,82,168,182],"design":[16],"(fixed-rate)":[17],"compression":[18,126],"schemes":[19,66],"minimize":[21],"normalized":[23,78],"expected":[24],"distortion":[25,42,79,99,129,177],"redundancy":[26,80,100,130,178],"relative":[27,81,181],"a":[29,59,125,135,155,190],"reference":[30,55,84],"class":[31,185],"schemes,":[34],"measured":[35],"as":[36],"difference":[38],"between":[39,117],"average":[41,161],"algorithm":[45],"and":[46,89,120,123],"that":[47,97],"best":[50,65],"scheme":[52,127],"in":[53,68,107],"class.":[56],"In":[57,110],"compressing":[58],"sequence":[60],"length":[62],"T,":[63],"available":[67],"literature":[70],"achieve":[71],"an":[72],"O(T":[73],"<sup":[74],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1/3</sup>":[76],")":[77],"finite":[83],"classes":[85],"limited":[87,90],"delay":[88],"memory.":[91],"It":[92],"has":[93],"also":[94,166],"been":[95],"shown":[96],"at":[102],"least":[103],"order":[105,200],"1=\u221aT":[106],"certain":[108],"cases.":[109],"this":[111],"paper":[112],"we":[113],"narrow":[114],"gap":[116],"upper":[119],"lower":[121,141,197],"bounds,":[122],"give":[124],"whose":[128],"O(\u221aln(T)=T":[132],"),":[133],"only":[134],"logarithmic":[136],"factor":[137],"larger":[138],"than":[139],"bound.":[142],"The":[143],"method":[144,164],"based":[146],"on":[147],"recently":[149],"introduced":[150],"Shrinking":[151],"Dartboard":[152],"prediction":[153],"algorithm,":[154],"variant":[156],"exponentially":[159],"weighted":[160],"prediction.":[162],"Our":[163],"applied":[167],"zero-delay":[172],"scalar":[173,187],"quantization,":[174],"where":[175],"O(ln(T)=\u221aT)":[176],"achieved":[180],"(infinite)":[184],"quantizers":[188],"given":[191],"rate,":[192],"almost":[193],"achieving":[194],"known":[196],"bound":[198],"1=\u221aT.":[201]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}