Conference Improved Sample Complexity Bounds for Branch-And-Cut 2022 • Leibniz International Proceedings in Informatics • 235: Balcan MF, Prasad S, Sandholm T, Vitercik E
Conference Learning Predictions for Algorithms with Predictions 2022 • Advances in Neural Information Processing Systems Khodak M, Balcan M-F, Talwalkar A, Vassilvitskii S
Preprint Learning Predictions for Algorithms with Predictions 2022 Khodak M, Balcan M-F, Talwalkar A, Vassilvitskii S
Conference Maximizing Revenue under Market Shrinkage and Market Uncertainty 2022 • Advances in Neural Information Processing Systems Balcan M-F, Prasad S, Sandholm T
Preprint Nash Equilibria and Pitfalls of Adversarial Training in Adversarial Robustness Games 2022 Balcan M-F, Pukdee R, Ravikumar P, Zhang H
Conference Provably tuning the ElasticNet across instances 2022 • Advances in Neural Information Processing Systems Balcan M-F, Khodak M, Sharma D, Talwalkar A
Preprint Provably tuning the ElasticNet across instances 2022 Balcan M-F, Khodak M, Sharma D, Talwalkar A
Conference Robustly-reliable learners under poisoning attacks 2022 • CONFERENCE ON LEARNING THEORY, VOL 178 • 178: Balcan M-F, Blum A, Hanneke S, Sharma D
Preprint Robustly-reliable learners under poisoning attacks 2022 Balcan M-F, Blum A, Hanneke S, Sharma D
Conference Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts 2022 • Advances in Neural Information Processing Systems Balcan M-F, Prasad S, Sandholm T, Vitercik E
Preprint Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts 2022 Balcan M-F, Prasad S, Sandholm T, Vitercik E
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 M-F, 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
