Conference Data driven semi-supervised learning 2021 • Advances in Neural Information Processing Systems • 34: Balcan M-F, Sharma D
Preprint Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing 2021 Khodak M, Tu R, Li T, Li L, Balcan M-F, Smith V, Talwalkar A
Journal Article Federated Hyperparameter Tuning: Challenges, Baselines, and Connections toWeight-Sharing 2021 • Advances in Neural Information Processing Systems • 23:19184-19197 Khodak M, Tu R, Li T, Li L, Balcan MF, Smith V, Talwalkar A
Conference Generalization in Portfolio-Based Algorithm Selection 2021 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 35:12225-12232 Balcan M-F, Sandholm T, Vitercik E
Conference GEOMETRY-AWARE GRADIENT ALGORITHMS FOR NEURAL ARCHITECTURE SEARCH 2021 • ICLR 2021 - 9th International Conference on Learning Representations Li L, Khodak M, Balcan MF, Talwalkar A
Conference How Much Data Is Sufficient to Learn High-Performing Algorithms? Generalization Guarantees for Data-Driven Algorithm Design 2021 • Annual ACM Symposium on Theory of Computing • 919-932 Balcan M-F, DeBlasio D, Dick T, Kingsford C, Sandholm T, Vitercik E
Preprint Improved Sample Complexity Bounds for Branch-and-Cut 2021 Balcan M-F, Prasad S, Sandholm T, Vitercik E
Conference Learning Within an Instance for Designing High-Revenue Combinatorial Auctions 2021 • IJCAI International Joint Conference on Artificial Intelligence • 31-37 Balcan MF, Prasad S, Sandholm T
Journal Article Learning-to-learn non-convex piecewise-Lipschitz functions 2021 • Advances in Neural Information Processing Systems • 18:15056-15069 Balcan MF, Khodak M, Sharma D, Talwalkar A
Preprint Learning-to-learn non-convex piecewise-Lipschitz functions 2021 Balcan M-F, Khodak M, Sharma D, Talwalkar A
Conference Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond 2021 • Advances in Neural Information Processing Systems • 34: Balcan M-F, Prasad S, Sandholm T, Vitercik E
Preprint Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond 2021 Balcan M-F, Prasad S, Sandholm T, Vitercik E
Journal Article <i>k</i>-center Clustering under Perturbation Resilience 2020 • ACM Transactions on Algorithms (TALG) • 16(2): Balcan M-F, Haghtalab N, White C
Preprint An Analysis of Robustness of Non-Lipschitz Networks 2020 Balcan M-F, Blum A, Sharma D, Zhang H
Conference Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs 2020 • IJCAI International Joint Conference on Artificial Intelligence • 332-338 Balcan M-F, Prasad S, Sandholm T
Preprint Generalization in portfolio-based algorithm selection 2020 Balcan M-F, Sandholm T, Vitercik E
Preprint Geometry-Aware Gradient Algorithms for Neural Architecture Search 2020 Li L, Khodak M, Balcan M-F, Talwalkar A
Journal Article Geometry-Aware Gradient Algorithms for Neural Architecture Search 2020 Li L, Khodak M, Balcan M-F, Talwalkar A
Conference Learning piecewise Lipschitz functions in changing environments 2020 • INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108 • 108: Balcan M-F, Dick T, Sharma D
Conference LEARNING TO LINK 2020 • 8th International Conference on Learning Representations, ICLR 2020 Balcan MF, Dick T, Lang M
Conference Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees 2020 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 34:3227-3234 Balcan M-F, Sandholm T, Vitercik E
Journal Article Lifelong learning in costly feature spaces 2020 • Theoretical Computer Science • 808:14-37 Balcan M-F, Blum A, Nagarajan V
