The following pages link to András Antos (Q982642):
Displaying 18 items.
- Active learning in heteroscedastic noise (Q982644) (← links)
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path (Q1009248) (← links)
- Strong minimax lower bounds for learning (Q1383192) (← links)
- Lower bounds for the rate of convergence in nonparametric pattern recognition (Q1603589) (← links)
- Toward a classification of finite partial-monitoring games (Q1939263) (← links)
- Lower bounds on the rate of convergence of nonparametric regression estimates (Q1969139) (← links)
- Convergence properties of functional estimates for discrete distributions (Q2772919) (← links)
- Online Markov Decision Processes Under Bandit Feedback (Q2983230) (← links)
- 10.1162/153244303768966111 (Q3044135) (← links)
- Active Learning in Multi-armed Bandits (Q3529929) (← links)
- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers (Q3546515) (← links)
- Individual Convergence Rates in Empirical Vector Quantizer Design (Q3546516) (← links)
- (Q4416726) (← links)
- (Q4524564) (← links)
- On Codecell Convexity of Optimal Multiresolution Scalar Quantizers for Continuous Sources (Q5272129) (← links)
- Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path (Q5307594) (← links)
- Learning Theory (Q5473635) (← links)
- (Q5744838) (← links)
