Learning Time-Varying Coverage Functions

Coverage functions are an important class of discrete functions that capture the law of diminishing returns arising naturally from applications in social network analysis, machine learning, and algorithmic game theory. In this paper, we pro-pose a new problem of learning time-varying coverage functions, and develop a novel parametrization of these functions using random features. Based on the con-nection between time-varying coverage functions and counting processes, we also propose an efficient parameter learning algorithm based on likelihood maximiza-tion, and provide a sample complexity analysis. We applied our algorithm to the influence function estimation problem in information diffusion in social networks, and show that with few assumptions about the diffusion processes, our algorithm is able to estimate influence significantly more accurately than existing approaches on both synthetic and real world data.