default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEllen Vitercik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Maria-Florina Balcan
, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. J. ACM 71(2): 13:1-13:73 (2024)- [j2]Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik:
How Much Data Is Sufficient to Learn High-Performing Algorithms? J. ACM 71(5): 32:1-32:58 (2024) - [c23]Alexandre Hayderi, Amin Saberi, Ellen Vitercik, Anders Wikum:
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation. ICML 2024 - [i27]Siddharth Prasad, Ellen Vitercik, Maria-Florina Balcan, Tuomas Sandholm:
New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets. CoRR abs/2401.13773 (2024) - [i26]Vaggos Chatziafratis, Ishani Karmarkar, Ellen Vitercik:
From Large to Small Datasets: Size Generalization for Clustering Algorithm Selection. CoRR abs/2402.14332 (2024) - [i25]Joon Suk Huh, Ellen Vitercik, Kirthevasan Kandasamy:
Bandit Profit-maximization for Targeted Marketing. CoRR abs/2403.01361 (2024) - [i24]Alexandre Hayderi, Amin Saberi, Ellen Vitercik, Anders Wikum:
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation. CoRR abs/2406.05959 (2024) - 2023
- [c22]Christian Borgs, Jennifer T. Chayes, Christian Ikeokwu, Ellen Vitercik:
Disincentivizing Polarization in Social Networks. AiOfAi@IJCAI 2023: 12-21 - [c21]Wenshuo Guo, Nika Haghtalab, Kirthevasan Kandasamy, Ellen Vitercik:
Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty. EC 2023: 816 - [i23]Wenshuo Guo, Nika Haghtalab, Kirthevasan Kandasamy, Ellen Vitercik:
Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty. CoRR abs/2302.09700 (2023) - [i22]Christian Borgs, Jennifer T. Chayes, Christian Ikeokwu, Ellen Vitercik:
Disincentivizing Polarization in Social Networks. CoRR abs/2305.14537 (2023) - [i21]Kiriaki Frangias, Andrew Lin, Ellen Vitercik, Manolis Zampetakis:
Algorithmic Contract Design for Crowdsourced Ranking. CoRR abs/2310.09974 (2023) - [i20]Ellen Vitercik, Manolis Zampetakis, David Zhang:
Sorting from Crowdsourced Comparisons using Expert Verifications. CoRR abs/2310.14113 (2023) - 2022
- [c20]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Improved Sample Complexity Bounds for Branch-And-Cut. CP 2022: 3:1-3:19 - [c19]Wenshuo Guo, Michael I. Jordan, Ellen Vitercik:
No-Regret Learning in Partially-Informed Auctions. ICML 2022: 8039-8055 - [c18]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. NeurIPS 2022 - [i19]Wenshuo Guo, Michael I. Jordan, Ellen Vitercik:
No-Regret Learning in Partially-Informed Auctions. CoRR abs/2202.10606 (2022) - [i18]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts. CoRR abs/2204.07312 (2022) - 2021
- [b1]Ellen Vitercik:
Automated Algorithm and Mechanism Configuration. Carnegie Mellon University, USA, 2021 - [c17]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Generalization in Portfolio-Based Algorithm Selection. AAAI 2021: 12225-12232 - [c16]Andrés Muñoz Medina, Umar Syed, Sergei Vassilvitskii, Ellen Vitercik:
Private optimization without constraint violations. AISTATS 2021: 2557-2565 - [c15]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. NeurIPS 2021: 4015-4027 - [c14]Ellen Vitercik, Tom Yan:
Revenue maximization via machine learning with noisy data. NeurIPS 2021: 10510-10523 - [c13]Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik:
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design. STOC 2021: 919-932 - [i17]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Tree Search Configuration: Cutting Planes and Beyond. CoRR abs/2106.04033 (2021) - [i16]Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, Ellen Vitercik:
Improved Learning Bounds for Branch-and-Cut. CoRR abs/2111.11207 (2021) - 2020
- [c12]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. AAAI 2020: 3227-3234 - [c11]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. ICML 2020: 580-590 - [i15]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. CoRR abs/2006.11827 (2020) - [i14]Andrés Muñoz Medina, Umar Syed, Sergei Vassilvitskii, Ellen Vitercik:
Private Optimization Without Constraint Violations. CoRR abs/2007.01181 (2020) - [i13]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Generalization in portfolio-based algorithm selection. CoRR abs/2012.13315 (2020)
2010 – 2019
- 2019
- [c10]Christian Borgs, Jennifer T. Chayes, Nika Haghtalab, Adam Tauman Kalai, Ellen Vitercik:
Algorithmic Greenlining: An Approach to Increase Diversity. AIES 2019: 69-76 - [c9]Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, Ellen Vitercik:
Learning to Prune: Speeding up Repeated Computations. COLT 2019: 30-33 - [c8]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Estimating Approximate Incentive Compatibility. EC 2019: 867 - [i12]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Estimating Approximate Incentive Compatibility. CoRR abs/1902.09413 (2019) - [i11]Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, Ellen Vitercik:
Learning to Prune: Speeding up Repeated Computations. CoRR abs/1904.11875 (2019) - [i10]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees. CoRR abs/1905.10819 (2019) - [i9]Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik:
How much data is sufficient to learn high-performing algorithms? CoRR abs/1908.02894 (2019) - 2018
- [c7]Maria-Florina Balcan, Travis Dick, Ellen Vitercik:
Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization. FOCS 2018: 603-614 - [c6]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. ICALP 2018: 75:1-75:14 - [c5]Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch. ICML 2018: 353-362 - [c4]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
A General Theory of Sample Complexity for Multi-Item Profit Maximization. EC 2018: 173-174 - [i8]Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik:
Learning to Branch. CoRR abs/1803.10150 (2018) - 2017
- [c3]Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, Colin White:
Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems. COLT 2017: 213-274 - [i7]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Multi-Item Profit Maximization. CoRR abs/1705.00243 (2017) - [i6]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. CoRR abs/1707.04233 (2017) - [i5]Maria-Florina Balcan, Travis Dick, Ellen Vitercik:
Private and Online Optimization of Piecewise Lipschitz Functions. CoRR abs/1711.03091 (2017) - 2016
- [j1]Casey Mann, Joseph DiNatale, Emily Peirce, Ellen Vitercik:
Unilateral and equitransitive tilings by squares of four sizes. Ars Math. Contemp. 10(1): 135-167 (2016) - [c2]Maria-Florina Balcan, Ellen Vitercik, Colin White:
Learning Combinatorial Functions from Pairwise Comparisons. COLT 2016: 310-335 - [c1]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. NIPS 2016: 2083-2091 - [i4]Maria-Florina Balcan, Ellen Vitercik, Colin White:
Learning Combinatorial Functions from Pairwise Comparisons. CoRR abs/1605.09227 (2016) - [i3]Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik:
Sample Complexity of Automated Mechanism Design. CoRR abs/1606.04145 (2016) - [i2]Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, Colin White:
Learning the best algorithm for max-cut, clustering, and other partitioning problems. CoRR abs/1611.04535 (2016) - 2015
- [i1]Allison B. Lewko, Ellen Vitercik:
Balancing Communication for Multi-party Interactive Coding. CoRR abs/1503.06381 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
