András Antos

According to our database, András Antos authored at least 19 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Boosting Multitask Decomposition: Directness, Sequentiality, Subsampling, Cross-Gradients.

András Millinghoffer, Mátyás Antal, Márk Marosi, András Formanek, András Antos, Péter Antal

Proceedings of the Artificial Intelligence in Medicine - 22nd International Conference, 2024

2015

Adaptive strategy for stratified Monte Carlo sampling.

Alexandra Carpentier, Rémi Munos, András Antos

J. Mach. Learn. Res., 2015

Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Bandits.

Alexandra Carpentier, Alessandro Lazaric, Mohammad Ghavamzadeh, Rémi Munos, Peter Auer, András Antos

CoRR, 2015

2013

Toward a classification of finite partial-monitoring games.

András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári

Theor. Comput. Sci., 2013

2012

On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources.

András Antos

IEEE Trans. Inf. Theory, 2012

2011

Non-trivial two-armed partial-monitoring games are bandits

András Antos, Gábor Bartók, Csaba Szepesvári

CoRR, 2011

2010

Active learning in heteroscedastic noise.

András Antos, Varun Grover, Csaba Szepesvári

Theor. Comput. Sci., 2010

Online Markov Decision Processes under Bandit Feedback.

Gergely Neu, András György, Csaba Szepesvári, András Antos

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2008

Active Learning in Multi-armed Bandits.

András Antos, Varun Grover, Csaba Szepesvári

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

2007

Fitted Q-iteration in continuous action-space MDPs.

András Antos, Rémi Munos, Csaba Szepesvári

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path.

András Antos, Csaba Szepesvári, Rémi Munos

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Individual convergence rates in empirical vector quantizer design.

András Antos, László Györfi, András György

IEEE Trans. Inf. Theory, 2005

Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers.

András Antos

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004

Improved convergence rates in empirical vector quantizer design.

András Antos, László Györfi, András György

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002

Data-dependent margin-based generalization bounds for classification.

András Antos, Balázs Kégl, Tamás Linder, Gábor Lugosi

J. Mach. Learn. Res., 2002

2000

Performance limits of nonparametric estimators

András Antos

PhD thesis, 2000

1999

Lower Bounds for Bayes Error Estimation.

András Antos, Luc Devroye, László Györfi

IEEE Trans. Pattern Anal. Mach. Intell., 1999

Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition.

András Antos

Proceedings of the Computational Learning Theory, 4th European Conference, 1999

1996

Strong Minimax Lower Bounds for Learning.

András Antos, Gábor Lugosi

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996