 | 2012 |
| 29 |  | Jacob Abernethy,
Rafael M. Frongillo,
Andre Wibisono:
Minimax option pricing meets black-scholes in the limit.
STOC 2012: 1029-1040 |
| 28 |  | Jacob Abernethy,
Rafael M. Frongillo,
Andre Wibisono:
Minimax Option Pricing Meets Black-Scholes in the Limit
CoRR abs/1202.2585: (2012) |
| 2011 |
| 27 |  | Jacob Abernethy,
Yiling Chen,
Jennifer Wortman Vaughan:
An optimization-based framework for automated market-making.
ACM Conference on Electronic Commerce 2011: 297-306 |
| 26 |  | Jacob Abernethy,
Rafael M. Frongillo:
A Collaborative Mechanism for Crowdsourcing Prediction Problems.
NIPS 2011: 2600-2608 |
| 25 |  | Jacob Abernethy,
Rafael M. Frongillo:
A Collaborative Mechanism for Crowdsourcing Prediction Problems
CoRR abs/1111.2664: (2011) |
| 24 |  | Jacob Abernethy,
Peter L. Bartlett,
Elad Hazan:
Blackwell Approachability and No-Regret Learning are Equivalent.
Journal of Machine Learning Research - Proceedings Track 19: 27-46 (2011) |
| 23 |  | Jacob Abernethy,
Shie Mannor:
Does an Efficient Calibrated Forecasting Strategy Exist?
Journal of Machine Learning Research - Proceedings Track 19: 809-812 (2011) |
| 2010 |
| 22 |  | Jacob Abernethy,
Peter L. Bartlett,
Niv Buchbinder,
Isabelle Stanton:
A Regularization Approach to Metrical Task Systems.
ALT 2010: 270-284 |
| 21 |  | Jacob Abernethy:
Can We Learn to Gamble Efficiently?
COLT 2010: 318-319 |
| 20 |  | Jacob Abernethy,
Manfred K. Warmuth:
Repeated Games against Budgeted Adversaries.
NIPS 2010: 1-9 |
| 19 |  | Jacob Abernethy,
Peter L. Bartlett,
Elad Hazan:
Blackwell Approachability and Low-Regret Learning are Equivalent
CoRR abs/1011.1936: (2010) |
| 18 |  | Jacob Abernethy,
Yiling Chen,
Jennifer Wortman Vaughan:
An Optimization-Based Framework for Automated Market-Making
CoRR abs/1011.1941: (2010) |
| 17 |  | Jacob Abernethy,
Olivier Chapelle,
Carlos Castillo:
Graph regularization methods for Web spam detection.
Machine Learning 81(2): 207-225 (2010) |
| 2009 |
| 16 |  | Jacob Abernethy,
Alekh Agarwal,
Peter L. Bartlett,
Alexander Rakhlin:
A Stochastic View of Optimal Regret through Minimax Duality.
COLT 2009 |
| 15 |  | Jacob Abernethy,
Alexander Rakhlin:
An Efficient Bandit Algorithm for sqrt(T) Regret in Online Multiclass Prediction?.
COLT 2009 |
| 14 |  | Jacob Abernethy,
Alexander Rakhlin:
Beating the Adaptive Bandit with High Probability.
COLT 2009 |
| 13 |  | Jacob Abernethy,
Manfred K. Warmuth:
Minimax Games with Bandits.
COLT 2009 |
| 12 |  | Jacob Abernethy,
Alekh Agarwal,
Peter L. Bartlett,
Alexander Rakhlin:
A Stochastic View of Optimal Regret through Minimax Duality
CoRR abs/0903.5328: (2009) |
| 11 |  | Jacob Abernethy,
Francis Bach,
Theodoros Evgeniou,
Jean-Philippe Vert:
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization.
Journal of Machine Learning Research 10: 803-826 (2009) |
| 2008 |
| 10 |  | Jacob Abernethy,
Olivier Chapelle,
Carlos Castillo:
Web spam identification through content and hyperlinks.
AIRWeb 2008: 41-44 |
| 9 |  | Jacob Abernethy,
Elad Hazan,
Alexander Rakhlin:
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.
COLT 2008: 263-274 |
| 8 |  | Jacob Abernethy,
Peter L. Bartlett,
Alexander Rakhlin,
Ambuj Tewari:
Optimal Stragies and Minimax Lower Bounds for Online Convex Games.
COLT 2008: 415-424 |
| 7 |  | Jacob Abernethy,
Manfred K. Warmuth,
Joel Yellin:
When Random Play is Optimal Against an Adversary.
COLT 2008: 437-446 |
| 6 |  | Francis Bach,
Jacob Abernethy,
Jean-Philippe Vert,
Theodoros Evgeniou:
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
CoRR abs/0802.1430: (2008) |
| 5 |  | Jacob Abernethy,
Theodoros Evgeniou,
Olivier Toubia,
Jean-Philippe Vert:
Eliciting Consumer Preferences Using Robust Adaptive Choice Questionnaires.
IEEE Trans. Knowl. Data Eng. 20(2): 145-155 (2008) |
| 2007 |
| 4 |  | Jacob Abernethy,
Peter L. Bartlett,
Alexander Rakhlin:
Multitask Learning with Expert Advice.
COLT 2007: 484-498 |
| 3 |  | Alexander Rakhlin,
Jacob Abernethy,
Peter L. Bartlett:
Online discovery of similarity mappings.
ICML 2007: 767-774 |
| 2006 |
| 2 |  | Jacob Abernethy,
John Langford,
Manfred K. Warmuth:
Continuous Experts and the Binning Algorithm.
COLT 2006: 544-558 |
| 1 |  | Jacob Abernethy,
Francis Bach,
Theodoros Evgeniou,
Jean-Philippe Vert:
Low-rank matrix factorization with attributes
CoRR abs/cs/0611124: (2006) |