A Simple-Transition Model for Relational Sequences

We use "nearly sound" logical constraints to infer hidden states of relational processes. We introduce a simple-transition cost model, which is parameterized by weighted constraints and a statetransition cost. Inference for this model, i.e. finding a minimum-cost state sequence, reduces to a single-state minimization (SSM) problem. For relational Horn constraints, we give a practical approach to SSM based on logical reasoning and bounded search. We present a learning method that discovers relational constraints using CLAUDIEN [De Raedt and Dehaspe, 1997] and then tunes their weights using perceptron updates. Experiments in relational video interpretation show that our learned models improve on a variety of competitors.

[1]  Brigitte Jaumard,et al.  On the Complexity of the Maximum Satisfiability Problem for Horn Formulas , 1987, Inf. Process. Lett..

[2]  Ben Taskar,et al.  Discriminative Probabilistic Models for Relational Data , 2002, UAI.

[3]  Jeffrey Mark Siskind,et al.  Reconstructing force-dynamic models from video sequences , 2003, Artif. Intell..

[4]  S. Mason.  Purdue University , 2005 .

[5]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[6]  D. Amit,et al.  Perceptron learning with sign-constrained weights , 1989 .

[7]  Michael Collins,et al.  Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms , 2002, EMNLP.

[8]  Andrew McCallum,et al.  Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.

[9]  Pedro M. Domingos,et al.  Dynamic Probabilistic Relational Models , 2003, IJCAI.

[10]  R. Zabih,et al.  Efficient Graph-Based Energy Minimization Methods in Computer Vision , 1999 .

[11]  Robert P. Goldman,et al.  From knowledge bases to decision models , 1992, The Knowledge Engineering Review.

[12]  Stuart J. Russell,et al.  Dynamic bayesian networks: representation, inference and learning , 2002 .

[13]  Robert Givan,et al.  Relational sequential inference with reliable observations , 2004, ICML.

[14]  Jeffrey Mark Siskind,et al.  Grounding the Lexical Semantics of Verbs in Visual Perception using Force Dynamics and Event Logic , 1999, J. Artif. Intell. Res..

[15]  Robert Givan,et al.  Learning models and formulas of a temporal event logic , 2004 .

[16]  Luc De Raedt,et al.  Clausal Discovery , 1997, Machine Learning.

[17]  Mari Ostendorf,et al.  From HMM's to segment models: a unified view of stochastic modeling for speech recognition , 1996, IEEE Trans. Speech Audio Process..

[18]  Tricia Walker,et al.  Computer science , 1996, English for academic purposes series.

[19]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.

[20]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[21]  Luc De Raedt,et al.  Probabilistic logic learning , 2003, SKDD.

[22]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[23]  Henry A. Kautz,et al.  Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT , 1995 .