TensorFlow Data Validation: Data Analysis and Validation in Continuous ML Pipelines | 1 | 0.35 | 2020 |
Data Validation for Machine Learning. | 0 | 0.34 | 2019 |
Data Lifecycle Challenges in Production Machine Learning: A Survey. | 11 | 0.59 | 2018 |
Safe Exploration for Identifying Linear Systems via Robust Optimization. | 1 | 0.36 | 2017 |
Holographic Feature Representations Of Deep Networks | 0 | 0.34 | 2017 |
TFX: A TensorFlow-Based Production-Scale Machine Learning Platform | 29 | 1.14 | 2017 |
Formalizing Anthropomorphism Through Games: A Study in Deep Neural Networks. | 0 | 0.34 | 2017 |
Data Management Challenges in Production Machine Learning. | 22 | 0.95 | 2017 |
Deep Learning Games. | 0 | 0.34 | 2016 |
The Annual Computer Poker Competition. | 1 | 0.36 | 2013 |
On Local Regret | 0 | 0.34 | 2012 |
An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees | 1 | 0.40 | 2012 |
No-Regret Learning in Extensive-Form Games with Imperfect Recall | 9 | 0.58 | 2012 |
Unbiased online active learning in data streams | 41 | 1.07 | 2011 |
Learning to target: what works for behavioral targeting | 19 | 1.03 | 2011 |
Models of Cooperative Teaching and Learning | 28 | 1.41 | 2011 |
The lemonade stand game competition: solving unsolvable games | 10 | 0.71 | 2011 |
Accelerating best response calculation in large extensive games | 34 | 1.55 | 2011 |
Parallelized Stochastic Gradient Descent | 302 | 14.83 | 2010 |
A Practical Use of Imperfect Recall | 17 | 1.26 | 2009 |
Monte Carlo Sampling for Regret Minimization in Extensive Games. | 64 | 2.83 | 2009 |
Slow Learners are Fast | 130 | 11.04 | 2009 |
Adaptive bidding for display advertising | 34 | 1.77 | 2009 |
A demonstration of the Polaris poker system | 5 | 0.59 | 2009 |
Teaching Dimensions based on Cooperative Learning | 1 | 0.40 | 2008 |
A Fast Way to Produce Optimal Fixed-Depth Decision Trees. | 2 | 0.39 | 2008 |
Computing Robust Counter-Strategies | 39 | 3.33 | 2007 |
(Approximate) Subgradient Methods for Structured Prediction | 0 | 0.34 | 2007 |
Regret Minimization in Games with Incomplete Information | 152 | 9.85 | 2007 |
A hierarchy of prescriptive goals for multiagent learning | 3 | 0.40 | 2007 |
A new algorithm for generating equilibria in massive zero-sum games | 27 | 2.89 | 2007 |
(Approximate) Subgradient Methods for Structured Prediction | 10 | 0.62 | 2007 |
iLSTD: Eligibility Traces and Convergence Analysis | 16 | 0.78 | 2006 |
Maximum margin planning | 138 | 11.17 | 2006 |
Prob-Maxn: playing N-player games with opponent models | 8 | 1.14 | 2006 |
Online algorithms for market clearing | 50 | 5.17 | 2006 |
Optimal unbiased estimators for evaluating agent performance | 12 | 1.16 | 2006 |
Boosting expert ensembles for rapid concept recall | 5 | 0.41 | 2006 |
Cyclic Equilibria in Markov Games | 22 | 1.25 | 2005 |
Cyclic Equilibria in Markov Games | 22 | 1.25 | 2005 |
On polynomial-time preference elicitation with value queries | 20 | 1.55 | 2003 |
Online Convex Programming and Generalized Infinitesimal Gradient Ascent. | 589 | 72.98 | 2003 |
Competitive Analysis of the Explore/Exploit Tradeoff | 1 | 0.36 | 2002 |
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning | 17 | 1.02 | 2001 |