arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.01088cs.LGcs.AIcs.LO
收藏

约束机器学习:Bagel框架

Constrained Machine Learning: The Bagel Framework

Ugmented S.A.S;Cornell University(康奈尔大学);Huawei Technologies Ltd(华为技术有限公司)

Guillaume Perez, Sebastian Ament, Carla Gomes, Arnaud Lallouet

摘要:

机器学习模型广泛用于现实世界的应用,例如文档分析和视觉。受约束的机器学习问题是学习模型必须准确并遵守约束的问题。对于连续凸约束,已经提出了许多工作,但组合约束下的学习仍然是一个困难的问题。本文的目标是扩大建模能力的约束机器学习问题,结合现有的工作,从组合优化。首先,我们提出了一个通用的框架,称为BaGeL(分支,生成和学习),它适用于分支和约束的学习问题,在每个节点上生成学习问题,并进行训练,直到只获得有效的模型。由于机器学习有特定的要求,我们还提出了一个扩展的表约束来分割假设的空间。我们验证了两个例子的方法:配置约束下的线性回归和非负矩阵分解与先验知识的潜在语义分析。

英文摘要:

Machine learning models are widely used for real-world applications, such as document analysis and vision. Constrained machine learning problems are problems where learned models have to both be accurate and respect constraints. For continuous convex constraints, many works have been proposed, but learning under combinatorial constraints is still a hard problem. The goal of this paper is to broaden the modeling capacity of constrained machine learning problems by incorporating existing work from combinatorial optimization. We propose first a general framework called BaGeL (Branch, Generate and Learn) which applies Branch and Bound to constrained learning problems where a learning problem is generated and trained at each node until only valid models are obtained. Because machine learning has specific requirements, we also propose an extended table constraint to split the space of hypotheses. We validate the approach on two examples: a linear regression under configuration constraints and a non-negative matrix factorization with prior knowledge for latent semantics analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑