Jacob Abernethy

Citado por

	Total	Desde 2020
Citas	4850	2716
Índice h	36	26
Índice i10	64	46

660

330

165

495

20082009201020112012201320142015201620172018201920202021202220232024202522 56 109 145 180 179 216 190 230 224 257 291 440 492 534 569 642 39

Acceso público

Ver todo

18 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Peter BartlettProfessor, EECS and Statistics, UC BerkeleyDirección de correo verificada de cs.berkeley.edu
Ambuj Tewari | अम्बुज तिवारीProfessor, Statistics and EECS, University of MichiganDirección de correo verificada de umich.edu
Elad HazanProfessor at Princeton University and Director Google AI PrincetonDirección de correo verificada de princeton.edu
Theodoros EvgeniouINSEADDirección de correo verificada de insead.edu
Jean-Philippe VertOwkin / PSL UniversityDirección de correo verificada de owkin.com
Rafael FrongilloComputer Science, CU BoulderDirección de correo verificada de colorado.edu
Olivier ChapelleGoogleDirección de correo verificada de chapelle.cc
Jennifer Wortman VaughanSenior Principal Researcher, Microsoft Research, New York CityDirección de correo verificada de microsoft.com
Carlos CastilloICREA Research Professor at Universitat Pompeu FabraDirección de correo verificada de icrea.cat
Francis BachInria - Ecole Normale SupérieureDirección de correo verificada de inria.fr
Yiling ChenHarvard UniversityDirección de correo verificada de seas.harvard.edu
Alekh AgarwalGoogleDirección de correo verificada de google.com
John LangfordMicrosoft Research New YorkDirección de correo verificada de hunch.net
Satyen KaleResearch Scientist, AppleDirección de correo verificada de satyenkale.com
Chien-Ju HoWashington University in St. LouisDirección de correo verificada de wustl.edu
niv buchbinderTel Aviv universityDirección de correo verificada de post.tau.ac.il
Isabelle StantonSoftware Engineer at GoogleDirección de correo verificada de eecs.berkeley.edu
Michael KearnsProfessor of Computer Science, University of PennsylvaniaDirección de correo verificada de cis.upenn.edu
Qingsi WangGoogleDirección de correo verificada de google.com
Shie MannorProfessor of Electrical Engineering @ Technion & Researcher @ NvidiaDirección de correo verificada de technion.ac.il

Seguir

Jacob Abernethy

Assistant Professor, University of Michigan

Dirección de correo verificada de umich.edu

Machine Learning Game Theory Sequential Decision Making


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
On convergence and stability of gans N Kodali, J Abernethy, J Hays, Z Kira arXiv preprint arXiv:1705.07215, 2017	849*	2017
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. JD Abernethy, E Hazan, A Rakhlin COLT, 263-274, 2008	417	2008
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	314	2009
Dynamic online pricing with incomplete information using multiarmed bandit experiments K Misra, EM Schwartz, J Abernethy Marketing Science 38 (2), 226-252, 2019	237	2019
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	205	2008
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	140	2011
Low-rank matrix factorization with attributes J Abernethy, F Bach, T Evgeniou, JP Vert arXiv preprint cs/0611124, 2006	110	2006
Web spam identification through content and hyperlinks J Abernethy, O Chapelle, C Castillo Proceedings of the 4th international workshop on Adversarial information …, 2008	108	2008
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	106	2013
A stochastic view of optimal regret through minimax duality J Abernethy, A Agarwal, PL Bartlett, A Rakhlin arXiv preprint arXiv:0903.5328, 2009	105	2009
Graph regularization methods for web spam detection J Abernethy, O Chapelle, C Castillo Machine Learning 81, 207-225, 2010	88	2010
Fighting bandits with a new kind of smoothness JD Abernethy, C Lee, A Tewari Advances in Neural Information Processing Systems 28, 2015	86	2015
Online linear optimization via smoothing J Abernethy, C Lee, A Sinha, A Tewari Conference on learning theory, 807-823, 2014	83	2014
A collaborative mechanism for crowdsourcing prediction problems JD Abernethy, R Frongillo Advances in neural information processing systems 24, 2011	81	2011
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	76	2007
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	75	2012
Beating the adaptive bandit with high probability J Abernethy, A Rakhlin 2009 Information Theory and Applications Workshop, 280-289, 2009	72	2009
A characterization of scoring rules for linear properties JD Abernethy, RM Frongillo Conference on Learning Theory, 27.1-27.13, 2012	71	2012
An optimization-based framework for automated market-making J Abernethy, Y Chen, J Wortman Vaughan Proceedings of the 12th ACM conference on Electronic commerce, 297-306, 2011	65	2011
Multitask learning with expert advice J Abernethy, P Bartlett, A Rakhlin Learning Theory: 20th Annual Conference on Learning Theory, COLT 2007, San …, 2007	65	2007

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores