Follow
Brian Bullins
Brian Bullins
Assistant Professor, Purdue University
Verified email at purdue.edu - Homepage
Title
Cited by
Cited by
Year
Finding approximate local minima faster than gradient descent
N Agarwal, Z Allen-Zhu, B Bullins, E Hazan, T Ma
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
334*2017
Second-order stochastic optimization for machine learning in linear time
N Agarwal, B Bullins, E Hazan
The Journal of Machine Learning Research 18 (1), 4148-4187, 2017
303*2017
Is local SGD better than minibatch SGD?
B Woodworth, KK Patel, S Stich, Z Dai, B Bullins, B Mcmahan, O Shamir, ...
International Conference on Machine Learning, 10334-10343, 2020
2362020
Online control with adversarial disturbances
N Agarwal, B Bullins, E Hazan, S Kakade, K Singh
International Conference on Machine Learning, 111-119, 2019
2222019
Efficient full-matrix adaptive regularization
N Agarwal, B Bullins, X Chen, E Hazan, K Singh, C Zhang, Y Zhang
International Conference on Machine Learning, 102-110, 2019
772019
Adaptive regularization with cubics on manifolds
N Agarwal, N Boumal, B Bullins, C Cartis
arXiv preprint arXiv:1806.00065, 2018
612018
The min-max complexity of distributed stochastic convex optimization with intermittent communication
BE Woodworth, B Bullins, O Shamir, N Srebro
Conference on Learning Theory, 4386-4437, 2021
332021
Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
B Bullins, KA Lai
SIAM Journal on Optimization 32 (3), 2208-2229, 2022
272022
Not-So-Random Features
B Bullins, C Zhang, Y Zhang
International Conference on Learning Representations, 2018
252018
Highly smooth minimization of non-smooth problems
B Bullins
Conference on Learning Theory, 988-1030, 2020
222020
Generalize across tasks: Efficient algorithms for linear representation learning
B Bullins, E Hazan, A Kalai, R Livni
algorithmic learning theory, 235-246, 2019
212019
Fast minimization of structured convex quartics
B Bullins
arXiv preprint arXiv:1812.10349, 2018
202018
Almost-linear-time Weighted -norm Solvers in Slightly Dense Graphs via Sparsification
D Adil, B Bullins, R Kyng, S Sachdeva
arXiv preprint arXiv:2102.06977, 2021
182021
Spectral properties of modularity matrices
M Bolla, B Bullins, S Chaturapruek, S Chen, K Friedl
Linear Algebra and Its Applications 473, 359-376, 2015
18*2015
Higher-order accelerated methods for faster non-smooth optimization
B Bullins, R Peng
arXiv preprint arXiv:1906.01621, 2019
152019
The limits of learning with missing data
B Bullins, E Hazan, T Koren
Advances in Neural Information Processing Systems 29, 2016
142016
A stochastic newton algorithm for distributed convex optimization
B Bullins, K Patel, O Shamir, N Srebro, BE Woodworth
Advances in Neural Information Processing Systems 34, 26818-26830, 2021
122021
Line search-free methods for higher-order smooth monotone variational inequalities
D Adil, B Bullins, A Jambulapati, S Sachdeva
arXiv preprint arXiv:2205.06167, 2022
82022
Optimal methods for higher-order smooth monotone variational inequalities
D Adil, B Bullins, A Jambulapati, S Sachdeva
arXiv preprint arXiv:2205.06167, 2022
82022
Towards optimal communication complexity in distributed non-convex optimization
KK Patel, L Wang, BE Woodworth, B Bullins, N Srebro
Advances in Neural Information Processing Systems 35, 13316-13328, 2022
62022
The system can't perform the operation now. Try again later.
Articles 1–20