Maria-Florina Balcan

Invited Open Problem: Online Optimization of Piecewise-Lipschitz Functions with Applications to Data-Driven Algorithm Design COLT 2026 Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition AAAI 2025 Learning Accurate and Interpretable Decision Trees (Extended Abstract) IJCAI 2025 New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets IJCAI 2025 Accelerating ERM for data-driven algorithm design using output-sensitive techniques NeurIPS 2024 Learning Accurate and Interpretable Decision Trees UAI 2024 Regret Minimization in Stackelberg Games with Side Information NeurIPS 2024 An Analysis of Robustness of Non-Lipschitz Networks JMLR 2023 Nash Equilibria and Pitfalls of Adversarial Training in Adversarial Robustness Games AISTATS 2023 Robustly-reliable learners under poisoning attacks COLT 2022 Generalization in Portfolio-Based Algorithm Selection AAAI 2021 Learning Within an Instance for Designing High-Revenue Combinatorial Auctions IJCAI 2021 Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs IJCAI 2020 Learning piecewise Lipschitz functions in changing environments AISTATS 2020 Learning to Link ICLR 2020 Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees AAAI 2020 Refined bounds for algorithm configuration: The knife-edge of dual class approximability ICML 2020 Semi-bandit Optimization in the Dispersed Setting UAI 2020 Non-Convex Matrix Completion and Related Problems via Strong Duality JMLR 2019 Provable Guarantees for Gradient-Based Meta-Learning ICML 2019 Learning to Branch ICML 2018 Differentially Private Clustering in High-Dimensional Euclidean Spaces ICML 2017 Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017 Lifelong Learning in Costly Feature Spaces ALT 2017 Risk Bounds for Transferring Representations With and Without Fine-Tuning ICML 2017 Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks JMLR 2017 Active Learning Algorithms for Graphical Model Selection AISTATS 2016 An Improved Gap-Dependency Analysis of the Noisy Power Method COLT 2016 Communication Efficient Distributed Agnostic Boosting AISTATS 2016 Learning and 1-bit Compressed Sensing under Asymmetric Noise COLT 2016 Learning Combinatorial Functions from Pairwise Comparisons COLT 2016 Efficient Learning of Linear Separators under Bounded Noise COLT 2015 Efficient Representations for Lifelong Learning and Autoencoding COLT 2015 A New Perspective on Learning Linear Separators with Large L_qL_p Margins AISTATS 2014 Robust Hierarchical Clustering JMLR 2014 Active and passive learning of linear separators under log-concave distributions COLT 2013 Active Clustering of Biological Sequences JMLR 2012