Roy, P. and Pachet, F. Enforcing Meter in Finite-Length Markov Sequences. 27th Conference on Artificial Intelligence (AAAI 2013), Bellevue, Washington (USA), June 2013

Sony CSL authors: Fran├žois Pachet, Pierre Roy


Markov processes are increasingly used to generate finite-length sequences that imitate a given style. However, Markov processes are notoriously difficult to control. Recently, Markov constraints have been introduced to give users some control on generated sequences. Markov constraints reformulate finite-length Markov sequence generation in the framework of constraint satisfaction (CSP). However, in practice, this approach is limited to local constraints and its performance is low for global constraints, such as cardinality or arithmetic constraints. This limitation prevents generated sequences to satisfy structural properties which are independent of the style, but inherent to the domain, such as meter. In this article, we introduce meter, a constraint that ensures a sequence is 1) Markovian with regards to a given corpus and 2) follows metrical rules expressed as cumulative cost functions. Additionally, meter can simultaneously enforce cardinality constraints. We propose a domain consistency algorithm whose complexity is pseudo-polynomial. This result is obtained thanks to a theorem on the growth of sumsets by Khovanskii. We illustrate our constraint on meter-constrained music generation problems that were so far not solvable by any other technique.

Keywords: flow machines, markov constraints, flow machines


[PDF] Adobe Acrobat PDF file

BibTeX entry

@INPROCEEDINGS { roy:13a, ADDRESS="Bellevue, Washington (USA)", AUTHOR="Roy, P. and Pachet, F.", BOOKTITLE="27th Conference on Artificial Intelligence (AAAI 2013)", MONTH="June", TITLE="Enforcing Meter in Finite-Length Markov Sequences", YEAR="2013", }