| [11] |
CHEN W , SUN X M , ZHANG J L ,et al. Optimization from structured samples for coverage functions[C]// Proceedings of 2020 International Conference on Machine Learning.[S.l.:s.n.], 2020.
|
| [12] |
CHEN W , SUN X M , ZHANG J L ,et al. Network inference and influence maximization from samples[C]// Proceedings of 2021 International Conference on Machine Learning.[S.l.:s.n.], 2021.
|
| [13] |
ROSENFELD N , BALKANSKI E , GLOBERSON A ,et al. Learning to optimize combinatorial functions[C]// Proceedings of 2021 International Conference on Machine Learning.[S.l.:s.n.], 2018: 4374-4383.
|
| [14] |
CONFORTI M , CORNUéJOLS G , . Submodular set functions,matroids and the greedy algorithm:tight worst-case bounds and some generalizations of the Rado-Edmonds theorem[J]. Discrete Applied Mathematics, 1984,7(3): 251-274.
|
| [1] |
BALKANSKI E , RUBINSTEIN A , SINGER Y . The limitations of optimization from samples[C]// Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. New York:ACM Press, 2017: 1016-1027.
|
| [2] |
BALCAN M F , HARVEY N J A . Learning submodular functions[C]// Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. New York:ACM Press, 2011: 793-802.
|
| [3] |
KEMPE D , KLEINBERG J , TARDOS é , . Maximizing the spread of influence through a social network[C]// Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM Press, 2003: 137-146.
|
| [4] |
BADANIDIYURU A , DOBZINSKI S , FU H ,et al. Sketching valuation functions[C]// Proceedings of the 23rd Annual ACMSIAM Symposium on Discrete Algorithms. Philadelphia:Society for Industrial and Applied Mathematics, 2012.
|
| [5] |
NEMHAUSER G L , WOLSEY L A , FISHER M L . An analysis of approximations for maximizing submodular set functions-I[J]. Mathematical Programming, 1978,14(1): 265-294.
|
| [6] |
GR?TSCHEL M , LOVáSZ L , SCHRIJVER A . The ellipsoid method and its consequences in combinatorial optimization[J]. Combinatorica, 1981,1(2): 169-197.
|
| [7] |
BALKANSKI E , SINGER Y . Minimizing a submodular function from samples[C]// Proceedings of the 31st International Conference on Neural Information Processing Systems.Red Hook:Curran Associates Inc. , 2017: 814-822.
|
| [8] |
BALKANSKI E , SINGER Y . The sample complexity of optimizing a convex function[C]// Proceedings of the 2017 Conference on Learning Theory.[S.l.:s.n.], 2017: 275-301.
|
| [9] |
BALKANSKI E , IMMORLICA N , SINGER Y . The importance of communities for learning to influence[C]// Proceedings of the 31st International Conference on Neural Information Processing Systems.Red Hook:Curran Associates Inc. , 2017: 5864-5873.
|
| [10] |
BALKANSKI E , RUBINSTEIN A , SINGER Y . The power of optimization from samples[C]// Proceedings of the 30th International Conference on Neural Information Processing Systems.Red Hook:Curran Associates Inc. , 2016: 4024-4032.
|
| [15] |
NARASIMHAN H , PARKES D C , SINGER Y . Learnability of influence in networks[C]// Proceedings of the 29th Annual Conference on Neural Information Processing Systems.[S.l.:s.n.], 2015: 3168-3176.
|
