Search Results for author:
Found 3 papers, 0 papers with code
Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
SA appears in many areas such as optimization and Reinforcement Learning (RL).
Concentration bounds for SSP Q-learning for average cost MDPs
We derive a concentration bound for a Q-learning algorithm for average cost Markov decision processes based on an equivalent shortest path problem, and compare it numerically with the alternative scheme based on relative value iteration.
Joint Probability Estimation Using Tensor Decomposition and Dictionaries
We create a dictionary of various families of distributions by inspecting the data, and use it to approximate each decomposed factor of the product in the mixture.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
