Sara Bernardini, Fabio Fagnani, Chiara Piacentini |
PosterID:
49
PDF
Slides
Poster
BibTeX
|
| Several real-world problems in engineering and applied science require the selection of sequences that maximize a given reward function. Optimizing over sequences as opposed to sets requires to explore an exponentially larger search space and can become prohibitive in most cases of practical interest. However, if the objective function is submodular (intuitively, it exhibits a diminishing return property), the optimization problem becomes more manageable. Recently, there has been increasing interest in sequence submodularity in connection with applications such as recommender systems and online ad allocation. However, mostly ad hoc models and solutions have emerged within these applicative contexts. In consequence, the field appears fragmented and lacks coherence. In this paper, we offer a unified view of sequence submodularity and provide a generalized greedy algorithm that enjoys strong theoretical guarantees. We show how our approach naturally captures several application domains, and our algorithm encompasses existing methods, improving over them. | |
| Canb | 10/28/2020, 18:00 – 19:00 |
| 10/30/2020, 01:00 – 02:00 |
| Paris | 10/28/2020, 08:00 – 09:00 |
| 10/29/2020, 15:00 – 16:00 |
| NYC | 10/28/2020, 03:00 – 04:00 |
| 10/29/2020, 10:00 – 11:00 |
| LA | 10/28/2020, 00:00 – 01:00 |
| 10/29/2020, 07:00 – 08:00 |
Certified Unsolvability for SAT Planning with Property Directed Reachability
Salomé Eriksson, Malte Helmert
When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search
David Speck, Florian Geißer, Robert Mattmüller
Lifted Successor Generation Using Query Optimization Techniques
Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès
Through the Lens of Sequence Submodularity
Sara Bernardini, Fabio Fagnani, Chiara Piacentini