Dynamical Systems Trees

Tony Jebara; Andrew Howard

Dynamical Systems Trees
Jebara, Tony
Howard, Andrew
Technical reports
Computer Science
Permanent URL:
Columbia University Computer Science Technical Reports
Part Number:
We propose dynamical systems trees (DSTs) as a fexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynamical systems to an interactive group scenario. Various individual processes interact as communities and sub-communities in a tree structure that is un-rolled in time. To accommodate nonlinear temporal activity, each individual leaf process is modeled as a dynamical system containing discrete and/or continuous hidden states with discrete and/or Gaussian emissions. Subsequent, higher level parent processes act like hidden Markov models that mediate the interaction between leaf processes or between other parent processes in the hierarchy. Aggregator chains are parents of the child processes the combine and mediate, yielding a compact overall parameterization. We provide tractable inference and learning algorithms for arbitrary DSTs topologies via structured mean field. Experiments are shown for real trajectory data of tracked American football plays where a DST tracks players as dynamical systems mediated by their team processes mediated in turn by a top-level game process.
Computer science
Item views:
text | xml
Suggested Citation:
Tony Jebara, Andrew Howard, 2003, Dynamical Systems Trees, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:29201.

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries | Terms of Use | Copyright