Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Maria-Florina Balcan

Maria-Florina Balcan

Improved Learning Bounds for Branch-and-Cut


Nov 18, 2021
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik


  Access Paper or Ask Questions

Learning-to-learn non-convex piecewise-Lipschitz functions


Aug 19, 2021
Maria-Florina Balcan, Mikhail Khodak, Dravyansh Sharma, Ameet Talwalkar

Figure 1 for Learning-to-learn non-convex piecewise-Lipschitz functions
Figure 2 for Learning-to-learn non-convex piecewise-Lipschitz functions
Figure 3 for Learning-to-learn non-convex piecewise-Lipschitz functions
Figure 4 for Learning-to-learn non-convex piecewise-Lipschitz functions

  Access Paper or Ask Questions

Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing


Jun 08, 2021
Mikhail Khodak, Renbo Tu, Tian Li, Liam Li, Maria-Florina Balcan, Virginia Smith, Ameet Talwalkar

Figure 1 for Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing
Figure 2 for Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing
Figure 3 for Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing
Figure 4 for Federated Hyperparameter Tuning: Challenges, Baselines, and Connections to Weight-Sharing

  Access Paper or Ask Questions

Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond


Jun 08, 2021
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik

Figure 1 for Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
Figure 2 for Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond

  Access Paper or Ask Questions

Data driven algorithms for limited labeled data learning


Mar 18, 2021
Maria-Florina Balcan, Dravyansh Sharma

Figure 1 for Data driven algorithms for limited labeled data learning
Figure 2 for Data driven algorithms for limited labeled data learning
Figure 3 for Data driven algorithms for limited labeled data learning
Figure 4 for Data driven algorithms for limited labeled data learning
* 31 pages, 9 figures 
  Access Paper or Ask Questions

Generalization in portfolio-based algorithm selection


Dec 24, 2020
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

Figure 1 for Generalization in portfolio-based algorithm selection
* AAAI 2021 
  Access Paper or Ask Questions

Scalable and Provably Accurate Algorithms for Differentially Private Distributed Decision Tree Learning


Dec 19, 2020
Kaiwen Wang, Travis Dick, Maria-Florina Balcan

Figure 1 for Scalable and Provably Accurate Algorithms for Differentially Private Distributed Decision Tree Learning
Figure 2 for Scalable and Provably Accurate Algorithms for Differentially Private Distributed Decision Tree Learning
Figure 3 for Scalable and Provably Accurate Algorithms for Differentially Private Distributed Decision Tree Learning
Figure 4 for Scalable and Provably Accurate Algorithms for Differentially Private Distributed Decision Tree Learning
* In AAAI Workshop on Privacy-Preserving Artificial Intelligence, 2020 
  Access Paper or Ask Questions

Data-driven Algorithm Design


Nov 14, 2020
Maria-Florina Balcan

Figure 1 for Data-driven Algorithm Design
* Chapter 29 of the book Beyond the Worst-Case Analysis of Algorithms, edited by Tim Roughgarden and published by Cambridge University Press (2020) 
  Access Paper or Ask Questions

On the Power of Abstention and Data-Driven Decision Making for Adversarial Robustness


Oct 13, 2020
Maria-Florina Balcan, Avrim Blum, Dravyansh Sharma, Hongyang Zhang

Figure 1 for On the Power of Abstention and Data-Driven Decision Making for Adversarial Robustness
Figure 2 for On the Power of Abstention and Data-Driven Decision Making for Adversarial Robustness
Figure 3 for On the Power of Abstention and Data-Driven Decision Making for Adversarial Robustness
Figure 4 for On the Power of Abstention and Data-Driven Decision Making for Adversarial Robustness
* 31 pages, 9 figures 
  Access Paper or Ask Questions

Noise in Classification


Oct 10, 2020
Maria-Florina Balcan, Nika Haghtalab

Figure 1 for Noise in Classification
Figure 2 for Noise in Classification
* Chapter 16 of the book Beyond the Worst-Case Analysis of Algorithms 
  Access Paper or Ask Questions

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


Jun 21, 2020
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

Figure 1 for Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Figure 2 for Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Figure 3 for Refined bounds for algorithm configuration: The knife-edge of dual class approximability
Figure 4 for Refined bounds for algorithm configuration: The knife-edge of dual class approximability

  Access Paper or Ask Questions

Geometry-Aware Gradient Algorithms for Neural Architecture Search


Apr 16, 2020
Liam Li, Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar

Figure 1 for Geometry-Aware Gradient Algorithms for Neural Architecture Search
Figure 2 for Geometry-Aware Gradient Algorithms for Neural Architecture Search
Figure 3 for Geometry-Aware Gradient Algorithms for Neural Architecture Search
Figure 4 for Geometry-Aware Gradient Algorithms for Neural Architecture Search
* 31 pages, 5 figures 
  Access Paper or Ask Questions

How much data is sufficient to learn high-performing algorithms?


Sep 09, 2019
Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik

Figure 1 for How much data is sufficient to learn high-performing algorithms?
Figure 2 for How much data is sufficient to learn high-performing algorithms?
Figure 3 for How much data is sufficient to learn high-performing algorithms?
Figure 4 for How much data is sufficient to learn high-performing algorithms?

  Access Paper or Ask Questions

Online optimization of piecewise Lipschitz functions in changing environments


Jul 22, 2019
Maria-Florina Balcan, Travis Dick, Dravyansh Sharma

Figure 1 for Online optimization of piecewise Lipschitz functions in changing environments
Figure 2 for Online optimization of piecewise Lipschitz functions in changing environments
Figure 3 for Online optimization of piecewise Lipschitz functions in changing environments
Figure 4 for Online optimization of piecewise Lipschitz functions in changing environments

  Access Paper or Ask Questions

Learning to Link


Jul 16, 2019
Maria-Florina Balcan, Travis Dick, Manuel Lang

Figure 1 for Learning to Link
Figure 2 for Learning to Link
Figure 3 for Learning to Link
Figure 4 for Learning to Link

  Access Paper or Ask Questions

Adaptive Gradient-Based Meta-Learning Methods


Jun 17, 2019
Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar

Figure 1 for Adaptive Gradient-Based Meta-Learning Methods

  Access Paper or Ask Questions

Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees


May 26, 2019
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

Figure 1 for Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees

  Access Paper or Ask Questions

Semi-bandit Optimization in the Dispersed Setting


Apr 18, 2019
Maria-Florina Balcan, Travis Dick, Wesley Pegden

Figure 1 for Semi-bandit Optimization in the Dispersed Setting

  Access Paper or Ask Questions

Provable Guarantees for Gradient-Based Meta-Learning


Feb 27, 2019
Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar

Figure 1 for Provable Guarantees for Gradient-Based Meta-Learning
Figure 2 for Provable Guarantees for Gradient-Based Meta-Learning
Figure 3 for Provable Guarantees for Gradient-Based Meta-Learning
Figure 4 for Provable Guarantees for Gradient-Based Meta-Learning

  Access Paper or Ask Questions

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


Oct 22, 2018
Maria-Florina Balcan, Travis Dick, Ellen Vitercik

Figure 1 for Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization
Figure 2 for Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization

  Access Paper or Ask Questions

Testing Matrix Rank, Optimally


Oct 18, 2018
Maria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang

Figure 1 for Testing Matrix Rank, Optimally
Figure 2 for Testing Matrix Rank, Optimally
Figure 3 for Testing Matrix Rank, Optimally
* 51 pages. To appear in SODA 2019 
  Access Paper or Ask Questions

Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems


Oct 16, 2018
Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, Colin White

Figure 1 for Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems
Figure 2 for Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems
Figure 3 for Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems
Figure 4 for Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems

  Access Paper or Ask Questions

Envy-Free Classification


Sep 23, 2018
Maria-Florina Balcan, Travis Dick, Ritesh Noothigattu, Ariel D. Procaccia

Figure 1 for Envy-Free Classification
Figure 2 for Envy-Free Classification
Figure 3 for Envy-Free Classification
Figure 4 for Envy-Free Classification

  Access Paper or Ask Questions

Data-Driven Clustering via Parameterized Lloyd's Families


Sep 19, 2018
Maria-Florina Balcan, Travis Dick, Colin White

Figure 1 for Data-Driven Clustering via Parameterized Lloyd's Families
Figure 2 for Data-Driven Clustering via Parameterized Lloyd's Families
Figure 3 for Data-Driven Clustering via Parameterized Lloyd's Families
Figure 4 for Data-Driven Clustering via Parameterized Lloyd's Families

  Access Paper or Ask Questions

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


Aug 08, 2018
Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

Figure 1 for A General Theory of Sample Complexity for Multi-Item Profit Maximization
Figure 2 for A General Theory of Sample Complexity for Multi-Item Profit Maximization
Figure 3 for A General Theory of Sample Complexity for Multi-Item Profit Maximization
Figure 4 for A General Theory of Sample Complexity for Multi-Item Profit Maximization

  Access Paper or Ask Questions

Learning to Branch


May 16, 2018
Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik

Figure 1 for Learning to Branch
Figure 2 for Learning to Branch
Figure 3 for Learning to Branch
Figure 4 for Learning to Branch

  Access Paper or Ask Questions

Matrix Completion and Related Problems via Strong Duality


Apr 25, 2018
Maria-Florina Balcan, Yingyu Liang, David P. Woodruff, Hongyang Zhang

Figure 1 for Matrix Completion and Related Problems via Strong Duality
Figure 2 for Matrix Completion and Related Problems via Strong Duality
Figure 3 for Matrix Completion and Related Problems via Strong Duality
Figure 4 for Matrix Completion and Related Problems via Strong Duality
* 37 pages, 4 figures 
  Access Paper or Ask Questions

Sample and Computationally Efficient Learning Algorithms under S-Concave Distributions


Jan 27, 2018
Maria-Florina Balcan, Hongyang Zhang

Figure 1 for Sample and Computationally Efficient Learning Algorithms under S-Concave Distributions
Figure 2 for Sample and Computationally Efficient Learning Algorithms under S-Concave Distributions
* Appear in NIPS 2017 
  Access Paper or Ask Questions