Ellen Vitercik
19 papers · 2016–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
π Academic Marathon (9) π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (6) π Cross-Pollinator (14)
π
Cross-Pollinator
(14)
πΊοΈ
Taxonomy Completionist
(18)
π
Century Club
(19)
ποΈ
Keyword Collector
(56)
β‘
Prolific Year
(5)
π₯
Unstoppable
(7)
Conferences
ICML (8)
NIPS (4)
COLT (3)
AAAI (2)
AISTATS (1)
IJCAI (1)
Top co-authors
Keywords
learning theory
(6)
sample complexity
(4)
integer programming
(4)
combinatorial optimization
(3)
cutting plane
(3)
algorithm configuration
(3)
branch and bound
(2)
regret bound
(2)
algorithm selection
(2)
tree search
(2)
portfolio selection
(1)
resource allocation
(1)
preference learning
(1)
empirical risk minimization
(1)
mechanism design
(1)
hyperparameter optimization
(1)
parameter tuning
(1)
no-regret learning
(1)
constrained optimization
(1)
derivative-free optimization
(1)
Papers
Primal-Dual Neural Algorithmic Reasoning
ICML 2025
New Sequence-Independent Lifting Techniques for Cover Inequalities and When They Induce Facets
IJCAI 2025
EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations
ICML 2025
Wait-Less Offline Tuning and Re-solving for Online Decision Making
ICML 2025
Algorithms with Calibrated Machine Learning Predictions
ICML 2025
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
ICML 2024
No-Regret Learning in Partially-Informed Auctions
ICML 2022
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts
NIPS 2022
Revenue maximization via machine learning with noisy data
NIPS 2021
Generalization in Portfolio-Based Algorithm Selection
AAAI 2021
Private optimization without constraint violations
AISTATS 2021
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond
NIPS 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
Learning to Prune: Speeding up Repeated Computations
COLT 2019
Learning to Branch
ICML 2018
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems
COLT 2017
Sample Complexity of Automated Mechanism Design
NIPS 2016
Learning Combinatorial Functions from Pairwise Comparisons
COLT 2016