图 书 馆
简洁表示平衡分配Balanced Allocation with Succinct Representation |
|
| 课程网址: | http://videolectures.net/kdd2010_alaei_basr/ |
| 主讲教师: | Saeed Alaei |
| 开课单位: | 马里兰大学 |
| 开课时间: | 2010-10-01 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Motivated by applications in guaranteed delivery in computational advertising, we consider the general problem of balanced allocation in a bipartite supply-demand setting. Our formulation captures the notion of deviation from being balanced by a convex penalty function. While this formulation admits a convex programming solution, we strive for more robust and scalable algorithms. For the case of $L_1$ penalty functions we obtain a simple combinatorial algorithm based on min-cost flow in graphs and show how to precompute a \emph{linear} amount of information such that the allocation along any edge can be approximated in \emph{constant} time. We then extend our combinatorial solution to any convex function by solving a convex cost flow. These scalable methods may have applications in other contexts stipulating balanced allocation. We study the performance of our algorithms on large real-world graphs and show that they are efficient, scalable, and robust in practice. |
| 关 键 词: | 供需平衡分配; 凸惩罚函数; 应用程序 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-12-21：lxf |
| 阅读次数: | 41 |