Author of the publication

When Discriminative Learning of Bayesian Network Parameters Is Easy.

, , , , and . IJCAI, page 491-498. Morgan Kaufmann, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Catching Up Faster by Switching Sooner: A Prequential Solution to the AIC-BIC Dilemma, , and . CoRR, (2008)Suboptimal behavior of Bayes and MDL in classification under misspecification., and . Mach. Learn., 66 (2-3): 119-149 (2007)A Minimum Descriptipn Length Approach to Grammar Inference.. ECML Workshop on Learning Contex-Free Grammars, Ruder Boskovic Institute, Zagreb, Croatia, (2003)Optional Stopping with Bayes Factors: a categorization and extension of folklore results, with an application to invariant situations., , and . CoRR, (2018)The Safe Bayesian - Learning the Learning Rate via the Mixability Gap.. ALT, volume 7568 of Lecture Notes in Computer Science, page 169-183. Springer, (2012)Bayesian and Information-Theories Priors for Bayesian Network Parameters., , , , and . ECML, volume 1398 of Lecture Notes in Computer Science, page 89-94. Springer, (1998)Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential families., and . ISIT, page 714-718. IEEE, (2009)PAC-Bayes Un-Expected Bernstein Inequality., , and . NeurIPS, page 12180-12191. (2019)RealKrimp - Finding Hyperintervals that Compress with MDL for Real-Valued Data., , , and . IDA, volume 8819 of Lecture Notes in Computer Science, page 368-379. Springer, (2014)Maximum Entropy and the Glasses You are Looking Through.. UAI, page 238-246. Morgan Kaufmann, (2000)