activity
20152025
most citedGuarantees for Greedy Maximization of Non-submodular Functions with Applications

100 citations · 387 across the 36 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.LG2017

Learning User Preferences to Incentivize Exploration in the Sharing Economy

Christoph Hirnschall, Adish Singla, Sebastian Tschiatschek +1

We study platforms in the sharing economy and discuss the need for incentivizing users to explore options that otherwise would not be chosen. For instance, rental platforms such as…

cs.SI2017★ 1 cited

Fake News Detection in Social Networks via Crowd Signals

Sebastian Tschiatschek, Adish Singla, Manuel Gomez Rodriguez +2

Our work considers leveraging crowd signals for detecting fake news and is motivated by tools recently introduced by Facebook that enable users to flag fake news. By aggregating us…

quant-ph2017★ 1 cited

Quantum-classical truncated Newton method for high-dimensional energy landscapes

Leonard Wossnig, Sebastian Tschiatschek, Stefan Zohren

We develop a quantum-classical hybrid algorithm for function optimization that is particularly useful in the training of neural networks since it makes use of particular aspects of…

cs.DM2017★ 100 cited

Guarantees for Greedy Maximization of Non-submodular Functions with Applications

Andrew An Bian, Joachim M. Buhmann, Andreas Krause +1

We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theor…

cs.LG2017

Coordinated Online Learning With Applications to Learning User Preferences

Christoph Hirnschall, Adish Singla, Sebastian Tschiatschek +1

We study an online multi-task learning setting, in which instances of related tasks arrive sequentially, and are handled by task-specific online learners. We consider an algorithmi…