Goto

Collaborating Authors

 Performance Analysis




Kernel-BasedFunctionApproximationforAverage RewardReinforcementLearning: AnOptimist No-RegretAlgorithm

Neural Information Processing Systems

Reinforcement learning utilizing kernel ridge regression to predict the expected value function represents a powerful method with great representational capacity. This setting is a highly versatile framework amenable to analytical results. Weconsider kernel-based function approximation for RL in the infinite horizon average reward setting, also referred toasthe undiscounted setting. Wepropose an optimistic algorithm, similar to acquisition function based algorithms in the special caseofbandits.


Appendix

Neural Information Processing Systems

In this section, we first provide model parameters used for training the attack GANs. We then provide sample images from each cluster/class for each of the models, along with the generated noise using ourGAN models. In this section, we provide additional details for the defense approaches considered in this paper. B.1 RobustDeepClustering We provide hyperparameter values (Table 6) for training the GAN network for RUC, along with confusion matrices (Figures 37 - 39) and adversarial samples (Figures 40 - 42) obtained via our attack. Then, in Table 8 we provide the actual values used for generating the injection/detection bar plot figureinthemaintext.






AComprehensiveAnalysisontheLearningCurve inKernelRidgeRegression

Neural Information Processing Systems

Kernel ridge regression (KRR) is a central tool in machine learning due to its ability to provide a flexible and efficient framework for capturing intricate patterns within data.