Ellen Vitercik

Proceedings of the International Conference on Machine Learning, 2022

Improved Sample Complexity Bounds for Branch-And-Cut.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

2021

Automated Algorithm and Mechanism Configuration.

[BibT_eX]

[DOI]

PhD thesis, 2021

Improved Learning Bounds for Branch-and-Cut.

[BibT_eX]

[DOI]

CoRR, 2021

How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Revenue maximization via machine learning with noisy data.

[BibT_eX]

[DOI]

Tom Yan

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Private optimization without constraint violations.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Generalization in Portfolio-Based Algorithm Selection.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Refined bounds for algorithm configuration: The knife-edge of dual class approximability.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Estimating Approximate Incentive Compatibility.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Learning to Prune: Speeding up Repeated Computations.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Algorithmic Greenlining: An Approach to Increase Diversity.

[BibT_eX]

[DOI]

Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

2018

A General Theory of Sample Complexity for Multi-Item Profit Maximization.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Learning to Branch.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions.

[BibT_eX]

[DOI]

Bernhard Haeupler

Amirbehshad Shahrasbi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization.

[BibT_eX]

[DOI]

Travis Dick

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Private and Online Optimization of Piecewise Lipschitz Functions.

[BibT_eX]

[DOI]

Travis Dick

CoRR, 2017

Sample Complexity of Multi-Item Profit Maximization.

[BibT_eX]

[DOI]

CoRR, 2017

Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Learning the best algorithm for max-cut, clustering, and other partitioning problems.

[BibT_eX]

[DOI]

CoRR, 2016

Unilateral and equitransitive tilings by squares of four sizes.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

Sample Complexity of Automated Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Learning Combinatorial Functions from Pairwise Comparisons.

[BibT_eX]

[DOI]

Colin White

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Balancing Communication for Multi-party Interactive Coding.

[BibT_eX]

[DOI]

Allison B. Lewko