Learning-Theoretic Foundations of Algorithm Configuration for
Combinatorial Partitioning Problems

Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems

14 November 2016

Maria-Florina Balcan

Vaishnavh Nagarajan

Papers citing "Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems"

11 / 11 papers shown

Title
Utilitarian Algorithm Configuration for Infinite Parameter Spaces Devon R. Graham Kevin Leyton-Brown 30 0 0 28 May 2024
New Guarantees for Learning Revenue Maximizing Menus of Lotteries and Two-Part Tariffs Maria-Florina Balcan Hedyeh Beyhaghi 21 3 0 22 Feb 2023
Generalization Bounds for Data-Driven Numerical Linear Algebra Peter L. Bartlett Piotr Indyk Tal Wagner 27 14 0 16 Jun 2022
Contextual Pandora's Box Alexia Atsidakou C. Caramanis Evangelia Gergatsouli O. Papadigenopoulos Christos Tzamos 23 5 0 26 May 2022
Formalizing Preferences Over Runtime Distributions Devon R. Graham Kevin Leyton-Brown Tim Roughgarden 16 5 0 25 May 2022
Triangle and Four Cycle Counting with Predictions in Graph Streams Justin Y. Chen T. Eden Piotr Indyk Honghao Lin Shyam Narayanan R. Rubinfeld Sandeep Silwal Tal Wagner David P. Woodruff Michael Zhang 36 20 0 17 Mar 2022
Online Learning for Min Sum Set Cover and Pandora's Box Evangelia Gergatsouli Christos Tzamos 16 13 0 10 Feb 2022
A Survey of Methods for Automated Algorithm Configuration Elias Schede Jasmin Brandt Alexander Tornede Marcel Wever Viktor Bengs Eyke Hüllermeier Kevin Tierney 31 48 0 03 Feb 2022
Refined bounds for algorithm configuration: The knife-edge of dual class approximability Maria-Florina Balcan T. Sandholm Ellen Vitercik 6 14 0 21 Jun 2020
Learning to Branch Maria-Florina Balcan Travis Dick T. Sandholm Ellen Vitercik 11 169 0 27 Mar 2018
Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods Yuanzhi Li Andrej Risteski 14 6 0 12 Jul 2016