← Authors

Maria-Florina Balcan

36 papers · 2012–2025 · 10 conferences · across top CS/AI conferences

Achievements

πŸ—ΊοΈ Taxonomy Completionist (15) 🌈 Renaissance Researcher (6) 🌍 Conference Polyglot (10) πŸƒ Academic Marathon (13) 🐝 Cross-Pollinator (12) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge πŸ”¬ Deep Specialist (13) πŸ† Grand Slam πŸ† Keyword Champion πŸ—ƒοΈ Keyword Collector (159) πŸš€ Conference Pioneer πŸ’Ž Century Club (36) πŸ”₯ Unstoppable (14) πŸ“ˆ Trend Setter ⚑ Prolific Year (5)

Conferences

COLT (8) AISTATS (5) ICML (5) JMLR (5) IJCAI (4) AAAI (3) NIPS (2) UAI (2) ALT (1) ICLR (1)

Top co-authors

Tuomas Sandholm (8) Ellen Vitercik (7) Dravyansh Sharma (6) Hongyang Zhang (5) Travis Dick (5) Avrim Blum (4) Yingyu Liang (4) Siddharth Prasad (4) Pranjal Awasthi (2) Vaishnavh Nagarajan (2)

Keywords

sample complexity (7) learning theory (5) combinatorial optimization (4) active learning (4) algorithm configuration (3) combinatorial auction (2) lifelong learning (2) decision tree (2) online learning (2) adversarial robustness (2) integer programming (2) revenue optimization (2) transfer learning (2) representation learning (2) agnostic learning (2) mechanism design (2) algorithm design (2) empirical risk minimization (2) algorithm selection (2) linear separator (2)

Papers

New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets IJCAI 2025
Increasing Revenue in Efficient Combinatorial Auctions by Learning to Generate Artificial Competition AAAI 2025
Learning Accurate and Interpretable Decision Trees (Extended Abstract) IJCAI 2025
Regret Minimization in Stackelberg Games with Side Information NIPS 2024
Accelerating ERM for data-driven algorithm design using output-sensitive techniques NIPS 2024
Learning Accurate and Interpretable Decision Trees UAI 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
Refined bounds for algorithm configuration: The knife-edge of dual class approximability ICML 2020
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees AAAI 2020
Semi-bandit Optimization in the Dispersed Setting UAI 2020
Learning piecewise Lipschitz functions in changing environments AISTATS 2020
Learning to Link ICLR 2020
Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs IJCAI 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
Risk Bounds for Transferring Representations With and Without Fine-Tuning ICML 2017
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems COLT 2017
Lifelong Learning in Costly Feature Spaces ALT 2017
Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks JMLR 2017
Differentially Private Clustering in High-Dimensional Euclidean Spaces ICML 2017
Communication Efficient Distributed Agnostic Boosting AISTATS 2016
Active Learning Algorithms for Graphical Model Selection AISTATS 2016
Learning and 1-bit Compressed Sensing under Asymmetric Noise COLT 2016
An Improved Gap-Dependency Analysis of the Noisy Power Method COLT 2016
Learning Combinatorial Functions from Pairwise Comparisons COLT 2016
Efficient Representations for Lifelong Learning and Autoencoding COLT 2015
Efficient Learning of Linear Separators under Bounded Noise COLT 2015
Robust Hierarchical Clustering JMLR 2014
A New Perspective on Learning Linear Separators with Large L_qL_p Margins AISTATS 2014
Active and passive learning of linear separators under log-concave distributions COLT 2013
Active Clustering of Biological Sequences JMLR 2012