Learning Feature Relevance Through Step Size Adaptation in Temporal-Difference Learning
원문 초록
There is a long history of using meta learning as representation learning, specifically for determining the relevance of inputs. In this paper, we examine an instance of meta-learning in which feature relevance is learned by adapting step size parameters of stochastic gradient descent---building on a variety of prior work in stochastic approximation, machine learning, and artificial neural networks. In particular, we focus on stochastic meta-descent introduced in the Incremental Delta-Bar-Delta (IDBD) algorithm for setting individual step sizes for each feature of a linear function approximator. Using IDBD, a feature with large or small step sizes will have a large or small impact on generalization from training examples. As a main contribution of this work, we extend IDBD to temporal-difference (TD) learning---a form of learning which is effective in sequential, non i.i.d. problems. We derive a variety of IDBD generalizations for TD learning, demonstrating that they are able to distinguish which features are relevant and which are not. We demonstrate that TD IDBD is effective at learning feature relevance in both an idealized gridworld and a real-world robotic prediction task.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Latent Representation Learning of Multi-scale Thermophysics: Application to Dynamics in Shocked Porous Energetic Material
Are encoders able to learn landmarkers for warm-starting of Hyperparameter Optimization?
Semantic Structure Enhanced Contrastive Adversarial Hash Network for Cross-media Representation Learning
An Experimental Study of Quantitative Evaluations on Saliency Methods
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
Dual Dimensions Geometric Representation Learning Based Document Dewarping
토론
이 논문과 연결된 포럼 글이 아직 없습니다.