متابعة
Jacob Abernethy
Jacob Abernethy
Assistant Professor, University of Michigan
بريد إلكتروني تم التحقق منه على umich.edu
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
On convergence and stability of gans‏
N Kodali, J Abernethy, J Hays, Z Kira‏
arXiv preprint arXiv:1705.07215, 2017‏
760*2017
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.‏
JD Abernethy, E Hazan, A Rakhlin‏
COLT, 263-274, 2008‏
3932008
A new approach to collaborative filtering: Operator estimation with spectral regularization.‏
J Abernethy, F Bach, T Evgeniou, JP Vert‏
Journal of Machine Learning Research 10 (3), 2009‏
3062009
Optimal strategies and minimax lower bounds for online convex games‏
J Abernethy, PL Bartlett, A Rakhlin, A Tewari‏
Proceedings of the 21st annual conference on learning theory, 414-424, 2008‏
1902008
Dynamic online pricing with incomplete information using multiarmed bandit experiments‏
K Misra, EM Schwartz, J Abernethy‏
Marketing Science 38 (2), 226-252, 2019‏
1852019
Blackwell approachability and no-regret learning are equivalent‏
J Abernethy, PL Bartlett, E Hazan‏
Proceedings of the 24th Annual Conference on Learning Theory, 27-46, 2011‏
1232011
Low-rank matrix factorization with attributes‏
J Abernethy, F Bach, T Evgeniou, JP Vert‏
arXiv preprint cs/0611124, 2006‏
1092006
Web spam identification through content and hyperlinks‏
J Abernethy, O Chapelle, C Castillo‏
Proceedings of the 4th international workshop on Adversarial information …, 2008‏
1062008
Efficient market making via convex optimization, and a connection to online learning‏
J Abernethy, Y Chen, JW Vaughan‏
ACM Transactions on Economics and Computation (TEAC) 1 (2), 1-39, 2013‏
1032013
A stochastic view of optimal regret through minimax duality‏
J Abernethy, A Agarwal, PL Bartlett, A Rakhlin‏
arXiv preprint arXiv:0903.5328, 2009‏
1032009
Graph regularization methods for web spam detection‏
J Abernethy, O Chapelle, C Castillo‏
Machine Learning 81, 207-225, 2010‏
862010
A collaborative mechanism for crowdsourcing prediction problems‏
JD Abernethy, R Frongillo‏
Advances in neural information processing systems 24, 2011‏
762011
Fighting bandits with a new kind of smoothness‏
JD Abernethy, C Lee, A Tewari‏
Advances in Neural Information Processing Systems 28, 2015‏
742015
Online linear optimization via smoothing‏
J Abernethy, C Lee, A Sinha, A Tewari‏
Conference on learning theory, 807-823, 2014‏
742014
Eliciting consumer preferences using robust adaptive choice questionnaires‏
J Abernethy, T Evgeniou, O Toubia, JP Vert‏
IEEE Transactions on Knowledge and Data Engineering 20 (2), 145-155, 2007‏
742007
Interior-point methods for full-information and bandit online learning‏
JD Abernethy, E Hazan, A Rakhlin‏
IEEE Transactions on Information Theory 58 (7), 4164-4175, 2012‏
702012
Beating the adaptive bandit with high probability‏
J Abernethy, A Rakhlin‏
2009 Information Theory and Applications Workshop, 280-289, 2009‏
692009
A characterization of scoring rules for linear properties‏
JD Abernethy, RM Frongillo‏
Conference on Learning Theory, 27.1-27.13, 2012‏
672012
Multitask learning with expert advice‏
J Abernethy, P Bartlett, A Rakhlin‏
Learning Theory: 20th Annual Conference on Learning Theory, COLT 2007, San …, 2007‏
652007
Last-iterate convergence rates for min-max optimization‏
J Abernethy, KA Lai, A Wibisono‏
arXiv preprint arXiv:1906.02027, 2019‏
612019
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20