- 博客(2)
- 收藏
- 关注
原创 (Leetcode)Longest Increasing Subsequence——dp,bisearch
300. Longest Increasing Subsequence 题目 Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing
2017-03-31 23:17:46 408
原创 optimizer优化算法总结
优化方法总结参考深度学习最全优化方法总结比较An overview of gradient descent optimization algorithms目录优化方法总结SGD1 Batch gradient descent2 Stochastic gradient descent3 Mini-batch gradient descent三种gradient descent对比Mini-
2017-03-17 00:26:01 19658
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人