Description : This package includes the JAVA code of the POMS algorithm [1] for the multiset selection problem (i.e., maximizing functions over the integer lattice) with a size constraint. This is an extension of our previous POSS algorithm [2] for the subset selection problem (i.e., maximizing functions over subsets) with a size constraint. POMS uses a randomized iterative procedure to solve the bi-objective reformulation of the original problem: maximizing the objective function and minimizing the multiset size. A Readme file and an example file are included in the package. In the 'Example.java', you will find an example of using this code for the application of budget allocation.

References: [1] Chao Qian, Yibo Zhang, Ke Tang, and Xin Yao. On Multiset Selection with Size Constraints. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI'18), New Orleans, LA, 2018. [2] Chao Qian, Yang Yu, and Zhi-Hua Zhou. Subset Selection by Pareto Optimization. In: Advances in Neural Information Processing Systems 28 (NIPS'15), Montreal, Canada, 2015.

ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Dr. Chao Qian (chaoqian@ustc.edu.cn).

Requirement: The package was developed with JAVA.

ATTN2: This package was developed by Dr. Chao Qian. For any problem concerning the code, please feel free to contact Dr. Qian.

Download: code (1MB)