Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For an arbitrary ordered set,  consider the model of all distributions P for which an element which precedes another element is considered the more significant one in the sense that the implication a ≤ b ⇒ P(a) ≥ P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the indicated model or, equivalently, the corresponding universal code, can be determined exactly via an algorithm of reasonably low complexity.
['Henrik Densing Petersen', 'Flemming Topsøe']
I am writing a research paper on a idea Universal coding for distributions over co-trees
[{"from": "human", "value": "I am writing a research paper on a idea Universal coding for distributions over co-trees"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For an arbitrary ordered set,  consider the model of all distributions P for which an element which precedes another element is considered the more significant one in the sense that the implication a \u2264 b \u21d2 P(a) \u2265 P(b) holds. It will be shown that if the ordered set is a finite co-tree, then the universal predictor for the indicated model or, equivalently, the corresponding universal code, can be determined exactly via an algorithm of reasonably low complexity."}]