András Antos

	2012
18		András Antos: On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources. IEEE Transactions on Information Theory 58(2): 1147-1157 (2012)
	2011
17		András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári: Toward a Classification of Finite Partial-Monitoring Games CoRR abs/1102.2041: (2011)
16		András Antos, Gábor Bartók, Csaba Szepesvári: Non-trivial two-armed partial-monitoring games are bandits CoRR abs/1108.4961: (2011)
	2010
15		Gergely Neu, András György, Csaba Szepesvári, András Antos: Online Markov Decision Processes under Bandit Feedback. NIPS 2010: 1804-1812
14		András Antos, Varun Grover, Csaba Szepesvári: Active learning in heteroscedastic noise. Theor. Comput. Sci. 411(29-30): 2712-2728 (2010)
	2008
13		András Antos, Varun Grover, Csaba Szepesvári: Active Learning in Multi-armed Bandits. ALT 2008: 287-302
12		András Antos, Csaba Szepesvári, Rémi Munos: Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. Machine Learning 71(1): 89-129 (2008)
	2007
11		András Antos, Rémi Munos, Csaba Szepesvári: Fitted Q-iteration in continuous action-space MDPs. NIPS 2007
	2006
10		András Antos, Csaba Szepesvári, Rémi Munos: Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path. COLT 2006: 574-588
	2005
9		András Antos: Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers. COLT 2005: 531-544
8		András Antos, László Györfi, András György: Individual convergence rates in empirical vector quantizer design. IEEE Transactions on Information Theory 51(11): 4013-4022 (2005)
7		András Antos: Improved minimax bounds on the test and training distortion of empirically designed vector quantizers. IEEE Transactions on Information Theory 51(11): 4022-4032 (2005)
	2002
6		András Antos, Balázs Kégl, Tamás Linder, Gábor Lugosi: Data-dependent margin-based generalization bounds for classification. Journal of Machine Learning Research 3: 73-98 (2002)
5		András Antos: Lower bounds for the rate of convergence in nonparametric pattern recognition. Theor. Comput. Sci. 284(1): 3-24 (2002)
	1999
4		András Antos: Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition. EuroCOLT 1999: 241-252
3		András Antos, Luc Devroye, László Györfi: Lower Bounds for Bayes Error Estimation. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 643-645 (1999)
	1998
2		András Antos, Gábor Lugosi: Strong Minimax Lower Bounds for Learning. Machine Learning 30(1): 31-56 (1998)
	1996
1		András Antos, Gábor Lugosi: Strong Minimax Lower Bounds for Learning. COLT 1996: 303-309

Coauthor Index

1	Gábor Bartók	[16] [17]
2	Luc Devroye	[3]
3	Varun Grover	[13] [14]
4	László Györfi	[3] [8]
5	András György	[8] [15]
6	Balázs Kégl	[6]
7	Tamás Linder	[6]
8	Gábor Lugosi	[1] [2] [6]
9	Rémi Munos	[10] [11] [12]
10	Gergely Neu	[15]
11	Dávid Pál	[17]
12	Csaba Szepesvári	[10] [11] [12] [13] [14] [15] [16] [17]

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page