Multiagent Soft Q-Learning Ermo Wei, Drew Wicke, David Freelan, Sean Luke We published this in AAAI Spring Symposium 2018. https://aaai.org/ocs/index.php/SSS/SSS18/paper/view/17508/15482
Hierarchical Approaches for Reinforcement Learning in Parameterized Action Space
Hierarchical Approaches for Reinforcement Learning in Parameterized Action Space Ermo Wei, Drew Wicke, Sean Luke We published this in AAAI Spring Symposium 2018. Here is a link to the paper https://aaai.org/ocs/index.php/SSS/SSS18/paper/view/17499/15483
Nix
I have been thinking about being able to reproduce results easily and quickly. As you can read in my previous post about jupyter notebooks. They will, at least in python let you do so. However, when attempting to reproduce entire dependencies for your software so that you can easily install on another machine there is… Continue reading Nix
Jupyter notebooks
Some interesting projects: Google has there own modified jupyter notebook that integrates into google drive: https://colab.research.google.com/ And there is Binder (beta) that will create an executable jupyter environment from a github repo with jupyter notebooks. Then anyone can easily run your code. https://mybinder.org/
Better Explained
Really nice article on the fourier transform and also some other math explained more intuitively here.
Papers We Love
Looks like a neat meet-up/website. https://github.com/papers-we-love/papers-we-love
Bounty Hunting as Highest Response Ratio Next
My original bounty hunting paper could actually be considered a market implementation of the Highest Response Ratio Next. $$\text{Priority}=\frac{\text{Waiting Time} + \text{Estimated Run Time}}{Estimated Run Time}$$ The bounty assigned to tasks is set to some base bounty $$B_0$$ and a bounty rate $latex r$ which in the first bounty hunting paper was set to 100… Continue reading Bounty Hunting as Highest Response Ratio Next
The Morning Paper
Found a pretty cool site The Morning Paper. The author goes over a CS paper every day during the week. It is a broad range of interesting topics.
Spatial Queuing Theory with Holes
So, consider a dynamic wireless sensor network. We wish to minimize the average wait time for each of the nodes in the network to be serviced by new information. We however do not want to increase the By using the bounty hunting algorithm we can do this. I might want to look into routing… Continue reading Spatial Queuing Theory with Holes
Algorithmic trading
Wow so it has been a long time. I’ve recently been looking at stocks again and just two days ago I found a stock and I was like I should buy that. Then I didn’t. But I really really should have because it then proceeded to go up by 20% in 2 days. So, this… Continue reading Algorithmic trading