doi:j.tcs

First Page		Document Content
Date: 2014-03-14 14:22:29 Theoretical computer science Mathematics Learning theory Inductive inference Algorithmic learning theory Nicolò Cesa-Bianchi Algorithm Learnability Probably approximately correct learning Computational learning theory Machine learning Applied mathematics		doi:j.tcs Add to Reading List Source URL: www-alg.ist.hokudai.ac.jp Download Document from Source Website File Size: 105,43 KB Share Document on Facebook

	Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning Systems Anupam Datta Shayak Sen DocID: 1uCPi - View Document
	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time DocID: 1tNIR - View Document
	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time DocID: 1rfbK - View Document
	Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec Sheridan S. Curley Dr. Richard E. Harang DocID: 1rbbS - View Document
	Data Min Knowl Disc:169–214 DOIs10618x K RIMP: mining itemsets that compress Jilles Vreeken · Matthijs van Leeuwen · Arno Siebes DocID: 1pIJJ - View Document