One Rounding Fits All: Memory-Efficient Approximation Algorithms for Partition-Constrained Influence Maximization
Studies memory-efficient approximation algorithms for influence maximization under partition constraints.
My research is in theoretical computer science and learning theory, with current work on bandit learning, hybrid feedback, robustness, and influence maximization.
* Equal contribution.
Studies memory-efficient approximation algorithms for influence maximization under partition constraints.
Examines stochastic bandits with both reward observations and dueling feedback.
Studies best-arm identification in generalized linear bandits with hybrid feedback.
Studies adversarial attacks on stochastic bandit algorithms through fake data injection.