report of learning optimization
Current problem:
design algorithms is a laborious process.
Focus field:
automating the design of unconstrained continuous optimization algorithms.
Assumption:
- undiscounted settting y=1
- restrictthe dependence of π on the objective function f to objective values and gradients evaluated at current and past locations.
Methods put foward:
optimization based on reinforcement learning.
Process:
Learning:
The best combination in the group is far superior to one of the best, which means it will be better than the algorithm it can choose
Autonomous optimizer is consist of other algorithms,but better than any other optimization algorithm .
Advantages:
- minimizes the amount of a priori assumptions made about objective functions and can instead take full advantage of the information about the actual objective functions of interest.
- has no hyperparameters that need to be tuned by the user.
Disadvantage:
- unconstrained continuous optimization algorithms.
- it may be used to solve various common classes of optimization problem.
Reference:
paper source: https://arxiv.org/pdf/1606.01885.pdf
reinforcement introduction: https://www.cnblogs.com/NaughtyBaby/p/5438013.html
推薦閱讀:
※Berkeley CS294-112 深度增強學習 筆記 (11) 概率圖模型與軟化增強學習
※智能行業如何發展?
※全球最聰明的大腦怎麼看AI?他們預測了這13大發展趨勢
※吳恩達首款產品Woebot現已推出,到底用了多難的AI技術?
※緒論:計算機時代,電力專業該如何轉型