On the public citation graph

Context Tree Switching

0 signed · 44 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1023/a:1007424614876openalex-snapshot
Tracking the Best Expert
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/dcc.1998.672217openalex-snapshot
Switching between two universal source coding algorithms
inferredcites →https://doi.org/10.1109/dcc.2010.36openalex-snapshot
Lossless Compression Based on the Sequence Memoizer
inferredcites →https://doi.org/10.1109/dcc.2012.39openalex-snapshot
Context Tree Switching
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/tcom.1984.1096090openalex-snapshot
Data Compression Using Adaptive Coding and Partial String Matching
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1613/jair.1491openalex-snapshot
On Prediction Using Variable Order Markov Models
inferredcites →https://doi.org/10.6100/ir559916openalex-snapshot
Weighting techniques in data compression : theory and algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-35506-6_35openalex-snapshot
On Ensemble Techniques for AIXI Approximation
inferred← citeshttps://doi.org/10.1007/springerreference_57918openalex-snapshot
Statistical Data Compression
inferred← citeshttps://doi.org/10.1016/j.neucom.2020.08.024openalex-snapshot
Random curiosity-driven exploration in deep reinforcement learning
inferred← citeshttps://doi.org/10.1073/pnas.1611835114openalex-snapshot
Overcoming catastrophic forgetting in neural networks
inferred← citeshttps://doi.org/10.1109/dcc.2013.38openalex-snapshot
Linear and Geometric Mixtures - Analysis
inferred← citeshttps://doi.org/10.1109/dcc.2013.40openalex-snapshot
Partition Tree Weighting
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/itw54588.2022.9965823openalex-snapshot
Bayesian Change-Point Detection via Context-Tree Weighting
inferred← citeshttps://doi.org/10.1109/tsp.2015.2458784openalex-snapshot
Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
inferred← citeshttps://doi.org/10.1111/rssb.12425openalex-snapshot
AMF: Aggregated Mondrian Forests for Online Learning
inferred← citeshttps://doi.org/10.12681/eadd/39222openalex-snapshot
Machine learning for intelligent agents
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9616openalex-snapshot
Agnostic System Identification for Monte Carlo Planning
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10850openalex-snapshot
Self-Correcting Models for Model-Based Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/aaai.v38i15.29575openalex-snapshot
Dynamic Knowledge Injection for AIXI Agents
inferred← citeshttps://doi.org/10.24963/ijcai.2017/344openalex-snapshot
Count-Based Exploration in Feature Space for Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0587openalex-snapshot
Partition Tree Weighting
inferred← citeshttps://doi.org/10.48550/arxiv.1302.2820openalex-snapshot
Linear and Geometric Mixtures - Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1305.1809openalex-snapshot
Cover Tree Bayesian Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1305.3671openalex-snapshot
Sparse Adaptive Dirichlet-Multinomial-like Processes
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
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01202openalex-snapshot
On Probability Estimation by Exponential Smoothing
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01310openalex-snapshot
Count-Based Exploration with Neural Density Models
inferred← citeshttps://doi.org/10.48550/arxiv.1712.01897openalex-snapshot
Online Learning with Gated Linear Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1801.09624openalex-snapshot
Learning the Reward Function for a Misspecified Model
inferred← citeshttps://doi.org/10.48550/arxiv.1805.12387openalex-snapshot
Agents and Devices: A Relative Definition of Agency
inferred← citeshttps://doi.org/10.7939/r3dj58t21openalex-snapshot
Fast, Scalable Algorithms for Reinforcement Learning in High Dimensional Domains
showing the first 30 of 31 · page through all 31
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.