Search Results for author:
Found 5 papers, 1 papers with code
Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-monotone functions, different constraints, and types of stochastic queries.
A Community-Aware Framework for Social Influence Maximization
We propose a community-aware divide-and-conquer framework that involves (i) learning the inherent community structure of the social network, (ii) generating candidate solutions by solving the influence maximization problem for each community, and (iii) selecting the final set of seed nodes using a novel progressive budgeting scheme.
DART: aDaptive Accept RejecT for non-linear top-K subset identification
Additionally, our algorithm works on correlated rewards of individual arms.
Stochastic Top-$K$ Subset Bandits with Linear Space and Non-Linear Feedback
Many real-world problems like Social Influence Maximization face the dilemma of choosing the best $K$ out of $N$ options at a given time instant.
Directed Information Graphs
We show that under appropriate conditions, it is unique and consistent with another type of graphical model, the directed information graph, which is based on a generalization of Granger causality.
