Bayesian Inference for Least Squares Temporal Difference Regularization

نویسندگان

  • Nikolaos Tziortziotis
  • Christos Dimitrakakis
چکیده

This paper proposes a fully Bayesian approach for LeastSquares Temporal Differences (LSTD), resulting in fully probabilistic inference of value functions that avoids the overfitting commonly experienced with classical LSTD when the number of features is larger than the number of samples. Sparse Bayesian learning provides an elegant solution through the introduction of a prior over value function parameters. This gives us the advantages of probabilistic predictions, a sparse model, and good generalisation capabilities, as irrelevant parameters are marginalised out. The algorithm efficiently approximates the posterior distribution through variational inference. We demonstrate the ability of the algorithm in avoiding overfitting experimentally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting transient signals in geodetic time series using sparse estimation techniques

We present a new method for automatically detecting transient deformation signals from geodetic time series. We cast the detection problem as a least squares procedure where the design matrix corresponds to a highly overcomplete, nonorthogonal dictionary of displacement functions in time that resemble transient signals of various timescales. The addition of a sparsity-inducing regularization te...

متن کامل

Simultaneous Estimation of Reflectivity and Geologic Texture: Least-Squares Migration with a Hierarchical Bayesian Model

In many geophysical inverse problems, smoothness assumptions on the underlying geology are utilized to mitigate the effects of poor resolution and noise in the data and to improve the quality of the inferred model parameters. Within a Bayesian inference framework, a priori assumptions about the probabilistic structure of the model parameters impose such a smoothness constraint or regularization...

متن کامل

Kernel Recursive Least-Squares Temporal Difference Algorithms with Sparsification and Regularization

By combining with sparse kernel methods, least-squares temporal difference (LSTD) algorithms can construct the feature dictionary automatically and obtain a better generalization ability. However, the previous kernel-based LSTD algorithms do not consider regularization and their sparsification processes are batch or offline, which hinder their widespread applications in online learning problems...

متن کامل

Identification of traffic-induced nodal excitations of truss bridges through heterogeneous data fusion

We propose a time domain Bayesian inference-based regularization approach for the identification of traffic-induced nodal excitations of truss bridges through heterogeneous data fusion. The measurements (e.g., accelerations, strains and displacements) are fused via a state space realization and rescaled for force identification. The unknown excitation time histories are inverted by solving an i...

متن کامل

Sparse kernel learning with LASSO and Bayesian inference algorithm

Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers [Gao, J., Antolovich, M., & Kwan, P. H. (2008). L1 LASSO and its Bayesian inference. In W. Wobcke, & M. Zhang (Eds.), Lecture notes in computer science: Vol. 5360 (pp. 318-324); Wang, G., Yeung, D. Y., & Lochovsky, F. (2007). The kernel path in kernelized LASSO. In Internationa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017