On the public citation graph

Optimal sequential probability assignment for individual sequences

0 signed · 112 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.1016/0005-1098(78)90005-5openalex-snapshot
Modeling by shortest data description
inferredcites →https://doi.org/10.1016/0378-3758(94)90092-2openalex-snapshot
Predictive stochastic complexity and model estimation for finite-state processes
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1109/18.108250openalex-snapshot
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
inferredcites →https://doi.org/10.1109/18.119700openalex-snapshot
A note on the competitive optimality of the Huffman code
inferredcites →https://doi.org/10.1109/18.133269openalex-snapshot
Gambling using a finite state machine
inferredcites →https://doi.org/10.1109/18.135641openalex-snapshot
A sequential algorithm for the universal coding of finite memory sources
inferredcites →https://doi.org/10.1109/18.265504openalex-snapshot
On the minimum description length principle for sources with piecewise constant parameters
inferredcites →https://doi.org/10.1109/18.61133openalex-snapshot
On the competitive optimality of Huffman codes
inferredcites →https://doi.org/10.1109/isit.1993.748374openalex-snapshot
Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources
inferredcites →https://doi.org/10.1109/tit.1973.1055092openalex-snapshot
Universal noiseless coding
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1109/tit.1981.1056282openalex-snapshot
Universal modeling and coding
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.1981.1056355openalex-snapshot
Efficient universal noiseless source codes
inferredcites →https://doi.org/10.1109/tit.1983.1056645openalex-snapshot
A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1983.1056652openalex-snapshot
Minimax noiseless universal coding for Markov sources
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
inferredcites →https://doi.org/10.1112/blms/23.1.106openalex-snapshot
STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY
inferredcites →https://doi.org/10.1214/aoms/1177693067openalex-snapshot
Asymptotically Optimal Tests for Finite Markov Chains
inferredcites →https://doi.org/10.1214/aos/1176346150openalex-snapshot
A Universal Prior for Integers and Estimation by Minimum Description Length
inferredcites →https://doi.org/10.1214/aos/1176350051openalex-snapshot
Stochastic Complexity and Modeling
inferredcites →https://doi.org/10.2307/2981683openalex-snapshot
Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
inferredcites →https://doi.org/10.2307/2982382openalex-snapshot
The Theory of Graphs and its Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/047174882x.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_169openalex-snapshot
Tight worst-case loss bounds for predicting with expert advice
inferred← citeshttps://doi.org/10.1007/978-1-4612-1524-0_6openalex-snapshot
Worst Case Prediction over Sequences under Log Loss
inferred← citeshttps://doi.org/10.1016/0378-3758(94)90092-2openalex-snapshot
Predictive stochastic complexity and model estimation for finite-state processes
inferred← citeshttps://doi.org/10.1016/j.ijforecast.2025.07.009openalex-snapshot
The Bayesian context trees state space model for time series modelling and forecasting
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.014openalex-snapshot
Sensor networks: From dependence analysis via matroid bases to online synthesis
inferred← citeshttps://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferred← citeshttps://doi.org/10.1023/a:1007396710653openalex-snapshot
Predicting Nearly As Well As the Best Pruning of a Decision Tree
inferred← citeshttps://doi.org/10.1023/a:1007670818503openalex-snapshot
An Efficient Extension to Mixture Techniques for Prediction and Decision Trees
inferred← citeshttps://doi.org/10.1023/a:1010848128995openalex-snapshot
Worst-Case Bounds for the Logarithmic Loss of Predictors
inferred← citeshttps://doi.org/10.1109/18.382011openalex-snapshot
A universal finite memory source
inferred← citeshttps://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferred← citeshttps://doi.org/10.1109/18.382017openalex-snapshot
A strong version of the redundancy-capacity theorem of universal coding
inferred← citeshttps://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
inferred← citeshttps://doi.org/10.1109/18.532877openalex-snapshot
Hierarchical universal coding
inferred← citeshttps://doi.org/10.1109/18.532891openalex-snapshot
Context weighting for general finite-context sources
inferred← citeshttps://doi.org/10.1109/18.532892openalex-snapshot
Nearest neighbor decoding for additive non-Gaussian noise channels
inferred← citeshttps://doi.org/10.1109/18.556608openalex-snapshot
Coding for a binary independent piecewise-identically-distributed source
inferred← citeshttps://doi.org/10.1109/18.623176openalex-snapshot
Sequential prediction and ranking in universal context modeling and data compression
inferred← citeshttps://doi.org/10.1109/18.705569openalex-snapshot
Sequential prediction of individual sequences under general loss functions
inferred← citeshttps://doi.org/10.1109/18.720534openalex-snapshot
Universal prediction
inferred← citeshttps://doi.org/10.1109/18.720546openalex-snapshot
The method of types [information theory]
inferred← citeshttps://doi.org/10.1109/18.817520openalex-snapshot
Coding of sources with two-sided geometric distributions and unknown parameters
inferred← citeshttps://doi.org/10.1109/18.825803openalex-snapshot
Asymptotic minimax regret for data compression, gambling, and prediction
inferred← citeshttps://doi.org/10.1109/18.887856openalex-snapshot
Asymptotic average redundancy of Huffman (and other) block codes
inferred← citeshttps://doi.org/10.1109/18.930923openalex-snapshot
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence
inferred← citeshttps://doi.org/10.1109/18.945240openalex-snapshot
Universal prediction of individual binary sequences in the presence of noise
inferred← citeshttps://doi.org/10.1109/83.491334openalex-snapshot
Applications of universal context modeling to lossless compression of gray-scale images
inferred← citeshttps://doi.org/10.1109/dcc.1995.515498openalex-snapshot
Universal coding for arbitrarily varying sources and for hierarchies of model classes
inferred← citeshttps://doi.org/10.1109/dcc.1998.672225openalex-snapshot
Universal data compression and linear prediction
inferred← citeshttps://doi.org/10.1109/embc58623.2025.11253642openalex-snapshot
Sequential Probability Assignment for Outlier Detection in Heartbeat Timings
inferred← citeshttps://doi.org/10.1109/globalsip.2014.7032133openalex-snapshot
Performance of parallel two-pass MDL context tree algorithm
inferred← citeshttps://doi.org/10.1109/icip.1996.560829openalex-snapshot
Modeling and low-complexity adaptive coding for image prediction residuals
inferred← citeshttps://doi.org/10.1109/isit.1994.394635openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferred← citeshttps://doi.org/10.1109/isit.2000.866371openalex-snapshot
Universal linear least-squares prediction
inferred← citeshttps://doi.org/10.1109/isit.2000.866668openalex-snapshot
Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes
inferred← citeshttps://doi.org/10.1109/isit.2003.1228095openalex-snapshot
On competitive prediction and its relation to rate-distortion theory and to channel capacity theory
inferred← citeshttps://doi.org/10.1109/isit.2004.1365258openalex-snapshot
On universal types
inferred← citeshttps://doi.org/10.1109/isit.2005.1523440openalex-snapshot
Universal delay-limited simulation
inferred← citeshttps://doi.org/10.1109/isit.2006.262011openalex-snapshot
Lower Limits of Discrete Universal Denoising
inferred← citeshttps://doi.org/10.1109/isit.2007.4557336openalex-snapshot
Type Classes of Tree Models
inferred← citeshttps://doi.org/10.1109/isit.2010.5513624openalex-snapshot
Universal estimation of directed information
inferred← citeshttps://doi.org/10.1109/isit.2011.6033793openalex-snapshot
Results on the redundancy of universal compression for finite-length sequences
inferred← citeshttps://doi.org/10.1109/isit.2012.6283541openalex-snapshot
Perfectly secure encryption of individual sequences
inferred← citeshttps://doi.org/10.1109/isit.2013.6620303openalex-snapshot
Twice-universal fixed to variable-length random number generators for finite memory sources
inferred← citeshttps://doi.org/10.1109/isit.2014.6875156openalex-snapshot
A parallel two-pass MDL context tree algorithm for universal source coding
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206850openalex-snapshot
Time Series Analysis with Bayesian Context Trees: Classical Asymptotics and Finite-n Bounds
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195681openalex-snapshot
A Family of Lz78-Based Universal Sequential Probability Assignments
inferred← citeshttps://doi.org/10.1109/itw.2008.4578664openalex-snapshot
Enumerative coding for tree sources
inferred← citeshttps://doi.org/10.1109/jstsp.2015.2403800openalex-snapshot
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
inferred← citeshttps://doi.org/10.1109/jstsp.2015.2496911openalex-snapshot
Online Optimization Under Adversarial Perturbations
inferred← citeshttps://doi.org/10.1109/sam.2000.878034openalex-snapshot
Multi-stage adaptive signal processing algorithms
inferred← citeshttps://doi.org/10.1109/tbc.2012.2186728openalex-snapshot
Segmentation of Source Symbols for Adaptive Arithmetic Coding
inferred← citeshttps://doi.org/10.1109/tit.2002.1003838openalex-snapshot
Hidden Markov processes
inferred← citeshttps://doi.org/10.1109/tit.2002.1013136openalex-snapshot
On delayed prediction of individual sequences
inferred← citeshttps://doi.org/10.1109/tit.2002.800489openalex-snapshot
Universal linear least squares prediction: upper and lower bounds
inferred← citeshttps://doi.org/10.1109/tit.2002.804115openalex-snapshot
Analytic variations on redundancy rates of renewal processes
inferred← citeshttps://doi.org/10.1109/tit.2003.818411openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
inferred← citeshttps://doi.org/10.1109/tit.2003.820014openalex-snapshot
On competitive prediction and its relation to rate-distortion theory
inferred← citeshttps://doi.org/10.1109/tit.2004.826664openalex-snapshot
An $O(N)$ Semipredictive Universal Encoder via the BWT
inferred← citeshttps://doi.org/10.1109/tit.2004.830763openalex-snapshot
Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
inferred← citeshttps://doi.org/10.1109/tit.2005.860437openalex-snapshot
On universal types
inferred← citeshttps://doi.org/10.1109/tit.2006.885484openalex-snapshot
Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes
inferred← citeshttps://doi.org/10.1109/tit.2008.2006464openalex-snapshot
Universal Delay-Limited Simulation
inferred← citeshttps://doi.org/10.1109/tit.2008.2011429openalex-snapshot
Lower Limits of Discrete Universal Denoising
inferred← citeshttps://doi.org/10.1109/tit.2012.2191476openalex-snapshot
Counting Markov Types, Balanced Matrices, and Eulerian Graphs
inferred← citeshttps://doi.org/10.1109/tit.2012.2195770openalex-snapshot
Type Classes of Context Trees
inferred← citeshttps://doi.org/10.1109/tit.2012.2228251openalex-snapshot
Perfectly Secure Encryption of Individual Sequences
inferred← citeshttps://doi.org/10.1109/tit.2013.2295217openalex-snapshot
Universal Enumerative Coding for Tree Models
inferred← citeshttps://doi.org/10.1109/tit.2014.2352300openalex-snapshot
Asymptotically Optimal Decision Rules for Joint Detection and Source Coding
inferred← citeshttps://doi.org/10.1109/tit.2014.2386860openalex-snapshot
Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources
inferred← citeshttps://doi.org/10.1109/tit.2023.3253133openalex-snapshot
D -Semifaithful Codes That are Universal Over Both Memoryless Sources and Distortion Measures
inferred← citeshttps://doi.org/10.1109/tit.2023.3313114openalex-snapshot
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications
inferred← citeshttps://doi.org/10.1109/tit.2025.3645223openalex-snapshot
A Family of LZ78-Based Universal Sequential Probability Assignments
inferred← citeshttps://doi.org/10.1111/rssb.12511openalex-snapshot
Bayesian Context Trees: Modelling and Exact Inference for Discrete Time Series
inferred← citeshttps://doi.org/10.1137/1.9781611972986.3openalex-snapshot
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform
inferred← citeshttps://doi.org/10.1145/225298.225305openalex-snapshot
Predicting nearly as well as the best pruning of a decision tree
inferred← citeshttps://doi.org/10.1145/267460.267487openalex-snapshot
An efficient extension to mixture techniques for prediction and decision trees
inferred← citeshttps://doi.org/10.1145/307400.307407openalex-snapshot
Minimax regret under log loss for general classes of experts
inferred← citeshttps://doi.org/10.1214/23-ba1362openalex-snapshot
Posterior Representations for Bayesian Context Trees: Sampling, Estimation and Convergence
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.1561/0100000142openalex-snapshot
A Toolbox for Refined Information-Theoretic Analyses with Applications
inferred← citeshttps://doi.org/10.3390/e25081199openalex-snapshot
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression
inferred← citeshttps://doi.org/10.3390/e26020116openalex-snapshot
Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders
inferred← citeshttps://doi.org/10.3390/e26060503openalex-snapshot
Refinements and Extensions of Ziv’s Model of Perfect Secrecy for Individual Sequences
inferred← citeshttps://doi.org/10.46298/dmtcs.2768openalex-snapshot
Counting Markov Types
inferred← citeshttps://doi.org/10.48550/arxiv.1112.2262openalex-snapshot
Perfectly secure encryption of individual sequences
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.