On the public citation graph
Partition Tree Weighting
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s11222-006-8450-8openalex-snapshot
Exact and efficient Bayesian inference for multiple changepoint problems
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1007595032382openalex-snapshot
Derandomizing Stochastic Prediction Strategies
inferredcites →https://doi.org/10.1080/01621459.1998.10473808openalex-snapshot
Time-Dependent Spectral Analysis of Nonstationary Time Series
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.556608openalex-snapshot
Coding for a binary independent piecewise-identically-distributed source
inferredcites →https://doi.org/10.1109/18.771150openalex-snapshot
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
inferredcites →https://doi.org/10.1109/dcc.1997.582019openalex-snapshot
A corpus for the evaluation of lossless compression algorithms
inferredcites →https://doi.org/10.1109/icassp.2011.5946893openalex-snapshot
Sparse graphical modeling of piecewise-stationary time series
inferredcites →https://doi.org/10.1109/isit.1997.612983openalex-snapshot
Live-and-die coding for binary piecewise i.i.d. sources
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.2012.2209627openalex-snapshot
Efficient Tracking of Large Classes of Experts
inferredcites →https://doi.org/10.1145/1553374.1553425openalex-snapshot
Efficient learning algorithms for changing environments
inferredcites →https://doi.org/10.1145/267460.267473openalex-snapshot
Derandomizing stochastic prediction strategies
inferredcites →https://doi.org/10.1198/016214505000000745openalex-snapshot
Structural Break Estimation for Nonstationary Time Series Models
inferredcites →https://doi.org/10.48550/arxiv.0710.3742openalex-snapshot
Bayesian Online Changepoint Detection
inferredcites →https://doi.org/10.48550/arxiv.0802.2015openalex-snapshot
Combining Expert Advice Efficiently
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/springerreference_57918openalex-snapshot
Statistical Data Compression
inferred← citeshttps://doi.org/10.1109/dcc.2015.27openalex-snapshot
On Probability Estimation via Relative Frequencies and Discount
inferred← citeshttps://doi.org/10.1109/dcc.2015.36openalex-snapshot
On Probability Estimation by Exponential Smoothing
inferred← citeshttps://doi.org/10.1109/dcc.2018.00033openalex-snapshot
Generalized Probability Smoothing
inferred← citeshttps://doi.org/10.1109/dcc.2018.00035openalex-snapshot
Universal Compression of Piecewise i.i.d. Sources
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518189openalex-snapshot
Revisiting Context-Tree Weighting for Bayesian Inference
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965823openalex-snapshot
Bayesian Change-Point Detection via Context-Tree Weighting
inferred← citeshttps://doi.org/10.1214/17-ejs1379siopenalex-snapshot
Online learning for changing environments using coin betting
inferred← citeshttps://doi.org/10.1609/aaai.v38i15.29575openalex-snapshot
Dynamic Knowledge Injection for AIXI Agents
inferred← citeshttps://doi.org/10.3390/e28060596openalex-snapshot
Algorithmic Compression via Pretrained Neural Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1311.1723openalex-snapshot
On Probability Estimation via Relative Frequencies and Discount
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6863openalex-snapshot
Online Learning of k-CNF Boolean Functions
showing the first 13 of 14 · page through all 14
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.