VIP内容
https://gm-neurips-2020.github.io/
在这次演讲中，Graph Mining team的创始人Vahab对本图挖掘和学习进行了高层次的介绍。这个演讲涉及到什么是图，为什么它们是重要的，以及它们在大数据世界中的位置。然后讨论了组成图挖掘和学习工具箱的核心工具，并列出了几个规范的用例。它还讨论了如何结合算法、系统和机器学习来在不同的分布式环境中构建一个可扩展的图学习系统。最后，它提供了关于Google一个简短的历史图挖掘和学习项目。本次演讲将介绍接下来的演讲中常见的术语和主题。
成为VIP会员查看完整内容
【312页ppt】Mining and Learning with Graphs at Scale
热门内容
最新内容
最新论文
We present an end-to-end framework for the Assignment Problem with multiple tasks mapped to a group of workers, using reinforcement learning while preserving many constraints. Tasks and workers have time constraints and there is a cost associated with assigning a worker to a task. Each worker can perform multiple tasks until it exhausts its allowed time units (capacity). We train a reinforcement learning agent to find near optimal solutions to the problem by minimizing total cost associated with the assignments while maintaining hard constraints. We use proximal policy optimization to optimize model parameters. The model generates a sequence of actions in real-time which correspond to task assignment to workers, without having to retrain for changes in the dynamic state of the environment. In our problem setting reward is computed as negative of the assignment cost. We also demonstrate our results on bin packing and capacitated vehicle routing problem, using the same framework. Our results outperform Google OR-Tools using MIP and CP-SAT solvers with large problem instances, in terms of solution quality and computation time.
子主题
