default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ellen Vitercik
@article{DBLP:journals/jacm/BalcanDSV24,
author = {Maria{-}Florina Balcan and
Travis Dick and
Tuomas Sandholm and
Ellen Vitercik},
title = {Learning to Branch: Generalization Guarantees and Limits of Data-Independent
Discretization},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {13:1--13:73},
year = {2024},
url = {https://doi.org/10.1145/3637840},
doi = {10.1145/3637840},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BalcanDSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/HayderiSVW24,
author = {Alexandre Hayderi and
Amin Saberi and
Ellen Vitercik and
Anders Wikum},
title = {{MAGNOLIA:} Matching Algorithms via GNNs for Online Value-to-go Approximation},
booktitle = {Forty-first International Conference on Machine Learning, {ICML} 2024,
Vienna, Austria, July 21-27, 2024},
publisher = {OpenReview.net},
year = {2024},
url = {https://openreview.net/forum?id=XlgeQ47Ra9},
timestamp = {Mon, 02 Sep 2024 16:45:29 +0200},
biburl = {https://dblp.org/rec/conf/icml/HayderiSVW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-13773,
author = {Siddharth Prasad and
Ellen Vitercik and
Maria{-}Florina Balcan and
Tuomas Sandholm},
title = {New Sequence-Independent Lifting Techniques for Cutting Planes and
When They Induce Facets},
journal = {CoRR},
volume = {abs/2401.13773},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.13773},
doi = {10.48550/ARXIV.2401.13773},
eprinttype = {arXiv},
eprint = {2401.13773},
timestamp = {Wed, 07 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-13773.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-14332,
author = {Vaggos Chatziafratis and
Ishani Karmarkar and
Ellen Vitercik},
title = {From Large to Small Datasets: Size Generalization for Clustering Algorithm
Selection},
journal = {CoRR},
volume = {abs/2402.14332},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.14332},
doi = {10.48550/ARXIV.2402.14332},
eprinttype = {arXiv},
eprint = {2402.14332},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-14332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-01361,
author = {Joon Suk Huh and
Ellen Vitercik and
Kirthevasan Kandasamy},
title = {Bandit Profit-maximization for Targeted Marketing},
journal = {CoRR},
volume = {abs/2403.01361},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.01361},
doi = {10.48550/ARXIV.2403.01361},
eprinttype = {arXiv},
eprint = {2403.01361},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-01361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-05959,
author = {Alexandre Hayderi and
Amin Saberi and
Ellen Vitercik and
Anders Wikum},
title = {{MAGNOLIA:} Matching Algorithms via GNNs for Online Value-to-go Approximation},
journal = {CoRR},
volume = {abs/2406.05959},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.05959},
doi = {10.48550/ARXIV.2406.05959},
eprinttype = {arXiv},
eprint = {2406.05959},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-05959.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiofai/BorgsCIV23,
author = {Christian Borgs and
Jennifer T. Chayes and
Christian Ikeokwu and
Ellen Vitercik},
editor = {Esma A{\"{\i}}meur and
Nicol{\'{a}}s E. D{\'{\i}}az Ferreyra},
title = {Disincentivizing Polarization in Social Networks},
booktitle = {Proceedings of the 3rd Workshop on Adverse Impacts and Collateral
Effects of Artificial Intelligence Technologies (AiOfAi 2023) co-located
with 32nd International Conference on Artificial Intelligence {(IJCAI}
2023), Macao, China, August 21, 2023},
series = {{CEUR} Workshop Proceedings},
volume = {3593},
pages = {12--21},
publisher = {CEUR-WS.org},
year = {2023},
url = {https://ceur-ws.org/Vol-3593/paper4.pdf},
timestamp = {Tue, 02 Jan 2024 17:44:44 +0100},
biburl = {https://dblp.org/rec/conf/aiofai/BorgsCIV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/GuoHKV23,
author = {Wenshuo Guo and
Nika Haghtalab and
Kirthevasan Kandasamy and
Ellen Vitercik},
editor = {Kevin Leyton{-}Brown and
Jason D. Hartline and
Larry Samuelson},
title = {Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty},
booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
{EC} 2023, London, United Kingdom, July 9-12, 2023},
pages = {816},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580507.3597663},
doi = {10.1145/3580507.3597663},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/GuoHKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-09700,
author = {Wenshuo Guo and
Nika Haghtalab and
Kirthevasan Kandasamy and
Ellen Vitercik},
title = {Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty},
journal = {CoRR},
volume = {abs/2302.09700},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.09700},
doi = {10.48550/ARXIV.2302.09700},
eprinttype = {arXiv},
eprint = {2302.09700},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-09700.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-14537,
author = {Christian Borgs and
Jennifer T. Chayes and
Christian Ikeokwu and
Ellen Vitercik},
title = {Disincentivizing Polarization in Social Networks},
journal = {CoRR},
volume = {abs/2305.14537},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.14537},
doi = {10.48550/ARXIV.2305.14537},
eprinttype = {arXiv},
eprint = {2305.14537},
timestamp = {Tue, 06 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-14537.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-09974,
author = {Kiriaki Frangias and
Andrew Lin and
Ellen Vitercik and
Manolis Zampetakis},
title = {Algorithmic Contract Design for Crowdsourced Ranking},
journal = {CoRR},
volume = {abs/2310.09974},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.09974},
doi = {10.48550/ARXIV.2310.09974},
eprinttype = {arXiv},
eprint = {2310.09974},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-09974.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-14113,
author = {Ellen Vitercik and
Manolis Zampetakis and
David Zhang},
title = {Sorting from Crowdsourced Comparisons using Expert Verifications},
journal = {CoRR},
volume = {abs/2310.14113},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.14113},
doi = {10.48550/ARXIV.2310.14113},
eprinttype = {arXiv},
eprint = {2310.14113},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-14113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/BalcanPSV22,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Christine Solnon},
title = {Improved Sample Complexity Bounds for Branch-And-Cut},
booktitle = {28th International Conference on Principles and Practice of Constraint
Programming, {CP} 2022, July 31 to August 8, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {235},
pages = {3:1--3:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CP.2022.3},
doi = {10.4230/LIPICS.CP.2022.3},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/BalcanPSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/GuoJV22,
author = {Wenshuo Guo and
Michael I. Jordan and
Ellen Vitercik},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {No-Regret Learning in Partially-Informed Auctions},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {8039--8055},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/guo22b.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/GuoJV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BalcanPSV22,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Structural Analysis of Branch-and-Cut and the Learnability of Gomory
Mixed Integer Cuts},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/db2cbf43a349bc866111e791b58c7bf4-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BalcanPSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-10606,
author = {Wenshuo Guo and
Michael I. Jordan and
Ellen Vitercik},
title = {No-Regret Learning in Partially-Informed Auctions},
journal = {CoRR},
volume = {abs/2202.10606},
year = {2022},
url = {https://arxiv.org/abs/2202.10606},
eprinttype = {arXiv},
eprint = {2202.10606},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-10606.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-07312,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
title = {Structural Analysis of Branch-and-Cut and the Learnability of Gomory
Mixed Integer Cuts},
journal = {CoRR},
volume = {abs/2204.07312},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.07312},
doi = {10.48550/ARXIV.2204.07312},
eprinttype = {arXiv},
eprint = {2204.07312},
timestamp = {Wed, 20 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-07312.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Vitercik21,
author = {Ellen Vitercik},
title = {Automated Algorithm and Mechanism Configuration},
school = {Carnegie Mellon University, {USA}},
year = {2021},
url = {https://doi.org/10.1184/r1/17207516.v1},
doi = {10.1184/R1/17207516.V1},
timestamp = {Wed, 13 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Vitercik21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BalcanSV21,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Generalization in Portfolio-Based Algorithm Selection},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {12225--12232},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i14.17451},
doi = {10.1609/AAAI.V35I14.17451},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BalcanSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/MunozSVV21,
author = {Andr{\'{e}}s {Mu{\~{n}}oz Medina} and
Umar Syed and
Sergei Vassilvitskii and
Ellen Vitercik},
editor = {Arindam Banerjee and
Kenji Fukumizu},
title = {Private optimization without constraint violations},
booktitle = {The 24th International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2021, April 13-15, 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {130},
pages = {2557--2565},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v130/munoz21a.html},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aistats/MunozSVV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BalcanPSV21,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Sample Complexity of Tree Search Configuration: Cutting Planes and
Beyond},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {4015--4027},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/210b7ec74fc9cec6fb8388dbbdaf23f7-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/BalcanPSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/VitercikY21,
author = {Ellen Vitercik and
Tom Yan},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Revenue maximization via machine learning with noisy data},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {10510--10523},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/56d33021e640f5d64a611a71b5dc30a3-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/VitercikY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BalcanDDKSV21,
author = {Maria{-}Florina Balcan and
Dan F. DeBlasio and
Travis Dick and
Carl Kingsford and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {How much data is sufficient to learn high-performing algorithms? generalization
guarantees for data-driven algorithm design},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {919--932},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451036},
doi = {10.1145/3406325.3451036},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BalcanDDKSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-04033,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
title = {Sample Complexity of Tree Search Configuration: Cutting Planes and
Beyond},
journal = {CoRR},
volume = {abs/2106.04033},
year = {2021},
url = {https://arxiv.org/abs/2106.04033},
eprinttype = {arXiv},
eprint = {2106.04033},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-04033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-11207,
author = {Maria{-}Florina Balcan and
Siddharth Prasad and
Tuomas Sandholm and
Ellen Vitercik},
title = {Improved Learning Bounds for Branch-and-Cut},
journal = {CoRR},
volume = {abs/2111.11207},
year = {2021},
url = {https://arxiv.org/abs/2111.11207},
eprinttype = {arXiv},
eprint = {2111.11207},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-11207.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BalcanSV20,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Learning to Optimize Computational Resources: Frugal Training with
Generalization Guarantees},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {3227--3234},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i04.5721},
doi = {10.1609/AAAI.V34I04.5721},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BalcanSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BalcanSV20,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Refined bounds for algorithm configuration: The knife-edge of dual
class approximability},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {580--590},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/balcan20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/BalcanSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11827,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Refined bounds for algorithm configuration: The knife-edge of dual
class approximability},
journal = {CoRR},
volume = {abs/2006.11827},
year = {2020},
url = {https://arxiv.org/abs/2006.11827},
eprinttype = {arXiv},
eprint = {2006.11827},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-01181,
author = {Andr{\'{e}}s {Mu{\~{n}}oz Medina} and
Umar Syed and
Sergei Vassilvitskii and
Ellen Vitercik},
title = {Private Optimization Without Constraint Violations},
journal = {CoRR},
volume = {abs/2007.01181},
year = {2020},
url = {https://arxiv.org/abs/2007.01181},
eprinttype = {arXiv},
eprint = {2007.01181},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-01181.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-13315,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Generalization in portfolio-based algorithm selection},
journal = {CoRR},
volume = {abs/2012.13315},
year = {2020},
url = {https://arxiv.org/abs/2012.13315},
eprinttype = {arXiv},
eprint = {2012.13315},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-13315.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aies/BorgsCHKV19,
author = {Christian Borgs and
Jennifer T. Chayes and
Nika Haghtalab and
Adam Tauman Kalai and
Ellen Vitercik},
editor = {Vincent Conitzer and
Gillian K. Hadfield and
Shannon Vallor},
title = {Algorithmic Greenlining: An Approach to Increase Diversity},
booktitle = {Proceedings of the 2019 {AAAI/ACM} Conference on AI, Ethics, and Society,
{AIES} 2019, Honolulu, HI, USA, January 27-28, 2019},
pages = {69--76},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3306618.3314246},
doi = {10.1145/3306618.3314246},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aies/BorgsCHKV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AlabiKLMTV19,
author = {Daniel Alabi and
Adam Tauman Kalai and
Katrina Ligett and
Cameron Musco and
Christos Tzamos and
Ellen Vitercik},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {Learning to Prune: Speeding up Repeated Computations},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {30--33},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/alabi19a.html},
timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
biburl = {https://dblp.org/rec/conf/colt/AlabiKLMTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ec/BalcanSV19,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Anna R. Karlin and
Nicole Immorlica and
Ramesh Johari},
title = {Estimating Approximate Incentive Compatibility},
booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation,
{EC} 2019, Phoenix, AZ, USA, June 24-28, 2019},
pages = {867},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3328526.3329628},
doi = {10.1145/3328526.3329628},
timestamp = {Thu, 04 Apr 2024 16:56:10 +0200},
biburl = {https://dblp.org/rec/conf/ec/BalcanSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-09413,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Estimating Approximate Incentive Compatibility},
journal = {CoRR},
volume = {abs/1902.09413},
year = {2019},
url = {http://arxiv.org/abs/1902.09413},
eprinttype = {arXiv},
eprint = {1902.09413},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-09413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-11875,
author = {Daniel Alabi and
Adam Tauman Kalai and
Katrina Ligett and
Cameron Musco and
Christos Tzamos and
Ellen Vitercik},
title = {Learning to Prune: Speeding up Repeated Computations},
journal = {CoRR},
volume = {abs/1904.11875},
year = {2019},
url = {http://arxiv.org/abs/1904.11875},
eprinttype = {arXiv},
eprint = {1904.11875},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-11875.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10819,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Learning to Optimize Computational Resources: Frugal Training with
Generalization Guarantees},
journal = {CoRR},
volume = {abs/1905.10819},
year = {2019},
url = {http://arxiv.org/abs/1905.10819},
eprinttype = {arXiv},
eprint = {1905.10819},
timestamp = {Mon, 03 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10819.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-02894,
author = {Maria{-}Florina Balcan and
Dan F. DeBlasio and
Travis Dick and
Carl Kingsford and
Tuomas Sandholm and
Ellen Vitercik},
title = {How much data is sufficient to learn high-performing algorithms?},
journal = {CoRR},
volume = {abs/1908.02894},
year = {2019},
url = {http://arxiv.org/abs/1908.02894},
eprinttype = {arXiv},
eprint = {1908.02894},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-02894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BalcanDV18,
author = {Maria{-}Florina Balcan and
Travis Dick and
Ellen Vitercik},
editor = {Mikkel Thorup},
title = {Dispersion for Data-Driven Algorithm Design, Online Learning, and
Private Optimization},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {603--614},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00064},
doi = {10.1109/FOCS.2018.00064},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BalcanDV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HaeuplerSV18,
author = {Bernhard Haeupler and
Amirbehshad Shahrasbi and
Ellen Vitercik},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Synchronization Strings: Channel Simulations and Interactive Coding
for Insertions and Deletions},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {75:1--75:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.75},
doi = {10.4230/LIPICS.ICALP.2018.75},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HaeuplerSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BalcanDSV18,
author = {Maria{-}Florina Balcan and
Travis Dick and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Learning to Branch},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {353--362},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/balcan18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:30 +0200},
biburl = {https://dblp.org/rec/conf/icml/BalcanDSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/BalcanSV18,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
editor = {{\'{E}}va Tardos and
Edith Elkind and
Rakesh Vohra},
title = {A General Theory of Sample Complexity for Multi-Item Profit Maximization},
booktitle = {Proceedings of the 2018 {ACM} Conference on Economics and Computation,
Ithaca, NY, USA, June 18-22, 2018},
pages = {173--174},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219166.3219217},
doi = {10.1145/3219166.3219217},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/BalcanSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10150,
author = {Maria{-}Florina Balcan and
Travis Dick and
Tuomas Sandholm and
Ellen Vitercik},
title = {Learning to Branch},
journal = {CoRR},
volume = {abs/1803.10150},
year = {2018},
url = {http://arxiv.org/abs/1803.10150},
eprinttype = {arXiv},
eprint = {1803.10150},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BalcanNVW17,
author = {Maria{-}Florina Balcan and
Vaishnavh Nagarajan and
Ellen Vitercik and
Colin White},
editor = {Satyen Kale and
Ohad Shamir},
title = {Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial
Partitioning Problems},
booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
Amsterdam, The Netherlands, 7-10 July 2017},
series = {Proceedings of Machine Learning Research},
volume = {65},
pages = {213--274},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v65/balcan17a.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/BalcanNVW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalcanSV17,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Sample Complexity of Multi-Item Profit Maximization},
journal = {CoRR},
volume = {abs/1705.00243},
year = {2017},
url = {http://arxiv.org/abs/1705.00243},
eprinttype = {arXiv},
eprint = {1705.00243},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalcanSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HaeuplerSV17,
author = {Bernhard Haeupler and
Amirbehshad Shahrasbi and
Ellen Vitercik},
title = {Synchronization Strings: Channel Simulations and Interactive Coding
for Insertions and Deletions},
journal = {CoRR},
volume = {abs/1707.04233},
year = {2017},
url = {http://arxiv.org/abs/1707.04233},
eprinttype = {arXiv},
eprint = {1707.04233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HaeuplerSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03091,
author = {Maria{-}Florina Balcan and
Travis Dick and
Ellen Vitercik},
title = {Private and Online Optimization of Piecewise Lipschitz Functions},
journal = {CoRR},
volume = {abs/1711.03091},
year = {2017},
url = {http://arxiv.org/abs/1711.03091},
eprinttype = {arXiv},
eprint = {1711.03091},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03091.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arsmc/MannDPV16,
author = {Casey Mann and
Joseph DiNatale and
Emily Peirce and
Ellen Vitercik},
title = {Unilateral and equitransitive tilings by squares of four sizes},
journal = {Ars Math. Contemp.},
volume = {10},
number = {1},
pages = {135--167},
year = {2016},
url = {https://doi.org/10.26493/1855-3974.644.d7c},
doi = {10.26493/1855-3974.644.D7C},
timestamp = {Wed, 27 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arsmc/MannDPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/BalcanVW16,
author = {Maria{-}Florina Balcan and
Ellen Vitercik and
Colin White},
editor = {Vitaly Feldman and
Alexander Rakhlin and
Ohad Shamir},
title = {Learning Combinatorial Functions from Pairwise Comparisons},
booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
New York, USA, June 23-26, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {49},
pages = {310--335},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v49/balcan16b.html},
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
biburl = {https://dblp.org/rec/conf/colt/BalcanVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BalcanSV16,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Daniel D. Lee and
Masashi Sugiyama and
Ulrike von Luxburg and
Isabelle Guyon and
Roman Garnett},
title = {Sample Complexity of Automated Mechanism Design},
booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference
on Neural Information Processing Systems 2016, December 5-10, 2016,
Barcelona, Spain},
pages = {2083--2091},
year = {2016},
url = {https://proceedings.neurips.cc/paper/2016/hash/c667d53acd899a97a85de0c201ba99be-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/BalcanSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalcanVW16,
author = {Maria{-}Florina Balcan and
Ellen Vitercik and
Colin White},
title = {Learning Combinatorial Functions from Pairwise Comparisons},
journal = {CoRR},
volume = {abs/1605.09227},
year = {2016},
url = {http://arxiv.org/abs/1605.09227},
eprinttype = {arXiv},
eprint = {1605.09227},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalcanVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalcanSV16,
author = {Maria{-}Florina Balcan and
Tuomas Sandholm and
Ellen Vitercik},
title = {Sample Complexity of Automated Mechanism Design},
journal = {CoRR},
volume = {abs/1606.04145},
year = {2016},
url = {http://arxiv.org/abs/1606.04145},
eprinttype = {arXiv},
eprint = {1606.04145},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalcanSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalcanNVW16,
author = {Maria{-}Florina Balcan and
Vaishnavh Nagarajan and
Ellen Vitercik and
Colin White},
title = {Learning the best algorithm for max-cut, clustering, and other partitioning
problems},
journal = {CoRR},
volume = {abs/1611.04535},
year = {2016},
url = {http://arxiv.org/abs/1611.04535},
eprinttype = {arXiv},
eprint = {1611.04535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalcanNVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LewkoV15,
author = {Allison B. Lewko and
Ellen Vitercik},
title = {Balancing Communication for Multi-party Interactive Coding},
journal = {CoRR},
volume = {abs/1503.06381},
year = {2015},
url = {http://arxiv.org/abs/1503.06381},
eprinttype = {arXiv},
eprint = {1503.06381},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LewkoV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-09-04 00:27 CEST 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:
