Search Results for author:
Found 5 papers, 0 papers with code
Learning Low Degree Hypergraphs
To the best of our knowledge, these are the first algorithms with poly$(n, m)$ query complexity for learning non-trivial families of hypergraphs that have a super-constant number of edges of super-constant size.
Dominant Resource Fairness with Meta-Types
Inspired by the recent COVID-19 pandemic, we study a generalization of the multi-resource allocation problem with heterogeneous demands and Leontief utilities.
Online Learning with Cumulative Oversampling: Application to Budgeted Influence Maximization
We propose a cumulative oversampling (CO) method for online learning.
Beyond Adaptive Submodularity: Adaptive Influence Maximization with Intermediary Constraints
We consider a brand with a given budget that wants to promote a product over multiple rounds of influencer marketing.
Online Learning and Optimization Under a New Linear-Threshold Model with Negative Influence
We show that in these models, the expected positive influence spread is a monotone submodular function of the seed set.
