<?xml version="1.0"?>
<dblpperson name="Gregory Valiant" pid="80/6006" n="151">
<person key="homepages/80/6006" mdate="2021-04-28">
<author pid="80/6006">Gregory Valiant</author>
<note type="affiliation">University of California, Berkeley, USA</note>
<url>http://www.eecs.berkeley.edu/~gvaliant/</url>
<url>https://dl.acm.org/profile/81350582572</url>
</person>
<r><inproceedings key="conf/sosa/PabbarajuVV26" mdate="2026-02-19">
<author pid="231/7619">Chirag Pabbaraju</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="119/0122">Rishi Verma</author>
<title>A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses.</title>
<pages>365-384</pages>
<year>2026</year>
<booktitle>SOSA</booktitle>
<ee>https://doi.org/10.1137/1.9781611978964.29</ee>
<crossref>conf/sosa/2026</crossref>
<url>db/conf/sosa/sosa2026.html#PabbarajuVV26</url>
</inproceedings>
</r>
<r><article key="journals/tmlr/GargPSV25" mdate="2025-11-13">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="231/7619">Chirag Pabbaraju</author>
<author pid="160/9071">Kirankumar Shiragur</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Testing with Non-identically Distributed Samples.</title>
<year>2025</year>
<volume>2025</volume>
<journal>Trans. Mach. Learn. Res.</journal>
<ee type="oa">https://openreview.net/forum?id=FUzvztzBlW</ee>
<url>db/journals/tmlr/tmlr2025.html#GargPSV25</url>
<stream>streams/journals/tmlr</stream>
</article>
</r>
<r><inproceedings key="conf/stoc/RivkinVV25" mdate="2025-11-02">
<author orcid="0009-0001-0195-6675" pid="394/4704">Joey Rivkin</author>
<author orcid="0000-0001-5523-2974" pid="80/6006">Gregory Valiant</author>
<author orcid="0000-0002-2211-1073" pid="82/2417">Paul Valiant</author>
<title>A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities.</title>
<pages>1657-1667</pages>
<year>2025</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3717823.3718315</ee>
<ee>https://www.wikidata.org/entity/Q135686004</ee>
<crossref>conf/stoc/2025</crossref>
<url>db/conf/stoc/stoc2025.html#RivkinVV25</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/BlancV25" mdate="2025-11-02">
<author orcid="0000-0003-3185-1097" pid="211/7035">Guy Blanc</author>
<author orcid="0000-0002-2211-1073" pid="80/6006">Gregory Valiant</author>
<title>Adaptive and Oblivious Statistical Adversaries Are Equivalent.</title>
<pages>2031-2042</pages>
<year>2025</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3717823.3718193</ee>
<ee>https://www.wikidata.org/entity/Q135685618</ee>
<crossref>conf/stoc/2025</crossref>
<url>db/conf/stoc/stoc2025.html#BlancV25</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2502-05730" mdate="2025-03-26">
<author pid="258/3302">Spencer Compton</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation.</title>
<year>2025</year>
<month>February</month>
<volume>abs/2502.05730</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2502.05730</ee>
<url>db/journals/corr/corr2502.html#abs-2502-05730</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2510-15790" mdate="2025-11-17">
<author pid="231/7619">Chirag Pabbaraju</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="119/0122">Rishi Verma</author>
<title>A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses.</title>
<year>2025</year>
<month>October</month>
<volume>abs/2510.15790</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2510.15790</ee>
<url>db/journals/corr/corr2510.html#abs-2510-15790</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2511-11966" mdate="2026-01-09">
<author pid="241/7331">Steven Cao</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="04/1701">Percy Liang</author>
<title>On the Entropy Calibration of Language Models.</title>
<year>2025</year>
<month>November</month>
<volume>abs/2511.11966</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2511.11966</ee>
<url>db/journals/corr/corr2511.html#abs-2511-11966</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article key="journals/jacm/MarsdenSSV24" mdate="2025-01-25">
<author orcid="0009-0003-0169-7102" pid="207/8374">Annie Marsden</author>
<author orcid="0009-0003-1280-5623" pid="126/2543">Vatsal Sharan</author>
<author orcid="0000-0003-2675-7610" pid="125/2326">Aaron Sidford</author>
<author orcid="0000-0002-2211-1073" pid="80/6006">Gregory Valiant</author>
<title>Efficient Convex Optimization Requires Superlinear Memory.</title>
<pages>41:1-41:37</pages>
<year>2024</year>
<month>December</month>
<volume>71</volume>
<journal>J. ACM</journal>
<number>6</number>
<ee>https://doi.org/10.1145/3689208</ee>
<ee>https://www.wikidata.org/entity/Q130948513</ee>
<url>db/journals/jacm/jacm71.html#MarsdenSSV24</url>
<stream>streams/journals/jacm</stream>
</article>
</r>
<r><inproceedings key="conf/innovations/Valiant24" mdate="2024-01-24">
<author pid="80/6006">Gregory Valiant</author>
<title>Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis.</title>
<pages>96:1-96:13</pages>
<year>2024</year>
<booktitle>ITCS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ITCS.2024.96</ee>
<crossref>conf/innovations/2024</crossref>
<url>db/conf/innovations/innovations2024.html#Valiant24</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/ComptonV24" mdate="2024-06-18">
<author orcid="0009-0009-4161-4651" pid="258/3302">Spencer Compton</author>
<author orcid="0000-0002-2211-1073" pid="80/6006">Gregory Valiant</author>
<title>Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances.</title>
<pages>194-200</pages>
<year>2024</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3618260.3649754</ee>
<crossref>conf/stoc/2024</crossref>
<url>db/conf/stoc/stoc2024.html#ComptonV24</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2410-13548" mdate="2024-11-24">
<author pid="211/7035">Guy Blanc</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Adaptive and oblivious statistical adversaries are equivalent.</title>
<year>2024</year>
<volume>abs/2410.13548</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2410.13548</ee>
<url>db/journals/corr/corr2410.html#abs-2410-13548</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2411-03253" mdate="2025-01-01">
<author pid="351/7355">Omar Salemohamed</author>
<author pid="48/5717">Laurent Charlin</author>
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Discovering Data Structures: Nearest Neighbor Search and Beyond.</title>
<year>2024</year>
<volume>abs/2411.03253</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2411.03253</ee>
<url>db/journals/corr/corr2411.html#abs-2411-03253</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2412-00674" mdate="2025-01-12">
<author pid="394/4704">Joey Rivkin</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities.</title>
<year>2024</year>
<volume>abs/2412.00674</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2412.00674</ee>
<url>db/journals/corr/corr2412.html#abs-2412-00674</url>
<stream>streams/journals/corr</stream>
</article>
</r>
<r><inproceedings key="conf/icml/CaoLV23" mdate="2023-08-28">
<author pid="241/7331">Steven Cao</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>One-sided Matrix Completion from Two Observations Per Row.</title>
<pages>3599-3624</pages>
<year>2023</year>
<booktitle>ICML</booktitle>
<ee type="oa">https://proceedings.mlr.press/v202/cao23d.html</ee>
<crossref>conf/icml/2023</crossref>
<url>db/conf/icml/icml2023.html#CaoLV23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ijcai/MarsdenSSV23" mdate="2023-08-28">
<author pid="207/8374">Annie Marsden</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract).</title>
<pages>6468-6473</pages>
<year>2023</year>
<booktitle>IJCAI</booktitle>
<ee type="oa">https://doi.org/10.24963/ijcai.2023/722</ee>
<crossref>conf/ijcai/2023</crossref>
<url>db/conf/ijcai/ijcai2023.html#MarsdenSSV23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/QiaoV23" mdate="2023-02-02">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Online Pen Testing.</title>
<pages>91:1-91:26</pages>
<year>2023</year>
<booktitle>ITCS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ITCS.2023.91</ee>
<crossref>conf/innovations/2023</crossref>
<url>db/conf/innovations/innovations2023.html#QiaoV23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/HuangZCWVL23" mdate="2025-06-13">
<author pid="07/4378">Qian Huang</author>
<author pid="217/2378">Eric Zelikman</author>
<author pid="348/6798">Sarah Li Chen</author>
<author pid="176/5447">Yuhuai Wu</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="04/1701">Percy Liang</author>
<title>Lexinvariant Language Models.</title>
<year>2023</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">http://papers.nips.cc/paper_files/paper/2023/hash/4b734e95f0788a030a69caa987516186-Abstract-Conference.html</ee>
<crossref>conf/nips/2023</crossref>
<url>db/conf/nips/neurips2023.html#HuangZCWVL23</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2305-16349" mdate="2023-06-07">
<author pid="07/4378">Qian Huang</author>
<author pid="217/2378">Eric Zelikman</author>
<author pid="348/6798">Sarah Li Chen</author>
<author pid="176/5447">Yuhuai Wu</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="04/1701">Percy Liang</author>
<title>Lexinvariant Language Models.</title>
<year>2023</year>
<volume>abs/2305.16349</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2305.16349</ee>
<url>db/journals/corr/corr2305.html#abs-2305-16349</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2306-04049" mdate="2023-06-13">
<author pid="241/7331">Steven Cao</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>One-sided Matrix Completion from Two Observations Per Row.</title>
<year>2023</year>
<volume>abs/2306.04049</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2306.04049</ee>
<url>db/journals/corr/corr2306.html#abs-2306-04049</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-11194" mdate="2023-11-23">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="231/7619">Chirag Pabbaraju</author>
<author pid="160/9071">Kirankumar Shiragur</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Testing with Non-identically Distributed Samples.</title>
<year>2023</year>
<volume>abs/2311.11194</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.11194</ee>
<url>db/journals/corr/corr2311.html#abs-2311-11194</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2311-16342" mdate="2023-12-04">
<author pid="80/6006">Gregory Valiant</author>
<title>Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis.</title>
<year>2023</year>
<volume>abs/2311.16342</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2311.16342</ee>
<url>db/journals/corr/corr2311.html#abs-2311-16342</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2312-02417" mdate="2024-01-02">
<author pid="258/3302">Spencer Compton</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances.</title>
<year>2023</year>
<volume>abs/2312.02417</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2312.02417</ee>
<url>db/journals/corr/corr2312.html#abs-2312-02417</url>
</article>
</r>
<r><inproceedings key="conf/colt/MarsdenSSV22" mdate="2022-07-12">
<author pid="207/8374">Annie Marsden</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Efficient Convex Optimization Requires Superlinear Memory.</title>
<pages>2390-2430</pages>
<year>2022</year>
<booktitle>COLT</booktitle>
<ee type="oa">https://proceedings.mlr.press/v178/marsden22a.html</ee>
<crossref>conf/colt/2022</crossref>
<url>db/conf/colt/colt2022.html#MarsdenSSV22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/colt/KelnerMSSVY22" mdate="2022-07-12">
<author pid="64/4772">Jonathan A. Kelner</author>
<author pid="207/8374">Annie Marsden</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="125/3654">Honglin Yuan</author>
<title>Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales.</title>
<pages>2431-2540</pages>
<year>2022</year>
<booktitle>COLT</booktitle>
<ee type="oa">https://proceedings.mlr.press/v178/kelner22a.html</ee>
<crossref>conf/colt/2022</crossref>
<url>db/conf/colt/colt2022.html#KelnerMSSVY22</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/0001TLV22" mdate="2024-01-08">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="168/4752">Dimitris Tsipras</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>What Can Transformers Learn In-Context? A Case Study of Simple Function Classes.</title>
<year>2022</year>
<crossref>conf/nips/2022</crossref>
<booktitle>NeurIPS</booktitle>
<ee type="oa">http://papers.nips.cc/paper_files/paper/2022/hash/c529dba08a146ea8d6cf715ae8930cbe-Abstract-Conference.html</ee>
<url>db/conf/nips/neurips2022.html#0001TLV22</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2201-04315" mdate="2022-01-21">
<author pid="164/8262">Brian Axelrod</author>
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="35/7252">Yanjun Han</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>On the Statistical Complexity of Sample Amplification.</title>
<year>2022</year>
<volume>abs/2201.04315</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2201.04315</ee>
<url>db/journals/corr/corr2201.html#abs-2201-04315</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2203-15260" mdate="2022-04-04">
<author pid="207/8374">Annie Marsden</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Efficient Convex Optimization Requires Superlinear Memory.</title>
<year>2022</year>
<volume>abs/2203.15260</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2203.15260</ee>
<url>db/journals/corr/corr2203.html#abs-2203-15260</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2204-12615" mdate="2022-04-28">
<author pid="188/5904">Theo Jepsen</author>
<author pid="236/7060">Stephen Ibanez</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="m/NickMcKeown">Nick McKeown</author>
<title>From Sand to Flour: The Next Leap in Granular Computing with NanoSort.</title>
<year>2022</year>
<volume>abs/2204.12615</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2204.12615</ee>
<url>db/journals/corr/corr2204.html#abs-2204-12615</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2208-01066" mdate="2022-08-09">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="168/4752">Dimitris Tsipras</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>What Can Transformers Learn In-Context? A Case Study of Simple Function Classes.</title>
<year>2022</year>
<volume>abs/2208.01066</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2208.01066</ee>
<url>db/journals/corr/corr2208.html#abs-2208-01066</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2210-00655" mdate="2022-10-07">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Online Pen Testing.</title>
<year>2022</year>
<volume>abs/2210.00655</volume>
<journal>CoRR</journal>
<ee type="oa">https://doi.org/10.48550/arXiv.2210.00655</ee>
<url>db/journals/corr/corr2210.html#abs-2210-00655</url>
</article>
</r>
<r><inproceedings key="conf/acl/ChandraKV20" mdate="2021-08-09">
<author pid="07/5865">Kartik Chandra</author>
<author pid="297/8900">Chuma Kabaghe</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Beyond Laurel/Yanny: An Autoencoder-Enabled Search for Polyperceivable Audio.</title>
<pages>593-598</pages>
<year>2021</year>
<booktitle>ACL/IJCNLP (2)</booktitle>
<ee type="oa">https://doi.org/10.18653/v1/2021.acl-short.75</ee>
<ee type="oa">https://aclanthology.org/2021.acl-short.75</ee>
<crossref>conf/acl/2021-2</crossref>
<url>db/conf/acl/acl2021-2.html#ChandraKV20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/aistats/MarsdenDV21" mdate="2021-09-02">
<author pid="207/8374">Annie Marsden</author>
<author pid="41/439">John C. Duchi</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Misspecification in Prediction Problems and Robustness via Improper Learning.</title>
<pages>2161-2169</pages>
<year>2021</year>
<booktitle>AISTATS</booktitle>
<ee type="oa">http://proceedings.mlr.press/v130/marsden21a.html</ee>
<crossref>conf/aistats/2021</crossref>
<url>db/conf/aistats/aistats2021.html#MarsdenDV21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/colt/QiaoV21" mdate="2021-08-25">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Exponential Weights Algorithms for Selective Learning.</title>
<pages>3833-3858</pages>
<year>2021</year>
<booktitle>COLT</booktitle>
<ee type="oa">http://proceedings.mlr.press/v134/qiao21a.html</ee>
<crossref>conf/colt/2021</crossref>
<url>db/conf/colt/colt2021.html#QiaoV21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/TaiBV21" mdate="2021-08-25">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Training.</title>
<pages>10065-10075</pages>
<year>2021</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v139/tai21a.html</ee>
<crossref>conf/icml/2021</crossref>
<url>db/conf/icml/icml2021.html#TaiBV21</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/QiaoV21" mdate="2022-12-07">
<author orcid="0000-0002-9182-6152" pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Stronger calibration lower bounds via sidestepping.</title>
<pages>456-466</pages>
<year>2021</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3406325.3451050</ee>
<crossref>conf/stoc/2021</crossref>
<url>db/conf/stoc/stoc2021.html#QiaoV21</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-2101-05234" mdate="2021-02-02">
<author pid="207/8374">Annie Marsden</author>
<author pid="41/439">John C. Duchi</author>
<author pid="80/6006">Gregory Valiant</author>
<title>On Misspecification in Prediction Problems and Robustness via Improper Learning.</title>
<year>2021</year>
<volume>abs/2101.05234</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2101.05234</ee>
<url>db/journals/corr/corr2101.html#abs-2101-05234</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2102-08622" mdate="2021-02-19">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Training.</title>
<year>2021</year>
<volume>abs/2102.08622</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2102.08622</ee>
<url>db/journals/corr/corr2102.html#abs-2102-08622</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2106-15662" mdate="2021-07-05">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Exponential Weights Algorithms for Selective Learning.</title>
<year>2021</year>
<volume>abs/2106.15662</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2106.15662</ee>
<url>db/journals/corr/corr2106.html#abs-2106-15662</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2111-03137" mdate="2021-11-10">
<author pid="64/4772">Jonathan A. Kelner</author>
<author pid="207/8374">Annie Marsden</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="125/3654">Honglin Yuan</author>
<title>Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales.</title>
<year>2021</year>
<volume>abs/2111.03137</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2111.03137</ee>
<url>db/journals/corr/corr2111.html#abs-2111-03137</url>
</article>
</r>
<r><inproceedings key="conf/aistats/KongBV20" mdate="2020-06-29">
<author pid="117/4343">Weihao Kong</author>
<author pid="27/1277">Emma Brunskill</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sublinear Optimal Policy Value Estimation in Contextual Bandits.</title>
<pages>4377-4387</pages>
<year>2020</year>
<booktitle>AISTATS</booktitle>
<ee type="oa">http://proceedings.mlr.press/v108/kong20b.html</ee>
<crossref>conf/aistats/2020</crossref>
<url>db/conf/aistats/aistats2020.html#KongBV20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/colt/BlancGVV20" mdate="2020-11-27">
<author pid="211/7035">Guy Blanc</author>
<author pid="09/6861-2">Neha Gupta 0002</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process.</title>
<pages>483-513</pages>
<year>2020</year>
<booktitle>COLT</booktitle>
<ee type="oa">http://proceedings.mlr.press/v125/blanc20a.html</ee>
<crossref>conf/colt/2020</crossref>
<url>db/conf/colt/colt2020.html#BlancGVV20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/Axelrod0SV20" mdate="2020-12-15">
<author pid="164/8262">Brian Axelrod</author>
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sample Amplification: Increasing Dataset Size even when Learning is Impossible.</title>
<pages>442-451</pages>
<year>2020</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v119/axelrod20a.html</ee>
<crossref>conf/icml/2020</crossref>
<url>db/conf/icml/icml2020.html#Axelrod0SV20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/WuZVR20" mdate="2021-02-04">
<author pid="06/6420-2">Sen Wu 0002</author>
<author pid="264/2660">Hongyang R. Zhang</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="r/ChristopherRe">Christopher R&#233;</author>
<title>On the Generalization Effects of Linear Transformations in Data Augmentation.</title>
<pages>10410-10420</pages>
<year>2020</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v119/wu20g.html</ee>
<crossref>conf/icml/2020</crossref>
<url>db/conf/icml/icml2020.html#WuZVR20</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/ChenVV20" mdate="2021-01-19">
<author pid="254/0805">Justin Y. Chen</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Worst-Case Analysis for Randomly Collected Data.</title>
<year>2020</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2020/hash/d34a281acc62c6bec66425f0ad6dd645-Abstract.html</ee>
<crossref>conf/nips/2020</crossref>
<url>db/conf/nips/neurips2020.html#ChenVV20</url>
</inproceedings>
</r>
<r><incollection key="books/cu/20/ValiantV20" mdate="2024-10-06">
<author pid="80/6006">Gregory Valiant</author>
<author orcid="0000-0001-5523-2974" pid="82/2417">Paul Valiant</author>
<title>Instance Optimal Distribution Testing and Learning.</title>
<pages>506-526</pages>
<year>2020</year>
<booktitle>Beyond the Worst-Case Analysis of Algorithms</booktitle>
<ee>https://doi.org/10.1017/9781108637435.029</ee>
<crossref>books/cu/20/R2020</crossref>
<url>db/books/collections/R2020.html#ValiantV20</url>
</incollection>
</r>
<r><article publtype="informal" key="journals/corr/abs-2005-00695" mdate="2020-05-08">
<author pid="06/6420-2">Sen Wu 0002</author>
<author pid="264/2660">Hongyang R. Zhang</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="r/ChristopherRe">Christopher R&#233;</author>
<title>On the Generalization Effects of Linear Transformations in Data Augmentation.</title>
<year>2020</year>
<volume>abs/2005.00695</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2005.00695</ee>
<url>db/journals/corr/corr2005.html#abs-2005-00695</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-2012-03454" mdate="2020-12-09">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Stronger Calibration Lower Bounds via Sidestepping.</title>
<year>2020</year>
<volume>abs/2012.03454</volume>
<journal>CoRR</journal>
<ee type="oa">https://arxiv.org/abs/2012.03454</ee>
<url>db/journals/corr/corr2012.html#abs-2012-03454</url>
</article>
</r>
<r><inproceedings key="conf/cogsci/GuanV19" mdate="2025-12-03">
<author pid="198/0982">Melody Y. Guan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Surprising Density of Illusionable Natural Speech.</title>
<pages>1871</pages>
<year>2019</year>
<booktitle>CogSci</booktitle>
<ee type="oa">https://escholarship.org/uc/item/1f32959f</ee>
<crossref>conf/cogsci/2019</crossref>
<url>db/conf/cogsci/cogsci2019.html#GuanV19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/colt/QiaoV19" mdate="2019-07-08">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Theory of Selective Prediction.</title>
<pages>2580-2594</pages>
<year>2019</year>
<booktitle>COLT</booktitle>
<ee type="oa">http://proceedings.mlr.press/v99/qiao19a.html</ee>
<crossref>conf/colt/2019</crossref>
<url>db/conf/colt/colt2019.html#QiaoV19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/SharanTBV19" mdate="2019-06-11">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Compressed Factorization: Fast and Accurate Low-Rank Factorization of Compressively-Sensed Data.</title>
<pages>5690-5700</pages>
<year>2019</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v97/sharan19a.html</ee>
<crossref>conf/icml/2019</crossref>
<url>db/conf/icml/icml2019.html#SharanTBV19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/TaiBV19" mdate="2019-06-11">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Equivariant Transformer Networks.</title>
<pages>6086-6095</pages>
<year>2019</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v97/tai19a.html</ee>
<crossref>conf/icml/2019</crossref>
<url>db/conf/icml/icml2019.html#TaiBV19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/VinayakKVK19" mdate="2019-07-23">
<author pid="148/9626">Ramya Korlakai Vinayak</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<title>Maximum Likelihood Estimation for Learning Populations of Parameters.</title>
<pages>6448-6457</pages>
<year>2019</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v97/vinayak19a.html</ee>
<crossref>conf/icml/2019</crossref>
<url>db/conf/icml/icml2019.html#VinayakKVK19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/GinartGVZ19" mdate="2022-07-07">
<author pid="191/3562">Antonio Ginart</author>
<author pid="198/0982">Melody Y. Guan</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="72/8399">James Zou 0001</author>
<title>Making AI Forget You: Data Deletion in Machine Learning.</title>
<pages>3513-3526</pages>
<year>2019</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2019/hash/cb79f8fa58b91d3af6c9c991f63962d3-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/8611-making-ai-forget-you-data-deletion-in-machine-learning</ee>
<crossref>conf/nips/2019</crossref>
<url>db/conf/nips/nips2019.html#GinartGVZ19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/AxelrodDSSV19" mdate="2021-01-21">
<author pid="164/8262">Brian Axelrod</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author pid="73/10824">Alistair Stewart</author>
<author pid="99/6850">Anastasios Sidiropoulos</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.</title>
<pages>7721-7733</pages>
<year>2019</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2019/hash/77cdfc1e11e36a23bb030892ee00b8cf-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/8988-a-polynomial-time-algorithm-for-log-concave-maximum-likelihood-via-locally-exponential-families</ee>
<crossref>conf/nips/2019</crossref>
<url>db/conf/nips/nips2019.html#AxelrodDSSV19</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/SharanSV19" mdate="2025-01-19">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Memory-sample tradeoffs for linear regression with small error.</title>
<pages>890-901</pages>
<year>2019</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3313276.3316403</ee>
<ee>https://www.wikidata.org/entity/Q130965688</ee>
<crossref>conf/stoc/2019</crossref>
<url>db/conf/stoc/stoc2019.html#SharanSV19</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1901-11399" mdate="2019-02-04">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Equivariant Transformer Networks.</title>
<year>2019</year>
<volume>abs/1901.11399</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1901.11399</ee>
<url>db/journals/corr/corr1901.html#abs-1901-11399</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1902-04256" mdate="2019-05-21">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Theory of Selective Prediction.</title>
<year>2019</year>
<volume>abs/1902.04256</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1902.04256</ee>
<url>db/journals/corr/corr1902.html#abs-1902-04256</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1902-04553" mdate="2019-05-21">
<author pid="148/9626">Ramya Korlakai Vinayak</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<title>Maximum Likelihood Estimation for Learning Populations of Parameters.</title>
<year>2019</year>
<volume>abs/1902.04553</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1902.04553</ee>
<url>db/journals/corr/corr1902.html#abs-1902-04553</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1904-08544" mdate="2019-04-26">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="125/2326">Aaron Sidford</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Memory-Sample Tradeoffs for Linear Regression with Small Error.</title>
<year>2019</year>
<volume>abs/1904.08544</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1904.08544</ee>
<url>db/journals/corr/corr1904.html#abs-1904-08544</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1904-09080" mdate="2020-09-04">
<author pid="211/7035">Guy Blanc</author>
<author pid="09/6861-2">Neha Gupta 0002</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like process.</title>
<year>2019</year>
<volume>abs/1904.09080</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1904.09080</ee>
<url>db/journals/corr/corr1904.html#abs-1904-09080</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1904-12053" mdate="2020-05-11">
<author pid="164/8262">Brian Axelrod</author>
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sample Amplification: Increasing Dataset Size even when Learning is Impossible.</title>
<year>2019</year>
<volume>abs/1904.12053</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1904.12053</ee>
<url>db/journals/corr/corr1904.html#abs-1904-12053</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1906-01040" mdate="2019-06-13">
<author pid="198/0982">Melody Y. Guan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Surprising Density of Illusionable Natural Speech.</title>
<year>2019</year>
<volume>abs/1906.01040</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1906.01040</ee>
<url>db/journals/corr/corr1906.html#abs-1906-01040</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1907-05012" mdate="2022-07-07">
<author pid="191/3562">Antonio Ginart</author>
<author pid="198/0982">Melody Y. Guan</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="72/8399">James Zou 0001</author>
<title>Making AI Forget You: Data Deletion in Machine Learning.</title>
<year>2019</year>
<volume>abs/1907.05012</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1907.05012</ee>
<url>db/journals/corr/corr1907.html#abs-1907-05012</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1907-08306" mdate="2019-07-23">
<author pid="164/8262">Brian Axelrod</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author pid="99/6850">Anastasios Sidiropoulos</author>
<author pid="73/10824">Alistair Stewart</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families.</title>
<year>2019</year>
<volume>abs/1907.08306</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1907.08306</ee>
<url>db/journals/corr/corr1907.html#abs-1907-08306</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1911-03605" mdate="2019-12-01">
<author pid="254/0805">Justin Y. Chen</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>How bad is worst-case data if you know where it comes from?</title>
<year>2019</year>
<volume>abs/1911.03605</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1911.03605</ee>
<url>db/journals/corr/corr1911.html#abs-1911-03605</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1912-06111" mdate="2020-01-02">
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="27/1277">Emma Brunskill</author>
<title>Sublinear Optimal Policy Value Estimation in Contextual Bandits.</title>
<year>2019</year>
<volume>abs/1912.06111</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1912.06111</ee>
<url>db/journals/corr/corr1912.html#abs-1912-06111</url>
</article>
</r>
<r><inproceedings key="conf/colt/MeisterV18" mdate="2019-04-03">
<author pid="205/2986">Michela Meister</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Data Prism: Semi-verified learning in the small-alpha regime.</title>
<pages>1530-1546</pages>
<year>2018</year>
<booktitle>COLT</booktitle>
<ee type="oa">http://proceedings.mlr.press/v75/meister18a.html</ee>
<crossref>conf/colt/2018</crossref>
<url>db/conf/colt/colt2018.html#MeisterV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/SteinhardtCV18" mdate="2023-09-30">
<author pid="35/10625">Jacob Steinhardt</author>
<author orcid="0000-0003-0807-3389" pid="c/MosesCharikar">Moses Charikar</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers.</title>
<pages>45:1-45:21</pages>
<year>2018</year>
<booktitle>ITCS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ITCS.2018.45</ee>
<crossref>conf/innovations/2018</crossref>
<url>db/conf/innovations/innovations2018.html#SteinhardtCV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/HuangKKV18" mdate="2019-07-19">
<author pid="87/7763-1">Qingqing Huang 0001</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Recovering Structured Probability Matrices.</title>
<pages>46:1-46:14</pages>
<year>2018</year>
<booktitle>ITCS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ITCS.2018.46</ee>
<crossref>conf/innovations/2018</crossref>
<url>db/conf/innovations/innovations2018.html#HuangKKV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/QiaoV18" mdate="2018-08-23">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning Discrete Distributions from Untrusted Batches.</title>
<pages>47:1-47:20</pages>
<year>2018</year>
<booktitle>ITCS</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ITCS.2018.47</ee>
<crossref>conf/innovations/2018</crossref>
<url>db/conf/innovations/innovations2018.html#QiaoV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/kdd/Cohen-SteinerKS18" mdate="2023-06-26">
<author pid="19/5307">David Cohen-Steiner</author>
<author pid="117/4343">Weihao Kong</author>
<author orcid="0000-0001-8990-3326" pid="47/2482">Christian Sohler</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Approximating the Spectrum of a Graph.</title>
<pages>1263-1271</pages>
<year>2018</year>
<booktitle>KDD</booktitle>
<ee>https://doi.org/10.1145/3219819.3220119</ee>
<crossref>conf/kdd/2018</crossref>
<url>db/conf/kdd/kdd2018.html#Cohen-SteinerKS18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/KongV18" mdate="2021-01-21">
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Estimating Learnability in the Sublinear Data Regime.</title>
<pages>5460-5469</pages>
<year>2018</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2018/hash/8bd39eae38511daad6152e84545e504d-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/7790-estimating-learnability-in-the-sublinear-data-regime</ee>
<crossref>conf/nips/2018</crossref>
<url>db/conf/nips/nips2018.html#KongV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/GargSZV18" mdate="2021-01-21">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="213/8211">Brian Hu Zhang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Spectral View of Adversarially Robust Features.</title>
<pages>10159-10169</pages>
<year>2018</year>
<booktitle>NeurIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2018/hash/033cc385728c51d97360020ed57776f0-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/8217-a-spectral-view-of-adversarially-robust-features</ee>
<crossref>conf/nips/2018</crossref>
<url>db/conf/nips/nips2018.html#GargSZV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sigmod/TaiSBV18" mdate="2018-11-21">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Sketching Linear Classifiers over Data Streams.</title>
<pages>757-772</pages>
<year>2018</year>
<booktitle>SIGMOD Conference</booktitle>
<ee>https://doi.org/10.1145/3183713.3196930</ee>
<crossref>conf/sigmod/2018</crossref>
<url>db/conf/sigmod/sigmod2018.html#TaiSBV18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/SharanKLV18" mdate="2019-07-23">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Prediction with a short memory.</title>
<pages>1074-1087</pages>
<year>2018</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3188745.3188954</ee>
<crossref>conf/stoc/2018</crossref>
<url>db/conf/stoc/stoc2018.html#SharanKLV18</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1805-01626" mdate="2018-08-13">
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Estimating Learnability in the Sublinear Data Regime.</title>
<year>2018</year>
<volume>abs/1805.01626</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1805.01626</ee>
<url>db/journals/corr/corr1805.html#abs-1805-01626</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1811-03204" mdate="2018-11-22">
<author pid="164/8262">Brian Axelrod</author>
<author pid="80/6006">Gregory Valiant</author>
<title>An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood.</title>
<year>2018</year>
<volume>abs/1811.03204</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1811.03204</ee>
<url>db/journals/corr/corr1811.html#abs-1811-03204</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1811-06609" mdate="2020-05-11">
<author pid="168/8775-1">Shivam Garg 0001</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="213/8211">Brian Hu Zhang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Spectral View of Adversarially Robust Features.</title>
<year>2018</year>
<volume>abs/1811.06609</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1811.06609</ee>
<url>db/journals/corr/corr1811.html#abs-1811-06609</url>
</article>
</r>
<r><article key="journals/jacm/ValiantV17" mdate="2018-11-06">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Estimating the Unseen: Improved Estimators for Entropy and Other Properties.</title>
<pages>37:1-37:41</pages>
<year>2017</year>
<volume>64</volume>
<journal>J. ACM</journal>
<number>6</number>
<ee>https://doi.org/10.1145/3125643</ee>
<url>db/journals/jacm/jacm64.html#ValiantV17</url>
</article>
</r>
<r><article key="journals/siamcomp/ValiantV17" mdate="2017-05-27">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>An Automatic Inequality Prover and Instance Optimal Identity Testing.</title>
<pages>429-455</pages>
<year>2017</year>
<volume>46</volume>
<journal>SIAM J. Comput.</journal>
<number>1</number>
<ee>https://doi.org/10.1137/151002526</ee>
<url>db/journals/siamcomp/siamcomp46.html#ValiantV17</url>
</article>
</r>
<r><inproceedings key="conf/icml/RaghunathanVZ17" mdate="2022-12-22">
<author pid="166/1409">Aditi Raghunathan</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="72/8399">James Zou 0001</author>
<title>Estimating the unseen from multiple populations.</title>
<pages>2855-2863</pages>
<year>2017</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v70/raghunathan17a.html</ee>
<crossref>conf/icml/2017</crossref>
<url>db/conf/icml/icml2017.html#RaghunathanVZ17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/SharanV17" mdate="2019-04-03">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use.</title>
<pages>3095-3104</pages>
<year>2017</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v70/sharan17a.html</ee>
<crossref>conf/icml/2017</crossref>
<url>db/conf/icml/icml2017.html#SharanV17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/SharanKLV17" mdate="2021-01-21">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning Overcomplete HMMs.</title>
<pages>940-949</pages>
<year>2017</year>
<booktitle>NIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2017/hash/6aca97005c68f1206823815f66102863-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/6695-learning-overcomplete-hmms</ee>
<crossref>conf/nips/2017</crossref>
<url>db/conf/nips/nips2017.html#SharanKLV17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/TianKV17" mdate="2021-01-21">
<author pid="37/2934">Kevin Tian</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning Populations of Parameters.</title>
<pages>5778-5787</pages>
<year>2017</year>
<booktitle>NIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2017/hash/bc4e356fee1972242c8f7eabf4dff517-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/7160-learning-populations-of-parameters</ee>
<crossref>conf/nips/2017</crossref>
<url>db/conf/nips/nips2017.html#TianKV17</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/CharikarSV17" mdate="2023-09-30">
<author orcid="0000-0003-0807-3389" pid="c/MosesCharikar">Moses Charikar</author>
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning from untrusted data.</title>
<pages>47-60</pages>
<year>2017</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/3055399.3055491</ee>
<crossref>conf/stoc/2017</crossref>
<url>db/conf/stoc/stoc2017.html#CharikarSV17</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/SharanV17" mdate="2018-08-13">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Orthogonalized ALS: A Theoretically Principled Tensor Decomposition Algorithm for Practical Use.</title>
<year>2017</year>
<volume>abs/1703.01804</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1703.01804</ee>
<url>db/journals/corr/corr1703.html#SharanV17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SteinhardtCV17" mdate="2018-08-13">
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="c/MosesCharikar">Moses Charikar</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers.</title>
<year>2017</year>
<volume>abs/1703.04940</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1703.04940</ee>
<url>db/journals/corr/corr1703.html#SteinhardtCV17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SharanTBV17" mdate="2018-08-13">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>There and Back Again: A General Approach to Learning Sparse Models.</title>
<year>2017</year>
<volume>abs/1706.08146</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1706.08146</ee>
<url>db/journals/corr/corr1706.html#SharanTBV17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/RaghunathanVZ17" mdate="2022-12-22">
<author pid="166/1409">Aditi Raghunathan</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="72/8399">James Zou 0001</author>
<title>Estimating the unseen from multiple populations.</title>
<year>2017</year>
<volume>abs/1707.03854</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1707.03854</ee>
<url>db/journals/corr/corr1707.html#RaghunathanVZ17</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1708-02740" mdate="2018-08-13">
<author pid="205/2986">Michela Meister</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A Data Prism: Semi-Verified Learning in the Small-Alpha Regime.</title>
<year>2017</year>
<volume>abs/1708.02740</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1708.02740</ee>
<url>db/journals/corr/corr1708.html#abs-1708-02740</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1709-02707" mdate="2018-08-13">
<author pid="37/2934">Kevin Tian</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Optimally Learning Populations of Parameters.</title>
<year>2017</year>
<volume>abs/1709.02707</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1709.02707</ee>
<url>db/journals/corr/corr1709.html#abs-1709-02707</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1711-02305" mdate="2018-08-13">
<author pid="160/8934">Kai Sheng Tai</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="47/8816">Peter Bailis</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Finding Heavily-Weighted Features in Data Streams.</title>
<year>2017</year>
<volume>abs/1711.02305</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1711.02305</ee>
<url>db/journals/corr/corr1711.html#abs-1711-02305</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1711-02309" mdate="2019-07-23">
<author pid="126/2543">Vatsal Sharan</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="04/1701">Percy Liang</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning Overcomplete HMMs.</title>
<year>2017</year>
<volume>abs/1711.02309</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1711.02309</ee>
<url>db/journals/corr/corr1711.html#abs-1711-02309</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1711-08113" mdate="2018-08-13">
<author pid="185/0592">Mingda Qiao</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning Discrete Distributions from Untrusted Batches.</title>
<year>2017</year>
<volume>abs/1711.08113</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1711.08113</ee>
<url>db/journals/corr/corr1711.html#abs-1711-08113</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/abs-1712-01725" mdate="2018-08-13">
<author pid="19/5307">David Cohen-Steiner</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="47/2482">Christian Sohler</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Approximating the Spectrum of a Graph.</title>
<year>2017</year>
<volume>abs/1712.01725</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1712.01725</ee>
<url>db/journals/corr/corr1712.html#abs-1712-01725</url>
</article>
</r>
<r><inproceedings key="conf/colt/SteinhardtVW16" mdate="2019-05-29">
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="96/1273">Stefan Wager</author>
<title>Memory, Communication, and Statistical Queries.</title>
<pages>1490-1516</pages>
<year>2016</year>
<booktitle>COLT</booktitle>
<ee type="oa">http://proceedings.mlr.press/v49/steinhardt16.html</ee>
<crossref>conf/colt/2016</crossref>
<url>db/conf/colt/colt2016.html#SteinhardtVW16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/esa/CrouchMVW16" mdate="2021-10-14">
<author orcid="0000-0002-6792-2363" pid="02/9962">Michael S. Crouch</author>
<author pid="51/1169">Andrew McGregor 0001</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="w/DPWoodruff">David P. Woodruff</author>
<title>Stochastic Streams: Sample Complexity vs. Space Complexity.</title>
<pages>32:1-32:15</pages>
<year>2016</year>
<booktitle>ESA</booktitle>
<ee type="oa">https://doi.org/10.4230/LIPIcs.ESA.2016.32</ee>
<crossref>conf/esa/2016</crossref>
<url>db/conf/esa/esa2016.html#CrouchMVW16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/SteinhardtVC16" mdate="2021-01-21">
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="c/MosesCharikar">Moses Charikar</author>
<title>Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction.</title>
<pages>4439-4447</pages>
<year>2016</year>
<booktitle>NIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2016/hash/0a87257e5308197df43230edf4ad1dae-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/6440-avoiding-imposters-and-delinquents-adversarial-crowdsourcing-and-peer-prediction</ee>
<crossref>conf/nips/2016</crossref>
<url>db/conf/nips/nips2016.html#SteinhardtVC16</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/ValiantV16" mdate="2018-11-06">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Instance optimal learning of discrete distributions.</title>
<pages>142-155</pages>
<year>2016</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/2897518.2897641</ee>
<crossref>conf/stoc/2016</crossref>
<url>db/conf/stoc/stoc2016.html#ValiantV16</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/KongV16" mdate="2018-08-13">
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Spectrum Estimation from Samples.</title>
<year>2016</year>
<volume>abs/1602.00061</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1602.00061</ee>
<url>db/journals/corr/corr1602.html#KongV16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/HuangKKV16" mdate="2019-07-19">
<author pid="87/7763-1">Qingqing Huang 0001</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="117/4343">Weihao Kong</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Recovering Structured Probability Matrices.</title>
<year>2016</year>
<volume>abs/1602.06586</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1602.06586</ee>
<url>db/journals/corr/corr1602.html#HuangKKV16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/ValiantV16" mdate="2018-08-13">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Information Theoretically Secure Databases.</title>
<year>2016</year>
<volume>abs/1605.02646</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1605.02646</ee>
<url>db/journals/corr/corr1605.html#ValiantV16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/SteinhardtVC16" mdate="2018-08-13">
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="c/MosesCharikar">Moses Charikar</author>
<title>Avoiding Imposters and Delinquents: Adversarial Crowdsourcing and Peer Prediction.</title>
<year>2016</year>
<volume>abs/1606.05374</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1606.05374</ee>
<url>db/journals/corr/corr1606.html#SteinhardtVC16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/CharikarSV16" mdate="2018-08-13">
<author pid="c/MosesCharikar">Moses Charikar</author>
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Learning from Untrusted Data.</title>
<year>2016</year>
<volume>abs/1611.02315</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1611.02315</ee>
<url>db/journals/corr/corr1611.html#CharikarSV16</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/KakadeLSV16" mdate="2018-08-13">
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="04/1701">Percy Liang</author>
<author pid="126/2543">Vatsal Sharan</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Prediction with a Short Memory.</title>
<year>2016</year>
<volume>abs/1612.02526</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1612.02526</ee>
<url>db/journals/corr/corr1612.html#KakadeLSV16</url>
</article>
</r>
<r><article publtype="informal" key="journals/eccc/ValiantV16" mdate="2022-09-27">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Information Theoretically Secure Databases.</title>
<publnr>TR16-078</publnr>
<year>2016</year>
<volume>TR16</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2016/078</ee>
<url>db/journals/eccc/eccc23.html#ValiantV16</url>
</article>
</r>
<r><article key="journals/jacm/Valiant15" mdate="2018-11-06">
<author pid="80/6006">Gregory Valiant</author>
<title>Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem.</title>
<pages>13:1-13:45</pages>
<year>2015</year>
<volume>62</volume>
<journal>J. ACM</journal>
<number>2</number>
<ee>https://doi.org/10.1145/2728167</ee>
<url>db/journals/jacm/jacm62.html#Valiant15</url>
</article>
</r>
<r><inproceedings key="conf/nips/BhattacharyaV15" mdate="2021-01-21">
<author pid="07/8038">Bhaswar B. Bhattacharya</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Testing Closeness With Unequal Sized Samples.</title>
<pages>2611-2619</pages>
<year>2015</year>
<booktitle>NIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2015/hash/5cce8dede893813f879b873962fb669f-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/5908-testing-closeness-with-unequal-sized-samples</ee>
<crossref>conf/nips/2015</crossref>
<url>db/conf/nips/nips2015.html#BhattacharyaV15</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/BhattacharyaV15" mdate="2018-08-13">
<author pid="07/8038">Bhaswar B. Bhattacharya</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Testing Closeness With Unequal Sized Samples.</title>
<year>2015</year>
<volume>abs/1504.04599</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1504.04599</ee>
<url>db/journals/corr/corr1504.html#BhattacharyaV15</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/ValiantV15" mdate="2018-08-13">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Instance Optimal Learning.</title>
<year>2015</year>
<volume>abs/1504.05321</volume>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1504.05321</ee>
<url>db/journals/corr/corr1504.html#ValiantV15</url>
</article>
</r>
<r><article publtype="informal" key="journals/eccc/SteinhardtVW15" mdate="2022-09-27">
<author pid="35/10625">Jacob Steinhardt</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="96/1273">Stefan Wager</author>
<title>Memory, Communication, and Statistical Queries.</title>
<publnr>TR15-126</publnr>
<year>2015</year>
<volume>TR15</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2015/126</ee>
<url>db/journals/eccc/eccc22.html#SteinhardtVW15</url>
</article>
</r>
<r><inproceedings key="conf/focs/ValiantV14" mdate="2023-03-23">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>An Automatic Inequality Prover and Instance Optimal Identity Testing.</title>
<pages>51-60</pages>
<year>2014</year>
<booktitle>FOCS</booktitle>
<ee>https://doi.org/10.1109/FOCS.2014.14</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.14</ee>
<crossref>conf/focs/2014</crossref>
<url>db/conf/focs/focs2014.html#ValiantV14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/focs/LivnatPRVW14" mdate="2023-03-23">
<author pid="117/9201">Adi Livnat</author>
<author pid="p/CHPapadimitriou">Christos H. Papadimitriou</author>
<author pid="11/10308">Aviad Rubinstein</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="12/3708">Andrew Wan</author>
<title>Satisfiability and Evolution.</title>
<pages>524-530</pages>
<year>2014</year>
<booktitle>FOCS</booktitle>
<ee>https://doi.org/10.1109/FOCS.2014.62</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/FOCS.2014.62</ee>
<crossref>conf/focs/2014</crossref>
<url>db/conf/focs/focs2014.html#LivnatPRVW14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/AgarwalKKSV14" mdate="2019-05-29">
<author pid="24/4383">Alekh Agarwal</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="91/8774">Nikos Karampatziakis</author>
<author pid="94/3481">Le Song</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Least Squares Revisited: Scalable Approaches for Multi-class Prediction.</title>
<pages>541-549</pages>
<year>2014</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v32/agarwala14.html</ee>
<crossref>conf/icml/2014</crossref>
<url>db/conf/icml/icml2014.html#AgarwalKKSV14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/icml/AndoniPV014" mdate="2019-05-29">
<author pid="66/6009">Alexandr Andoni</author>
<author pid="p/RinaPanigrahy">Rina Panigrahy</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="89/5992-1">Li Zhang 0001</author>
<title>Learning Polynomials with Neural Networks.</title>
<pages>1908-1916</pages>
<year>2014</year>
<booktitle>ICML</booktitle>
<ee type="oa">http://proceedings.mlr.press/v32/andoni14.html</ee>
<crossref>conf/icml/2014</crossref>
<url>db/conf/icml/icml2014.html#AndoniPV014</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/AndoniPV014" mdate="2021-02-02">
<author pid="66/6009">Alexandr Andoni</author>
<author pid="p/RinaPanigrahy">Rina Panigrahy</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="89/5992-1">Li Zhang 0001</author>
<title>Learning Sparse Polynomial Functions.</title>
<pages>500-510</pages>
<year>2014</year>
<booktitle>SODA</booktitle>
<ee type="oa">https://doi.org/10.1137/1.9781611973402.37</ee>
<crossref>conf/soda/2014</crossref>
<url>db/conf/soda/soda2014.html#AndoniPV014</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/ChanDVV14" mdate="2023-09-14">
<author pid="63/1782">Siu On Chan</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author pid="82/2417">Paul Valiant</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Optimal Algorithms for Testing Closeness of Discrete Distributions.</title>
<pages>1193-1203</pages>
<year>2014</year>
<booktitle>SODA</booktitle>
<ee type="oa">https://doi.org/10.1137/1.9781611973402.88</ee>
<crossref>conf/soda/2014</crossref>
<url>db/conf/soda/soda2014.html#ChanDVV14</url>
</inproceedings>
</r>
<r><inproceedings key="conf/nips/ValiantV13" mdate="2021-01-21">
<author pid="82/2417">Paul Valiant</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Estimating the Unseen: Improved Estimators for Entropy and other Properties.</title>
<pages>2157-2165</pages>
<year>2013</year>
<booktitle>NIPS</booktitle>
<ee type="oa">https://proceedings.neurips.cc/paper/2013/hash/53c04118df112c13a8c34b38343b9c10-Abstract.html</ee>
<ee type="oa">http://papers.nips.cc/paper/5170-estimating-the-unseen-improved-estimators-for-entropy-and-other-properties</ee>
<crossref>conf/nips/2013</crossref>
<url>db/conf/nips/nips2013.html#ValiantV13</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/DaskalakisDSVV13" mdate="2024-08-04">
<author pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author orcid="0000-0003-2407-543X" pid="s/RAServedio">Rocco A. Servedio</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Testing <i>k</i>-Modal Distributions: Optimal Algorithms via Reductions.</title>
<pages>1833-1852</pages>
<year>2013</year>
<booktitle>SODA</booktitle>
<ee type="oa">https://doi.org/10.1137/1.9781611973105.131</ee>
<crossref>conf/soda/2013</crossref>
<url>db/conf/soda/soda2013.html#DaskalakisDSVV13</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/MosselPV13" mdate="2018-08-13">
<author pid="m/EMossel">Elchanan Mossel</author>
<author pid="41/10720">Anupam Prakash</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Computation in anonymous networks.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1306.4151</ee>
<volume>abs/1306.4151</volume>
<url>db/journals/corr/corr1306.html#MosselPV13</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/ChanDVV13" mdate="2023-09-14">
<author pid="63/1782">Siu On Chan</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Optimal Algorithms for Testing Closeness of Discrete Distributions.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1308.3946</ee>
<volume>abs/1308.3946</volume>
<url>db/journals/corr/corr1308.html#ChanDVV13</url>
</article>
</r>
<r><article publtype="informal" key="journals/corr/AgarwalKKSV13" mdate="2018-08-13">
<author pid="24/4383">Alekh Agarwal</author>
<author pid="s/SMKakade">Sham M. Kakade</author>
<author pid="91/8774">Nikos Karampatziakis</author>
<author pid="94/3481">Le Song</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Least Squares Revisited: Scalable Approaches for Multi-class Prediction.</title>
<year>2013</year>
<journal>CoRR</journal>
<ee type="oa">http://arxiv.org/abs/1310.1949</ee>
<volume>abs/1310.1949</volume>
<url>db/journals/corr/corr1310.html#AgarwalKKSV13</url>
</article>
</r>
<r><article publtype="informal" key="journals/eccc/ValiantV13" mdate="2022-09-27">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Instance-by-instance optimal identity testing.</title>
<publnr>TR13-111</publnr>
<year>2013</year>
<volume>TR13</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2013/111</ee>
<url>db/journals/eccc/eccc20.html#ValiantV13</url>
</article>
</r>
<r><phdthesis key="phd/us/Valiant12" mdate="2022-06-22">
<author pid="80/6006">Gregory Valiant</author>
<title>Algorithmic Approaches to Statistical Questions.</title>
<school>University of California, Berkeley, USA</school>
<year>2012</year>
<ee>https://www.escholarship.org/uc/item/6398n1j7</ee>
</phdthesis>
</r>
<r><article key="journals/cacm/KalaiMV12" mdate="2018-11-06">
<author pid="k/AdamTaumanKalai">Adam Tauman Kalai</author>
<author pid="04/952">Ankur Moitra</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Disentangling Gaussians.</title>
<pages>113-120</pages>
<year>2012</year>
<volume>55</volume>
<journal>Commun. ACM</journal>
<number>2</number>
<ee>https://doi.org/10.1145/2076450.2076474</ee>
<url>db/journals/cacm/cacm55.html#KalaiMV12</url>
</article>
</r>
<r><article key="journals/jacm/GottlobLVV12" mdate="2019-06-02">
<author orcid="0000-0002-2353-5230" pid="g/GeorgGottlob">Georg Gottlob</author>
<author pid="98/5496">Stephanie Tien Lee</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Size and Treewidth Bounds for Conjunctive Queries.</title>
<pages>16:1-16:35</pages>
<year>2012</year>
<volume>59</volume>
<journal>J. ACM</journal>
<number>3</number>
<ee>https://doi.org/10.1145/2220357.2220363</ee>
<ee>https://www.wikidata.org/entity/Q59259504</ee>
<url>db/journals/jacm/jacm59.html#GottlobLVV12</url>
</article>
</r>
<r><inproceedings key="conf/focs/Valiant12" mdate="2023-03-23">
<author pid="80/6006">Gregory Valiant</author>
<title>Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas.</title>
<pages>11-20</pages>
<year>2012</year>
<booktitle>FOCS</booktitle>
<ee>https://doi.org/10.1109/FOCS.2012.27</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.27</ee>
<crossref>conf/focs/2012</crossref>
<url>db/conf/focs/focs2012.html#Valiant12</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/eccc/Valiant12" mdate="2022-09-27">
<author pid="80/6006">Gregory Valiant</author>
<title>Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas with Noise.</title>
<publnr>TR12-006</publnr>
<year>2012</year>
<volume>TR12</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2012/006</ee>
<url>db/journals/eccc/eccc19.html#Valiant12</url>
</article>
</r>
<r><article publtype="informal" key="journals/tinytocs/Valiant12" mdate="2025-10-27">
<author pid="80/6006">Gregory Valiant</author>
<title>Beating brute-force: Improved algorithms for finding correlations, and related problems.</title>
<year>2012</year>
<volume>1</volume>
<journal>Tiny Trans. Comput. Sci.</journal>
<ee type="archive">http://tinytocs.org/vol1/papers/tinytocs-v1-valiant.pdf</ee>
<url>db/journals/tinytocs/tinytocs1.html#Valiant12</url>
</article>
</r>
<r><article key="journals/sigecom/NisanSVZ11" mdate="2020-06-04">
<author pid="n/NoamNisan">Noam Nisan</author>
<author pid="15/5634">Michael Schapira</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="92/4269">Aviv Zohar</author>
<title>When is it best to best-respond?</title>
<pages>16-18</pages>
<year>2011</year>
<volume>10</volume>
<journal>SIGecom Exch.</journal>
<number>2</number>
<ee>https://doi.org/10.1145/1998549.1998552</ee>
<url>db/journals/sigecom/sigecom10.html#NisanSVZ11</url>
</article>
</r>
<r><inproceedings key="conf/focs/ValiantV11" mdate="2023-03-23">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>The Power of Linear Estimators.</title>
<pages>403-412</pages>
<year>2011</year>
<booktitle>FOCS</booktitle>
<ee>https://doi.org/10.1109/FOCS.2011.81</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/FOCS.2011.81</ee>
<crossref>conf/focs/2011</crossref>
<url>db/conf/focs/focs2011.html#ValiantV11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/NisanSVZ11" mdate="2019-09-04">
<author pid="n/NoamNisan">Noam Nisan</author>
<author pid="15/5634">Michael Schapira</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="92/4269">Aviv Zohar</author>
<title>Best-Response Mechanisms.</title>
<pages>155-165</pages>
<year>2011</year>
<booktitle>ICS</booktitle>
<ee>http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/24.html</ee>
<crossref>conf/innovations/2011</crossref>
<url>db/conf/innovations/innovations2011.html#NisanSVZ11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/podc/NisanSVZ11" mdate="2020-10-25">
<author orcid="0000-0003-3106-6304" pid="n/NoamNisan">Noam Nisan</author>
<author pid="15/5634">Michael Schapira</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="92/4269">Aviv Zohar</author>
<title>Incentive-compatible distributed greedy protocols.</title>
<pages>335-336</pages>
<year>2011</year>
<booktitle>PODC</booktitle>
<ee>https://doi.org/10.1145/1993806.1993871</ee>
<crossref>conf/podc/2011</crossref>
<url>db/conf/podc/podc2011.html#NisanSVZ11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sigecom/NisanSVZ11" mdate="2020-10-25">
<author orcid="0000-0003-3106-6304" pid="n/NoamNisan">Noam Nisan</author>
<author pid="15/5634">Michael Schapira</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="92/4269">Aviv Zohar</author>
<title>Best-response auctions.</title>
<pages>351-360</pages>
<year>2011</year>
<booktitle>EC</booktitle>
<ee>https://doi.org/10.1145/1993574.1993633</ee>
<crossref>conf/sigecom/2011</crossref>
<url>db/conf/sigecom/sigecom2011.html#NisanSVZ11</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/ValiantV11" mdate="2018-11-06">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs.</title>
<pages>685-694</pages>
<year>2011</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/1993636.1993727</ee>
<crossref>conf/stoc/2011</crossref>
<url>db/conf/stoc/stoc2011.html#ValiantV11</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1112-5659" mdate="2018-08-13">
<author pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</author>
<author pid="d/IliasDiakonikolas">Ilias Diakonikolas</author>
<author pid="s/RAServedio">Rocco A. Servedio</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Testing $k$-Modal Distributions: Optimal Algorithms via Reductions</title>
<ee type="oa">http://arxiv.org/abs/1112.5659</ee>
<year>2011</year>
<journal>CoRR</journal>
<volume>abs/1112.5659</volume>
<url>db/journals/corr/corr1112.html#abs-1112-5659</url>
</article>
</r>
<r><article key="journals/rsa/ValiantR10" mdate="2017-05-26">
<author pid="80/6006">Gregory Valiant</author>
<author pid="r/TimRoughgarden">Tim Roughgarden</author>
<title>Braess's Paradox in large random graphs.</title>
<pages>495-515</pages>
<year>2010</year>
<volume>37</volume>
<journal>Random Struct. Algorithms</journal>
<number>4</number>
<ee>https://doi.org/10.1002/rsa.20325</ee>
<url>db/journals/rsa/rsa37.html#ValiantR10</url>
</article>
</r>
<r><article key="journals/siamcomp/ChenRV10" mdate="2017-06-08">
<author orcid="0000-0002-6171-9962" pid="83/6707">Ho-Lin Chen</author>
<author pid="r/TimRoughgarden">Tim Roughgarden</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Designing Network Protocols for Good Equilibria.</title>
<pages>1799-1832</pages>
<year>2010</year>
<volume>39</volume>
<journal>SIAM J. Comput.</journal>
<number>5</number>
<ee>https://doi.org/10.1137/08072721X</ee>
<url>db/journals/siamcomp/siamcomp39.html#ChenRV10</url>
</article>
</r>
<r><inproceedings key="conf/focs/MoitraV10" mdate="2023-03-23">
<author pid="04/952">Ankur Moitra</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Settling the Polynomial Learnability of Mixtures of Gaussians.</title>
<pages>93-102</pages>
<year>2010</year>
<booktitle>FOCS</booktitle>
<ee>https://doi.org/10.1109/FOCS.2010.15</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/FOCS.2010.15</ee>
<crossref>conf/focs/2010</crossref>
<url>db/conf/focs/focs2010.html#MoitraV10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/innovations/PapadimitriouV10" mdate="2019-09-04">
<author pid="p/CHPapadimitriou">Christos H. Papadimitriou</author>
<author pid="80/6006">Gregory Valiant</author>
<title>A New Look at Selfish Routing.</title>
<pages>178-187</pages>
<year>2010</year>
<booktitle>ICS</booktitle>
<ee>http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/15.html</ee>
<crossref>conf/innovations/2010</crossref>
<url>db/conf/innovations/innovations2010.html#PapadimitriouV10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/sagt/DaskalakisFPPV10" mdate="2018-11-02">
<author pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</author>
<author orcid="0000-0002-0170-7572" pid="62/10262">Rafael M. Frongillo</author>
<author pid="p/CHPapadimitriou">Christos H. Papadimitriou</author>
<author pid="42/1616">George Pierrakos</author>
<author pid="80/6006">Gregory Valiant</author>
<title>On Learning Algorithms for Nash Equilibria.</title>
<pages>114-125</pages>
<year>2010</year>
<booktitle>SAGT</booktitle>
<ee>https://doi.org/10.1007/978-3-642-16170-4_11</ee>
<crossref>conf/sagt/2010</crossref>
<url>db/conf/sagt/sagt2010.html#DaskalakisFPPV10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/stoc/KalaiMV10" mdate="2018-11-06">
<author pid="k/AdamTaumanKalai">Adam Tauman Kalai</author>
<author pid="04/952">Ankur Moitra</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Efficiently learning mixtures of two Gaussians.</title>
<pages>553-562</pages>
<year>2010</year>
<booktitle>STOC</booktitle>
<ee>https://doi.org/10.1145/1806689.1806765</ee>
<crossref>conf/stoc/2010</crossref>
<url>db/conf/stoc/stoc2010.html#KalaiMV10</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-1004-4223" mdate="2018-08-13">
<author pid="04/952">Ankur Moitra</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Settling the Polynomial Learnability of Mixtures of Gaussians</title>
<ee type="oa">http://arxiv.org/abs/1004.4223</ee>
<year>2010</year>
<journal>CoRR</journal>
<volume>abs/1004.4223</volume>
<url>db/journals/corr/corr1004.html#abs-1004-4223</url>
</article>
</r>
<r><article publtype="informal" key="journals/eccc/ValiantV10b" mdate="2022-09-27">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>A CLT and tight lower bounds for estimating entropy.</title>
<publnr>TR10-179</publnr>
<year>2010</year>
<volume>TR10</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2010/179</ee>
<url>db/journals/eccc/eccc17.html#ValiantV10b</url>
</article>
</r>
<r><article publtype="informal" key="journals/eccc/ValiantV10c" mdate="2022-09-27">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Estimating the unseen: A sublinear-sample canonical estimator of distributions.</title>
<publnr>TR10-180</publnr>
<year>2010</year>
<volume>TR10</volume>
<journal>Electron. Colloquium Comput. Complex.</journal>
<ee type="oa">https://eccc.weizmann.ac.il/report/2010/180</ee>
<url>db/journals/eccc/eccc17.html#ValiantV10c</url>
</article>
</r>
<r><inproceedings key="conf/pods/GottlobLV09" mdate="2026-02-19">
<author orcid="0000-0002-2353-5230" pid="g/GeorgGottlob">Georg Gottlob</author>
<author pid="98/5496">Stephanie Tien Lee</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Size and treewidth bounds for conjunctive queries.</title>
<pages>45-54</pages>
<year>2009</year>
<booktitle>PODS</booktitle>
<ee type="oa">https://doi.org/10.1145/1559795.1559804</ee>
<ee>https://www.wikidata.org/entity/Q59259603</ee>
<crossref>conf/pods/2009</crossref>
<url>db/conf/pods/pods2009.html#GottlobLV09</url>
</inproceedings>
</r>
<r><inproceedings key="conf/soda/DaskalakisSVV09" mdate="2023-06-26">
<author pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</author>
<author orcid="0000-0001-6878-0670" pid="21/1633">Grant Schoenebeck</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>On the complexity of Nash equilibria of action-graph games.</title>
<pages>710-719</pages>
<year>2009</year>
<booktitle>SODA</booktitle>
<ee>https://doi.org/10.1137/1.9781611973068.78</ee>
<ee type="oa">http://dl.acm.org/citation.cfm?id=1496770.1496848</ee>
<crossref>conf/soda/2009</crossref>
<url>db/conf/soda/soda2009.html#DaskalakisSVV09</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-0909-2030" mdate="2018-08-13">
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>Size Bounds for Conjunctive Queries with General Functional Dependencies</title>
<ee type="oa">http://arxiv.org/abs/0909.2030</ee>
<year>2009</year>
<journal>CoRR</journal>
<volume>abs/0909.2030</volume>
<url>db/journals/corr/corr0909.html#abs-0909-2030</url>
</article>
</r>
<r><inproceedings key="conf/soda/ChenRV08" mdate="2012-12-07">
<author pid="83/6707">Ho-Lin Chen</author>
<author pid="r/TimRoughgarden">Tim Roughgarden</author>
<author pid="80/6006">Gregory Valiant</author>
<title>Designing networks with good equilibria.</title>
<pages>854-863</pages>
<year>2008</year>
<booktitle>SODA</booktitle>
<ee>http://dl.acm.org/citation.cfm?id=1347082.1347176</ee>
<crossref>conf/soda/2008</crossref>
<url>db/conf/soda/soda2008.html#ChenRV08</url>
</inproceedings>
</r>
<r><article publtype="informal" key="journals/corr/abs-0802-1604" mdate="2018-08-13">
<author pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</author>
<author pid="21/1633">Grant Schoenebeck</author>
<author pid="80/6006">Gregory Valiant</author>
<author pid="82/2417">Paul Valiant</author>
<title>On the Complexity of Nash Equilibria of Action-Graph Games</title>
<ee type="oa">http://arxiv.org/abs/0802.1604</ee>
<year>2008</year>
<journal>CoRR</journal>
<volume>abs/0802.1604</volume>
<url>db/journals/corr/corr0802.html#abs-0802-1604</url>
</article>
</r>
<r><inproceedings key="conf/sigecom/ValiantR06" mdate="2018-11-06">
<author pid="80/6006">Gregory Valiant</author>
<author pid="r/TimRoughgarden">Tim Roughgarden</author>
<title>Braess's paradox in large random graphs.</title>
<pages>296-305</pages>
<year>2006</year>
<crossref>conf/sigecom/2006</crossref>
<booktitle>EC</booktitle>
<ee>https://doi.org/10.1145/1134707.1134740</ee>
<url>db/conf/sigecom/sigecom2006.html#ValiantR06</url>
</inproceedings>
</r>
<coauthors n="89" nc="1">
<co c="0"><na f="a/Agarwal:Alekh" pid="24/4383">Alekh Agarwal</na></co>
<co c="0"><na f="a/Andoni:Alexandr" pid="66/6009">Alexandr Andoni</na></co>
<co c="0"><na f="a/Axelrod:Brian" pid="164/8262">Brian Axelrod</na></co>
<co c="0"><na f="b/Bailis:Peter" pid="47/8816">Peter Bailis</na></co>
<co c="-1"><na f="b/Bhattacharya:Bhaswar_B=" pid="07/8038">Bhaswar B. Bhattacharya</na></co>
<co c="0"><na f="b/Blanc:Guy" pid="211/7035">Guy Blanc</na></co>
<co c="0"><na f="b/Brunskill:Emma" pid="27/1277">Emma Brunskill</na></co>
<co c="0"><na f="c/Cao:Steven" pid="241/7331">Steven Cao</na></co>
<co c="0"><na f="c/Chan:Siu_On" pid="63/1782">Siu On Chan</na></co>
<co c="0"><na f="c/Chandra:Kartik" pid="07/5865">Kartik Chandra</na></co>
<co c="0"><na f="c/Charikar:Moses" pid="c/MosesCharikar">Moses Charikar</na></co>
<co c="0"><na f="c/Charlin:Laurent" pid="48/5717">Laurent Charlin</na></co>
<co c="0"><na f="c/Chen:Ho=Lin" pid="83/6707">Ho-Lin Chen</na></co>
<co c="0"><na f="c/Chen:Justin_Y=" pid="254/0805">Justin Y. Chen</na></co>
<co c="0"><na f="c/Chen:Sarah_Li" pid="348/6798">Sarah Li Chen</na></co>
<co c="0"><na f="c/Cohen=Steiner:David" pid="19/5307">David Cohen-Steiner</na></co>
<co c="0"><na f="c/Compton:Spencer" pid="258/3302">Spencer Compton</na></co>
<co c="0"><na f="c/Crouch:Michael_S=" pid="02/9962">Michael S. Crouch</na></co>
<co c="0"><na f="d/Daskalakis:Constantinos" pid="d/ConstantinosDaskalakis">Constantinos Daskalakis</na></co>
<co c="0"><na f="d/Diakonikolas:Ilias" pid="d/IliasDiakonikolas">Ilias Diakonikolas</na></co>
<co c="0"><na f="d/Duchi:John_C=" pid="41/439">John C. Duchi</na></co>
<co c="0"><na f="f/Frongillo:Rafael_M=" pid="62/10262">Rafael M. Frongillo</na></co>
<co c="0"><na f="g/Garg_0001:Shivam" pid="168/8775-1">Shivam Garg 0001</na></co>
<co c="0" n="2"><na f="g/Ginart:Antonio_A=" pid="191/3562">Antonio A. Ginart</na><na>Antonio Ginart</na></co>
<co c="0"><na f="g/Gottlob:Georg" pid="g/GeorgGottlob">Georg Gottlob</na></co>
<co c="0"><na f="g/Guan:Melody_Y=" pid="198/0982">Melody Y. Guan</na></co>
<co c="0"><na f="g/Gupta_0002:Neha" pid="09/6861-2">Neha Gupta 0002</na></co>
<co c="0"><na f="h/Han:Yanjun" pid="35/7252">Yanjun Han</na></co>
<co c="0"><na f="h/Huang:Qian" pid="07/4378">Qian Huang</na></co>
<co c="0"><na f="h/Huang_0001:Qingqing" pid="87/7763-1">Qingqing Huang 0001</na></co>
<co c="0"><na f="i/Ibanez:Stephen" pid="236/7060">Stephen Ibanez</na></co>
<co c="0"><na f="j/Jepsen:Theo" pid="188/5904">Theo Jepsen</na></co>
<co c="0"><na f="k/Kabaghe:Chuma" pid="297/8900">Chuma Kabaghe</na></co>
<co c="0"><na f="k/Kakade:Sham_M=" pid="s/SMKakade">Sham M. Kakade</na></co>
<co c="0"><na f="k/Kalai:Adam_Tauman" pid="k/AdamTaumanKalai">Adam Tauman Kalai</na></co>
<co c="0"><na f="k/Karampatziakis:Nikos" pid="91/8774">Nikos Karampatziakis</na></co>
<co c="0"><na f="k/Kelner:Jonathan_A=" pid="64/4772">Jonathan A. Kelner</na></co>
<co c="0"><na f="k/Kong:Weihao" pid="117/4343">Weihao Kong</na></co>
<co c="0"><na f="l/Lee:Stephanie_Tien" pid="98/5496">Stephanie Tien Lee</na></co>
<co c="0"><na f="l/Liang:Percy" pid="04/1701">Percy Liang</na></co>
<co c="0"><na f="l/Livnat:Adi" pid="117/9201">Adi Livnat</na></co>
<co c="0"><na f="m/Marsden:Annie" pid="207/8374">Annie Marsden</na></co>
<co c="0"><na f="m/McGregor_0001:Andrew" pid="51/1169">Andrew McGregor 0001</na></co>
<co c="0"><na f="m/McKeown:Nick" pid="m/NickMcKeown">Nick McKeown</na></co>
<co c="0"><na f="m/Meister:Michela" pid="205/2986">Michela Meister</na></co>
<co c="0"><na f="m/Moitra:Ankur" pid="04/952">Ankur Moitra</na></co>
<co c="0"><na f="m/Mossel:Elchanan" pid="m/EMossel">Elchanan Mossel</na></co>
<co c="0"><na f="n/Nisan:Noam" pid="n/NoamNisan">Noam Nisan</na></co>
<co c="0"><na f="p/Pabbaraju:Chirag" pid="231/7619">Chirag Pabbaraju</na></co>
<co c="0"><na f="p/Panigrahy:Rina" pid="p/RinaPanigrahy">Rina Panigrahy</na></co>
<co c="0"><na f="p/Papadimitriou:Christos_H=" pid="p/CHPapadimitriou">Christos H. Papadimitriou</na></co>
<co c="0"><na f="p/Pierrakos:George" pid="42/1616">George Pierrakos</na></co>
<co c="0"><na f="p/Prakash:Anupam" pid="41/10720">Anupam Prakash</na></co>
<co c="0"><na f="q/Qiao:Mingda" pid="185/0592">Mingda Qiao</na></co>
<co c="0"><na f="r/Raghunathan:Aditi" pid="166/1409">Aditi Raghunathan</na></co>
<co c="0"><na f="r/R=eacute=:Christopher" pid="r/ChristopherRe">Christopher R&#233;</na></co>
<co c="0"><na f="r/Rivkin:Joey" pid="394/4704">Joey Rivkin</na></co>
<co c="0" n="2"><na f="r/Roughgarden:Timothy" pid="r/TimRoughgarden">Timothy Roughgarden</na><na>Tim Roughgarden</na></co>
<co c="0"><na f="r/Rubinstein:Aviad" pid="11/10308">Aviad Rubinstein</na></co>
<co c="0"><na f="s/Salemohamed:Omar" pid="351/7355">Omar Salemohamed</na></co>
<co c="0"><na f="s/Schapira:Michael" pid="15/5634">Michael Schapira</na></co>
<co c="0"><na f="s/Schoenebeck:Grant" pid="21/1633">Grant Schoenebeck</na></co>
<co c="0"><na f="s/Servedio:Rocco_A=" pid="s/RAServedio">Rocco A. Servedio</na></co>
<co c="0"><na f="s/Sharan:Vatsal" pid="126/2543">Vatsal Sharan</na></co>
<co c="0"><na f="s/Shiragur:Kirankumar" pid="160/9071">Kirankumar Shiragur</na></co>
<co c="0"><na f="s/Sidford:Aaron" pid="125/2326">Aaron Sidford</na></co>
<co c="0"><na f="s/Sidiropoulos:Anastasios" pid="99/6850">Anastasios Sidiropoulos</na></co>
<co c="0"><na f="s/Sohler:Christian" pid="47/2482">Christian Sohler</na></co>
<co c="0"><na f="s/Song:Le" pid="94/3481">Le Song</na></co>
<co c="0"><na f="s/Steinhardt:Jacob" pid="35/10625">Jacob Steinhardt</na></co>
<co c="0"><na f="s/Stewart:Alistair" pid="73/10824">Alistair Stewart</na></co>
<co c="0"><na f="t/Tai:Kai_Sheng" pid="160/8934">Kai Sheng Tai</na></co>
<co c="0"><na f="t/Tian:Kevin" pid="37/2934">Kevin Tian</na></co>
<co c="0"><na f="t/Tsipras:Dimitris" pid="168/4752">Dimitris Tsipras</na></co>
<co c="0"><na f="v/Valiant:Paul" pid="82/2417">Paul Valiant</na></co>
<co c="0"><na f="v/Verma:Rishi" pid="119/0122">Rishi Verma</na></co>
<co c="0"><na f="v/Vinayak:Ramya_Korlakai" pid="148/9626">Ramya Korlakai Vinayak</na></co>
<co c="0"><na f="w/Wager:Stefan" pid="96/1273">Stefan Wager</na></co>
<co c="0"><na f="w/Wan:Andrew" pid="12/3708">Andrew Wan</na></co>
<co c="0"><na f="w/Woodruff:David_P=" pid="w/DPWoodruff">David P. Woodruff</na></co>
<co c="0"><na f="w/Wu_0002:Sen" pid="06/6420-2">Sen Wu 0002</na></co>
<co c="0"><na f="w/Wu:Yuhuai" pid="176/5447">Yuhuai Wu</na></co>
<co c="0"><na f="y/Yuan:Honglin" pid="125/3654">Honglin Yuan</na></co>
<co c="0"><na f="z/Zelikman:Eric" pid="217/2378">Eric Zelikman</na></co>
<co c="0"><na f="z/Zhang:Brian_Hu" pid="213/8211">Brian Hu Zhang</na></co>
<co c="0"><na f="z/Zhang:Hongyang_R=" pid="264/2660">Hongyang R. Zhang</na></co>
<co c="0"><na f="z/Zhang_0001:Li" pid="89/5992-1">Li Zhang 0001</na></co>
<co c="0"><na f="z/Zohar:Aviv" pid="92/4269">Aviv Zohar</na></co>
<co c="0"><na f="z/Zou_0001:James" pid="72/8399">James Zou 0001</na></co>
</coauthors>
</dblpperson>

