(no subject)
Complexity theory methods for planning and learning.
(Thermodynamic approach. Phase transitions.)
K. S. Pedersen, P. Johansen "A curious robot: an
explorative-exploitive inference algorithm" ROBOMAT07
http://labvis.isr.uc.pt/robomat/papers/M1_3.pdf
citated literature:
I. Csiszar, Z. Talata (2006) "Context tree estimation for not necessarily finite memory
processes, via bic and mdl." IEEE transaction on Information Theory, 52(3):1007-1016.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.4059
D. Ron, Y. Singer, N. Tishby "The power of amnesia: Learning probabilistic
automata with variable memory length." Machine Learning, 25:117-149, 1996.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1845
P. Bühlmann "Model selection for variable length markov chains and tunning the context
algorithm." Annals of the Institute of Statistical Mathematics, 52:287-315, 2000.
http://e-collection.ethbib.ethz.ch/eserv/eth:22548/eth-22548-01.pdf
J. Rissanen "A universal data compression system"
IEEE Transaction on Information Theory, 29(5):656-664, 1983.
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1056741
c.f.:
R. Nohre "Some Topics in Descriptive Complexity"
PhD thesis, Linkoping Univ., 1994.
J. Rissanen "Stochastic complexity in learning" Lecture Notes in Computer
Science, 1995, Volume 904/1995, 196-210, DOI: 10.1007/3-540-59119-2_178
http://www.springerlink.com/content/p235w5483428x376/
L.L. Campbell "A coding theorem and Renyi's entropy"
Information and Control, 8(4): 423-429, 1965.
http://dx.doi.org/10.1016/S0019-9958(65)90332-3
L.L. Campbell (2000) "A Block Coding Theorem And Rényi's Entropy"
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1716
P. Elias "Universal codeword sets and representations of the integers"
IEEE Transaction on Information Theory, 21(2):194-203, 1975.
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055349
http://am.livejournal.com/139045.html
(Thermodynamic approach. Phase transitions.)
K. S. Pedersen, P. Johansen "A curious robot: an
explorative-exploitive inference algorithm" ROBOMAT07
http://labvis.isr.uc.pt/robomat/papers/M1_3.pdf
citated literature:
I. Csiszar, Z. Talata (2006) "Context tree estimation for not necessarily finite memory
processes, via bic and mdl." IEEE transaction on Information Theory, 52(3):1007-1016.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.4059
D. Ron, Y. Singer, N. Tishby "The power of amnesia: Learning probabilistic
automata with variable memory length." Machine Learning, 25:117-149, 1996.
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1845
P. Bühlmann "Model selection for variable length markov chains and tunning the context
algorithm." Annals of the Institute of Statistical Mathematics, 52:287-315, 2000.
http://e-collection.ethbib.ethz.ch/eserv/eth:22548/eth-22548-01.pdf
J. Rissanen "A universal data compression system"
IEEE Transaction on Information Theory, 29(5):656-664, 1983.
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1056741
c.f.:
R. Nohre "Some Topics in Descriptive Complexity"
PhD thesis, Linkoping Univ., 1994.
J. Rissanen "Stochastic complexity in learning" Lecture Notes in Computer
Science, 1995, Volume 904/1995, 196-210, DOI: 10.1007/3-540-59119-2_178
http://www.springerlink.com/content/p235w5483428x376/
L.L. Campbell "A coding theorem and Renyi's entropy"
Information and Control, 8(4): 423-429, 1965.
http://dx.doi.org/10.1016/S0019-9958(65)90332-3
L.L. Campbell (2000) "A Block Coding Theorem And Rényi's Entropy"
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1716
P. Elias "Universal codeword sets and representations of the integers"
IEEE Transaction on Information Theory, 21(2):194-203, 1975.
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1055349
http://am.livejournal.com/139045.html