Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Brian Bullins
@inproceedings{DBLP:conf/alt/AgarwalBS23, author = {Naman Agarwal and Brian Bullins and Karan Singh}, editor = {Shipra Agrawal and Francesco Orabona}, title = {Variance-Reduced Conservative Policy Iteration}, booktitle = {International Conference on Algorithmic Learning Theory, February 20-23, 2023, Singapore}, series = {Proceedings of Machine Learning Research}, volume = {201}, pages = {3--33}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v201/agarwal23a.html}, timestamp = {Wed, 15 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alt/AgarwalBS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/0001BA23, author = {Abhijeet Vyas and Brian Bullins and Kamyar Azizzadenesheli}, editor = {Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett}, title = {Competitive Gradient Optimization}, booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July 2023, Honolulu, Hawaii, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {202}, pages = {35243--35276}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v202/vyas23a.html}, timestamp = {Mon, 28 Aug 2023 17:23:08 +0200}, biburl = {https://dblp.org/rec/conf/icml/0001BA23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-08389, author = {Abhijeet Vyas and Brian Bullins}, title = {Beyond first-order methods for non-convex non-concave min-max optimization}, journal = {CoRR}, volume = {abs/2304.08389}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.08389}, doi = {10.48550/ARXIV.2304.08389}, eprinttype = {arXiv}, eprint = {2304.08389}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-08389.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-15643, author = {Site Bai and Brian Bullins}, title = {Federated Composite Saddle Point Optimization}, journal = {CoRR}, volume = {abs/2305.15643}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.15643}, doi = {10.48550/ARXIV.2305.15643}, eprinttype = {arXiv}, eprint = {2305.15643}, timestamp = {Tue, 06 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-15643.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamjo/BullinsL22, author = {Brian Bullins and Kevin A. Lai}, title = {Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities}, journal = {{SIAM} J. Optim.}, volume = {32}, number = {3}, pages = {2208--2229}, year = {2022}, url = {https://doi.org/10.1137/21m1395764}, doi = {10.1137/21M1395764}, timestamp = {Tue, 09 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamjo/BullinsL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/WoodworthBSS22, author = {Blake E. Woodworth and Brian Bullins and Ohad Shamir and Nathan Srebro}, editor = {Luc De Raedt}, title = {The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication (Extended Abstract)}, booktitle = {Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July 2022}, pages = {5359--5363}, publisher = {ijcai.org}, year = {2022}, url = {https://doi.org/10.24963/ijcai.2022/751}, doi = {10.24963/IJCAI.2022/751}, timestamp = {Wed, 27 Jul 2022 16:43:00 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/WoodworthBSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/PatelWWBS22, author = {Kumar Kshitij Patel and Lingxiao Wang and Blake E. Woodworth and Brian Bullins and Nati Srebro}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {Towards Optimal Communication Complexity in Distributed Non-Convex Optimization}, 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/56bd21259e28ebdc4d7e1503733bf421-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/PatelWWBS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-06167, author = {Deeksha Adil and Brian Bullins and Arun Jambulapati and Sushant Sachdeva}, title = {Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities}, journal = {CoRR}, volume = {abs/2205.06167}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.06167}, doi = {10.48550/ARXIV.2205.06167}, eprinttype = {arXiv}, eprint = {2205.06167}, timestamp = {Wed, 01 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-06167.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2212-06283, author = {Naman Agarwal and Brian Bullins and Karan Singh}, title = {Variance-Reduced Conservative Policy Iteration}, journal = {CoRR}, volume = {abs/2212.06283}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2212.06283}, doi = {10.48550/ARXIV.2212.06283}, eprinttype = {arXiv}, eprint = {2212.06283}, timestamp = {Mon, 02 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2212-06283.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/AgarwalBBC21, author = {Naman Agarwal and Nicolas Boumal and Brian Bullins and Coralia Cartis}, title = {Adaptive regularization with cubics on manifolds}, journal = {Math. Program.}, volume = {188}, number = {1}, pages = {85--134}, year = {2021}, url = {https://doi.org/10.1007/s10107-020-01505-1}, doi = {10.1007/S10107-020-01505-1}, timestamp = {Tue, 13 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/AgarwalBBC21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/WoodworthBSS21, author = {Blake E. Woodworth and Brian Bullins and Ohad Shamir and Nathan Srebro}, editor = {Mikhail Belkin and Samory Kpotufe}, title = {The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication}, booktitle = {Conference on Learning Theory, {COLT} 2021, 15-19 August 2021, Boulder, Colorado, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {134}, pages = {4386--4437}, publisher = {{PMLR}}, year = {2021}, url = {http://proceedings.mlr.press/v134/woodworth21a.html}, timestamp = {Wed, 25 Aug 2021 17:11:16 +0200}, biburl = {https://dblp.org/rec/conf/colt/WoodworthBSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AdilBKS21, author = {Deeksha Adil and Brian Bullins and Rasmus Kyng and Sushant Sachdeva}, editor = {Nikhil Bansal and Emanuela Merelli and James Worrell}, title = {Almost-Linear-Time Weighted {\unicode{120001}}\({}_{\mbox{p}}\)-Norm Solvers in Slightly Dense Graphs via Sparsification}, booktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)}, series = {LIPIcs}, volume = {198}, pages = {9:1--9:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.9}, doi = {10.4230/LIPICS.ICALP.2021.9}, timestamp = {Tue, 15 Feb 2022 07:54:27 +0100}, biburl = {https://dblp.org/rec/conf/icalp/AdilBKS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/AdilBS21, author = {Deeksha Adil and Brian Bullins and Sushant Sachdeva}, editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan}, title = {Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization}, booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual}, pages = {19122--19133}, year = {2021}, url = {https://proceedings.neurips.cc/paper/2021/hash/9f9e8cba3700df6a947a8cf91035ab84-Abstract.html}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/AdilBS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BullinsPSSW21, author = {Brian Bullins and Kumar Kshitij Patel and Ohad Shamir and Nathan Srebro and Blake E. Woodworth}, editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan}, title = {A Stochastic Newton Algorithm for Distributed Convex Optimization}, booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual}, pages = {26818--26830}, year = {2021}, url = {https://proceedings.neurips.cc/paper/2021/hash/e17a5a399de92e1d01a56c50afb2a68e-Abstract.html}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/BullinsPSSW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-01583, author = {Blake E. Woodworth and Brian Bullins and Ohad Shamir and Nathan Srebro}, title = {The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication}, journal = {CoRR}, volume = {abs/2102.01583}, year = {2021}, url = {https://arxiv.org/abs/2102.01583}, eprinttype = {arXiv}, eprint = {2102.01583}, timestamp = {Tue, 09 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-01583.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-06977, author = {Deeksha Adil and Brian Bullins and Rasmus Kyng and Sushant Sachdeva}, title = {Almost-linear-time Weighted {\unicode{120001}}\({}_{\mbox{p}}\)-norm Solvers in Slightly Dense Graphs via Sparsification}, journal = {CoRR}, volume = {abs/2102.06977}, year = {2021}, url = {https://arxiv.org/abs/2102.06977}, eprinttype = {arXiv}, eprint = {2102.06977}, timestamp = {Thu, 18 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-06977.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-02432, author = {Deeksha Adil and Brian Bullins and Sushant Sachdeva}, title = {Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization}, journal = {CoRR}, volume = {abs/2107.02432}, year = {2021}, url = {https://arxiv.org/abs/2107.02432}, eprinttype = {arXiv}, eprint = {2107.02432}, timestamp = {Wed, 07 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-02432.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-02954, author = {Brian Bullins and Kumar Kshitij Patel and Ohad Shamir and Nathan Srebro and Blake E. Woodworth}, title = {A Stochastic Newton Algorithm for Distributed Convex Optimization}, journal = {CoRR}, volume = {abs/2110.02954}, year = {2021}, url = {https://arxiv.org/abs/2110.02954}, eprinttype = {arXiv}, eprint = {2110.02954}, timestamp = {Mon, 25 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-02954.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/Bullins20, author = {Brian Bullins}, editor = {Jacob D. Abernethy and Shivani Agarwal}, title = {Highly smooth minimization of non-smooth problems}, booktitle = {Conference on Learning Theory, {COLT} 2020, 9-12 July 2020, Virtual Event [Graz, Austria]}, series = {Proceedings of Machine Learning Research}, volume = {125}, pages = {988--1030}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v125/bullins20a.html}, timestamp = {Fri, 27 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/colt/Bullins20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/WoodworthPSDBMS20, author = {Blake E. Woodworth and Kumar Kshitij Patel and Sebastian U. Stich and Zhen Dai and Brian Bullins and H. Brendan McMahan and Ohad Shamir and Nathan Srebro}, title = {Is Local {SGD} Better than Minibatch SGD?}, 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 = {10334--10343}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v119/woodworth20a.html}, timestamp = {Tue, 15 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icml/WoodworthPSDBMS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-07839, author = {Blake E. Woodworth and Kumar Kshitij Patel and Sebastian U. Stich and Zhen Dai and Brian Bullins and H. Brendan McMahan and Ohad Shamir and Nathan Srebro}, title = {Is Local {SGD} Better than Minibatch SGD?}, journal = {CoRR}, volume = {abs/2002.07839}, year = {2020}, url = {https://arxiv.org/abs/2002.07839}, eprinttype = {arXiv}, eprint = {2002.07839}, timestamp = {Sat, 23 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-07839.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-04528, author = {Brian Bullins and Kevin A. Lai}, title = {Higher-order methods for convex-concave min-max optimization and monotone variational inequalities}, journal = {CoRR}, volume = {abs/2007.04528}, year = {2020}, url = {https://arxiv.org/abs/2007.04528}, eprinttype = {arXiv}, eprint = {2007.04528}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-04528.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alt/BullinsHKL19, author = {Brian Bullins and Elad Hazan and Adam Kalai and Roi Livni}, editor = {Aur{\'{e}}lien Garivier and Satyen Kale}, title = {Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning}, booktitle = {Algorithmic Learning Theory, {ALT} 2019, 22-24 March 2019, Chicago, Illinois, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {98}, pages = {235--246}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v98/bullins19a.html}, timestamp = {Wed, 29 May 2019 08:41:44 +0200}, biburl = {https://dblp.org/rec/conf/alt/BullinsHKL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/AgarwalBCHSZZ19, author = {Naman Agarwal and Brian Bullins and Xinyi Chen and Elad Hazan and Karan Singh and Cyril Zhang and Yi Zhang}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, title = {Efficient Full-Matrix Adaptive Regularization}, booktitle = {Proceedings of the 36th International Conference on Machine Learning, {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {102--110}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v97/agarwal19b.html}, timestamp = {Tue, 11 Jun 2019 15:37:38 +0200}, biburl = {https://dblp.org/rec/conf/icml/AgarwalBCHSZZ19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/AgarwalBHKS19, author = {Naman Agarwal and Brian Bullins and Elad Hazan and Sham M. Kakade and Karan Singh}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, title = {Online Control with Adversarial Disturbances}, booktitle = {Proceedings of the 36th International Conference on Machine Learning, {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {111--119}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v97/agarwal19c.html}, timestamp = {Tue, 23 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/AgarwalBHKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-08721, author = {Naman Agarwal and Brian Bullins and Elad Hazan and Sham M. Kakade and Karan Singh}, title = {Online Control with Adversarial Disturbances}, journal = {CoRR}, volume = {abs/1902.08721}, year = {2019}, url = {http://arxiv.org/abs/1902.08721}, eprinttype = {arXiv}, eprint = {1902.08721}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-08721.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-01621, author = {Brian Bullins and Richard Peng}, title = {Higher-Order Accelerated Methods for Faster Non-Smooth Optimization}, journal = {CoRR}, volume = {abs/1906.01621}, year = {2019}, url = {http://arxiv.org/abs/1906.01621}, eprinttype = {arXiv}, eprint = {1906.01621}, timestamp = {Fri, 14 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-01621.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iclr/BullinsZZ18, author = {Brian Bullins and Cyril Zhang and Yi Zhang}, title = {Not-So-Random Features}, booktitle = {6th International Conference on Learning Representations, {ICLR} 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings}, publisher = {OpenReview.net}, year = {2018}, url = {https://openreview.net/forum?id=Hk8XMWgRb}, timestamp = {Thu, 25 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iclr/BullinsZZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-02958, author = {Naman Agarwal and Brian Bullins and Xinyi Chen and Elad Hazan and Karan Singh and Cyril Zhang and Yi Zhang}, title = {The Case for Full-Matrix Adaptive Regularization}, journal = {CoRR}, volume = {abs/1806.02958}, year = {2018}, url = {http://arxiv.org/abs/1806.02958}, eprinttype = {arXiv}, eprint = {1806.02958}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-02958.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/AgarwalBH17, author = {Naman Agarwal and Brian Bullins and Elad Hazan}, title = {Second-Order Stochastic Optimization for Machine Learning in Linear Time}, journal = {J. Mach. Learn. Res.}, volume = {18}, pages = {116:1--116:40}, year = {2017}, url = {http://jmlr.org/papers/v18/16-491.html}, timestamp = {Wed, 10 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/AgarwalBH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AgarwalZBHM17, author = {Naman Agarwal and Zeyuan Allen Zhu and Brian Bullins and Elad Hazan and Tengyu Ma}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Finding approximate local minima faster than gradient descent}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1195--1199}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055464}, doi = {10.1145/3055399.3055464}, timestamp = {Sun, 08 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AgarwalZBHM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-10230, author = {Brian Bullins and Cyril Zhang and Yi Zhang}, title = {Not-So-Random Features}, journal = {CoRR}, volume = {abs/1710.10230}, year = {2017}, url = {http://arxiv.org/abs/1710.10230}, eprinttype = {arXiv}, eprint = {1710.10230}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-10230.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/BullinsHK16, author = {Brian Bullins and Elad Hazan and Tomer Koren}, editor = {Daniel D. Lee and Masashi Sugiyama and Ulrike von Luxburg and Isabelle Guyon and Roman Garnett}, title = {The Limits of Learning with Missing Data}, booktitle = {Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain}, pages = {3495--3503}, year = {2016}, url = {https://proceedings.neurips.cc/paper/2016/hash/955a1584af63a546588caae4d23840b3-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/BullinsHK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AgarwalBH16, author = {Naman Agarwal and Brian Bullins and Elad Hazan}, title = {Second Order Stochastic Optimization in Linear Time}, journal = {CoRR}, volume = {abs/1602.03943}, year = {2016}, url = {http://arxiv.org/abs/1602.03943}, eprinttype = {arXiv}, eprint = {1602.03943}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AgarwalBH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AgarwalZBHM16, author = {Naman Agarwal and Zeyuan Allen Zhu and Brian Bullins and Elad Hazan and Tengyu Ma}, title = {Finding Approximate Local Minima for Nonconvex Optimization in Linear Time}, journal = {CoRR}, volume = {abs/1611.01146}, year = {2016}, url = {http://arxiv.org/abs/1611.01146}, eprinttype = {arXiv}, eprint = {1611.01146}, timestamp = {Sun, 08 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AgarwalZBHM16.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.