Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources
| dc.contributor.author | Vellambi, Badri | |
| dc.contributor.author | Hutter, Marcus | |
| dc.coverage.spatial | Vail, USA | |
| dc.date.accessioned | 2024-01-16T23:17:20Z | |
| dc.date.created | June 17-22 2018 | |
| dc.date.issued | 2018 | |
| dc.date.updated | 2022-10-02T07:16:21Z | |
| dc.description.abstract | This work investigates the convergence rate of learning the stationary distribution of finite-alphabet stationary ergodic sources using a binarized context-tree weighting approach. The binarized context-tree weighting (overline mathbf Cmathbf Tmathbf W) algorithm estimates the stationary distribution of a symbol as a product of conditional distributions of each component bit, which are determined in a sequential manner using the well known binary context-tree weighting method. We establish that overline mathbf Cmathbf Tmathbf W algorithm is a consistent estimator of the stationary distribution, and that the worst-case L- 1 -prediction error between the overline pmb text CTW and frequency estimates using n source symbols each of which when binarized consists of k > 1 bits decays as Θleft(sqrt 2 kfrac log n nright) · | en_AU |
| dc.description.sponsorship | This work was supported by the Australian Research Council Discovery Projects DP120100950 and DP15010459 | en_AU |
| dc.format.mimetype | application/pdf | en_AU |
| dc.identifier.isbn | 978-1-5386-4780-6 | en_AU |
| dc.identifier.uri | http://hdl.handle.net/1885/311517 | |
| dc.language.iso | en_AU | en_AU |
| dc.provenance | https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/..."Authors may share or post their accepted article in the following locations: Author’s employer’s website or institutional repository" from the publisher site (as at 18 Jan 2024). © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works | |
| dc.publisher | IEEE | en_AU |
| dc.relation | http://purl.org/au-research/grants/arc/DP120100950 | en_AU |
| dc.relation | http://purl.org/au-research/grants/arc/DP150104590 | en_AU |
| dc.relation.ispartofseries | 2018 IEEE International Symposium on Information Theory, ISIT 2018 | en_AU |
| dc.rights | © 2018 IEEE | en_AU |
| dc.source | IEEE International Symposium on Information Theory - Proceedings | en_AU |
| dc.title | Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary Sources | en_AU |
| dc.type | Conference paper | en_AU |
| dcterms.accessRights | Open Access | |
| local.bibliographicCitation.lastpage | 735 | en_AU |
| local.bibliographicCitation.startpage | 731 | en_AU |
| local.contributor.affiliation | Vellambi Ravisankar, Badri Narayanan, College of Engineering and Computer Science, ANU | en_AU |
| local.contributor.affiliation | Hutter, Marcus, College of Engineering and Computer Science, ANU | en_AU |
| local.contributor.authoruid | Vellambi Ravisankar, Badri Narayanan, u1038607 | en_AU |
| local.contributor.authoruid | Hutter, Marcus, u4350841 | en_AU |
| local.description.notes | Imported from ARIES | en_AU |
| local.description.refereed | Yes | |
| local.identifier.absfor | 461301 - Coding, information theory and compression | en_AU |
| local.identifier.ariespublication | a383154xPUB10646 | en_AU |
| local.identifier.doi | 10.1109/ISIT.2018.8437737 | en_AU |
| local.identifier.scopusID | 2-s2.0-85052486632 | |
| local.publisher.url | https://www.ieee.org/ | en_AU |
| local.type.status | Accepted Version | en_AU |
Downloads
Original bundle
1 - 1 of 1
Loading...
- Name:
- Convergence of Binarized_AAM.pdf
- Size:
- 636.19 KB
- Format:
- Adobe Portable Document Format