default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Zinkevich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c38]Emily Caveness, Paul Suganthan G. C., Zhuo Peng, Neoklis Polyzotis, Sudip Roy, Martin Zinkevich:
TensorFlow Data Validation: Data Analysis and Validation in Continuous ML Pipelines. SIGMOD Conference 2020: 2793-2796
2010 – 2019
- 2019
- [c37]Eric Breck, Neoklis Polyzotis, Sudip Roy, Steven Whang, Martin Zinkevich:
Data Validation for Machine Learning. SysML 2019 - [c36]Denis Baylor, Kevin Haas, Konstantinos Katsiapis, Sammy Leong, Rose Liu, Clemens Mewald, Hui Miao, Neoklis Polyzotis, Mitchell Trott, Martin Zinkevich:
Continuous Training for Production ML in the TensorFlow Extended (TFX) Platform. OpML 2019: 51-53 - 2018
- [j7]Neoklis Polyzotis, Sudip Roy, Steven Euijong Whang, Martin Zinkevich:
Data Lifecycle Challenges in Production Machine Learning: A Survey. SIGMOD Rec. 47(2): 17-28 (2018) - 2017
- [c35]Martin A. Zinkevich, Dale Schuurmans:
Formalizing Anthropomorphism Through Games: A Study in Deep Neural Networks. AAAI Workshops 2017 - [c34]Denis Baylor, Eric Breck, Heng-Tze Cheng, Noah Fiedel, Chuan Yu Foo, Zakaria Haque, Salem Haykal, Mustafa Ispir, Vihan Jain, Levent Koc, Chiu Yuen Koo, Lukasz Lew, Clemens Mewald, Akshay Naresh Modi, Neoklis Polyzotis, Sukriti Ramesh, Sudip Roy, Steven Euijong Whang, Martin Wicke, Jarek Wilkiewicz, Xin Zhang, Martin Zinkevich:
TFX: A TensorFlow-Based Production-Scale Machine Learning Platform. KDD 2017: 1387-1395 - [c33]Neoklis Polyzotis, Sudip Roy, Steven Euijong Whang, Martin Zinkevich:
Data Management Challenges in Production Machine Learning. SIGMOD Conference 2017: 1723-1726 - [c32]Martin A. Zinkevich, Alex Davies, Dale Schuurmans:
Holographic Feature Representations of Deep Networks. UAI 2017 - [i4]Tyler Lu, Martin Zinkevich, Craig Boutilier, Binz Roy, Dale Schuurmans:
Safe Exploration for Identifying Linear Systems via Robust Optimization. CoRR abs/1711.11165 (2017) - 2016
- [c31]Dale Schuurmans, Martin Zinkevich:
Deep Learning Games. NIPS 2016: 1678-1686 - 2013
- [j6]Nolan Bard, John Alexander Hawkin, Jonathan Rubin, Martin Zinkevich:
The Annual Computer Poker Competition. AI Mag. 34(2): 112- (2013) - 2012
- [c30]Michael Bowling, Martin Zinkevich:
On Local Regret. ICML 2012 - [i3]Marc Lanctot, Richard G. Gibson, Neil Burch, Martin Zinkevich, Michael H. Bowling:
No-Regret Learning in Extensive-Form Games with Imperfect Recall. CoRR abs/1205.0622 (2012) - [i2]Michael Bowling, Martin Zinkevich:
On Local Regret. CoRR abs/1206.3318 (2012) - [i1]Michael L. Littman, Nishkam Ravi, Arjun Talwar, Martin Zinkevich:
An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees. CoRR abs/1206.6855 (2012) - 2011
- [j5]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Models of Cooperative Teaching and Learning. J. Mach. Learn. Res. 12: 349-384 (2011) - [j4]Martin Zinkevich, Michael H. Bowling, Michael Wunder:
The lemonade stand game competition: solving unsolvable games. SIGecom Exch. 10(1): 35-38 (2011) - [c29]Sandeep Pandey, Mohamed Aly, Abraham Bagherjeiran, Andrew O. Hatch, Peter Ciccolo, Adwait Ratnaparkhi, Martin Zinkevich:
Learning to target: what works for behavioral targeting. CIKM 2011: 1805-1814 - [c28]Michael Johanson, Kevin Waugh, Michael H. Bowling, Martin Zinkevich:
Accelerating Best Response Calculation in Large Extensive Games. IJCAI 2011: 258-265 - [c27]Wei Chu, Martin Zinkevich, Lihong Li, Achint Thomas, Belle L. Tseng:
Unbiased online active learning in data streams. KDD 2011: 195-203 - 2010
- [c26]Martin Zinkevich, Markus Weimer, Alexander J. Smola, Lihong Li:
Parallelized Stochastic Gradient Descent. NIPS 2010: 2595-2603
2000 – 2009
- 2009
- [c25]Michael H. Bowling, Nicholas Abou Risk, Nolan Bard, Darse Billings, Neil Burch, Joshua Davidson, John Alexander Hawkin, Robert Holte, Michael Johanson, Morgan Kan, Bryce Paradis, Jonathan Schaeffer, David Schnizlein, Duane Szafron, Kevin Waugh, Martin Zinkevich:
A demonstration of the Polaris poker system. AAMAS (2) 2009: 1391-1392 - [c24]Marc Lanctot, Kevin Waugh, Martin Zinkevich, Michael H. Bowling:
Monte Carlo Sampling for Regret Minimization in Extensive Games. NIPS 2009: 1078-1086 - [c23]Martin Zinkevich, Alexander J. Smola, John Langford:
Slow Learners are Fast. NIPS 2009: 2331-2339 - [c22]Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, Michael H. Bowling:
A Practical Use of Imperfect Recall. SARA 2009 - [c21]Arpita Ghosh, Benjamin I. P. Rubinstein
, Sergei Vassilvitskii, Martin Zinkevich:
Adaptive bidding for display advertising. WWW 2009: 251-260 - 2008
- [c20]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Teaching Dimensions based on Cooperative Learning. COLT 2008: 135-146 - [c19]Alireza Farhangfar, Russell Greiner, Martin Zinkevich:
A Fast Way to Produce Optimal Fixed-Depth Decision Trees. ISAIM 2008 - 2007
- [j3]Martin Zinkevich, Amy Greenwald, Michael L. Littman:
A hierarchy of prescriptive goals for multiagent learning. Artif. Intell. 171(7): 440-447 (2007) - [c18]Martin Zinkevich, Michael H. Bowling, Neil Burch:
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games. AAAI 2007: 788-794 - [c17]Michael Johanson, Martin Zinkevich, Michael H. Bowling:
Computing Robust Counter-Strategies. NIPS 2007: 721-728 - [c16]Martin Zinkevich, Michael Johanson, Michael H. Bowling, Carmelo Piccione:
Regret Minimization in Games with Incomplete Information. NIPS 2007: 1729-1736 - [c15]Nathan D. Ratliff, J. Andrew Bagnell, Martin Zinkevich:
(Approximate) Subgradient Methods for Structured Prediction. AISTATS 2007: 380-387 - 2006
- [j2]Avrim Blum, Tuomas Sandholm, Martin Zinkevich:
Online algorithms for market clearing. J. ACM 53(5): 845-879 (2006) - [c14]Achim Rettinger, Martin Zinkevich, Michael H. Bowling:
Boosting Expert Ensembles for Rapid Concept Recall. AAAI 2006: 464-469 - [c13]Martin Zinkevich, Michael H. Bowling, Nolan Bard, Morgan Kan, Darse Billings:
Optimal Unbiased Estimators for Evaluating Agent Performance. AAAI 2006: 573-579 - [c12]Nathan R. Sturtevant, Martin Zinkevich, Michael H. Bowling:
Prob-Maxn: Playing N-Player Games with Opponent Models. AAAI 2006: 1057-1063 - [c11]Nathan D. Ratliff, J. Andrew Bagnell, Martin Zinkevich:
Maximum margin planning. ICML 2006: 729-736 - [c10]Alborz Geramifard, Michael H. Bowling, Martin Zinkevich, Richard S. Sutton:
iLSTD: Eligibility Traces and Convergence Analysis. NIPS 2006: 441-448 - [c9]Michael L. Littman, Nishkam Ravi, Arjun Talwar, Martin Zinkevich:
An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees. UAI 2006 - 2005
- [c8]Martin Zinkevich:
Response Regret. AAAI Fall Symposium: Coevolutionary and Coadaptive Systems 2005: 41- - [c7]Martin Zinkevich, Amy Greenwald, Michael L. Littman:
Cyclic Equilibria in Markov Games. NIPS 2005: 1641-1648 - 2004
- [j1]Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich:
Preference Elicitation and Query Learning. J. Mach. Learn. Res. 5: 649-667 (2004) - 2003
- [c6]Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, Martin Zinkevich:
Preference Elicitation and Query Learning. COLT 2003: 13-25 - [c5]Martin Zinkevich:
Online Convex Programming and Generalized Infinitesimal Gradient Ascent. ICML 2003: 928-936 - [c4]Martin Zinkevich, Avrim Blum, Tuomas Sandholm:
On polynomial-time preference elicitation with value queries. EC 2003: 176-185 - 2002
- [c3]John Langford, Martin Zinkevich, Sham M. Kakade:
Competitive Analysis of the Explore/Exploit Tradeoff. ICML 2002: 339-346 - [c2]Avrim Blum, Tuomas Sandholm, Martin Zinkevich:
Online algorithms for market clearing. SODA 2002: 971-980 - 2001
- [c1]Martin Zinkevich, Tucker R. Balch:
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning. ICML 2001: 632-
Coauthor Index
aka: Michael Bowling
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
