Social-Inverse: Inverse Decision-making of Social Contagion Management with Task Migrations
About
Considering two decision-making tasks $A$ and $B$, each of which wishes to compute an effective \textit{decision} $Y$ for a given \textit{query} $X$, {can we solve task $B$ by using query-decision pairs $(X, Y)$ of $A$ without knowing the latent decision-making model?} Such problems, called \textit{inverse decision-making with task migrations}, are of interest in that the complex and stochastic nature of real-world applications often prevents the agent from completely knowing the underlying system. In this paper, we introduce such a new problem with formal formulations and present a generic framework for addressing decision-making tasks in social contagion management. On the theory side, we present a generalization analysis for justifying the learning performance of our framework. In empirical studies, we perform a sanity check and compare the presented method with other possible learning-based and graph-based methods. We have acquired promising experimental results, confirming for the first time that it is possible to solve one decision-making task by using the solutions associated with another one.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| DC-DC | Erdős-Rényi | Performance Ratio0.902 | 24 | |
| DC-DE | Erdős-Rényi | Performance Ratio83.3 | 24 | |
| DE-DC | Erdős-Rényi | Performance Ratio0.902 | 24 | |
| DE-DE | Erdős-Rényi | Performance Ratio83.3 | 24 | |
| Decision context migration (DC to DE) | Kronecker graph (Kro) (test) | Performance Ratio0.853 | 17 | |
| Decision context migration (DC to DE) | Erdős-Rényi graph (ER) (test) | Performance Ratio0.833 | 17 | |
| Decision context migration (DE to DC) | Kronecker graph (Kro) (test) | Performance Ratio104.1 | 17 | |
| Decision context migration (DE to DC) | Erdős-Rényi graph (ER) (test) | Performance Ratio0.902 | 17 |