Markov Senior——学习Markov Junior文法以生成用户指定内容
Markov Senior -- Learning Markov Junior Grammars to Generate User-specified Content
AI总结:
针对Markov Junior依赖人工设计文法的瓶颈,提出基于遗传编程的Markov Senior框架,从单样本提取关系构建规则,结合KL散度搜索文法与分治策略,实现多领域程序化内容生成。
摘要:
Markov Junior是一种概率编程语言,用于多个领域的程序化内容生成。但它依赖人工设计和调优的概率规则集(也称为文法),这构成了显著瓶颈,与可从示例中学习规则的方法存在差异。本文针对这一挑战提出了一种新方案:引入基于遗传编程的优化框架,用于自动学习分层规则集。我们提出的方法“Markov Senior”聚焦于从单个输入样本中提取位置和距离关系,构建供Markov Junior使用的概率规则。我们采用基于Kullback-Leibler散度的适应度度量,搜索能生成与给定样本一致内容的文法。为提升可扩展性,我们引入了分治策略,可高效生成大规模内容。我们通过生成图像类内容和《超级马里奥》关卡的实验验证了该方法,证明了其灵活性和有效性。由此,“Markov Senior”让Markov Junior能更广泛地应用于有示例可用、但生成式规则集设计不可行的任务。
英文摘要:
Markov Junior is a probabilistic programming language used for procedural content generation across various domains. However, its reliance on manually crafted and tuned probabilistic rule sets, also called grammars, presents a significant bottleneck, diverging from approaches that allow rule learning from examples. In this paper, we propose a novel solution to this challenge by introducing a genetic programming-based optimization framework for learning hierarchical rule sets automatically. Our proposed method ``Markov Senior'' focuses on extracting positional and distance relations from single input samples to construct probabilistic rules to be used by Markov Junior. Using a Kullback-Leibler divergence-based fitness measure, we search for grammars to generate content that is coherent with the given sample. To enhance scalability, we introduce a divide-and-conquer strategy that enables the efficient generation of large-scale content. We validate our approach through experiments in generating image-based content and Super Mario levels, demonstrating its flexibility and effectiveness. In this way, ``Markov Senior'' allows for the wider application of Markov Junior for tasks in which an example may be available, but the design of a generative rule set is infeasible.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。