Fetching the paper…
Reading the bibliography…
Machine learning algorithms aim to find patterns from observations, which may include some noise, especially in robotics domain.
H. Robbins and S. Monro, “A stochastic approximation method,” The annals of mathematical statistics
1951
Earlier work this paper cites.
H. Hartley and A. Ross, “Unbiased ratio estimators,” Nature
1954
Earlier work this paper cites.
B. T. Polyak, “Some methods of speeding up the convergence of iteration methods,” USSR Computational Mathematics and Mathematical Physics
1964
Earlier work this paper cites.
Y. Nesterov, “A method for unconstrained convex minimization problem with the rate of convergence o (1/kˆ 2),” in Doklady AN USSR
1983
Earlier work this paper cites.
O. Arslan, P. D. Constable, and J. T. Kent, “Convergence behavior of the em algorithm for the multivariate t-distribution,” Communications in statistics-theory and methods
1995
Earlier work this paper cites.
2003
Earlier work this paper cites.
springer, 2006
C. M. Bishop, Pattern recognition and machine learning · 2006
Earlier work this paper cites.
L. Bottou, “Large-scale machine learning with stochastic gradient descent,” in Proceedings of COMPSTAT’2010
2010
Earlier work this paper cites.
D. F. Nettleton, A. Orriols-Puig, and A. Fornells, “A study of the effect of different types of noise on the precision of supervised learning techniques,” Artificial intelligence review
2010
Earlier work this paper cites.
J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization,” Journal of Machine Learning Research
2011
Earlier work this paper cites.
M. Lerasle and R. I. Oliveira, “Robust empirical mean estimators,” arXiv preprint arXiv:1112.3914
2011
Earlier work this paper cites.
N. L. Roux, M. Schmidt, and F. R. Bach, “A stochastic gradient method with an exponential convergence _rate for finite training sets,” in Advances in neural information processing systems
2012
Earlier work this paper cites.
M. D. Zeiler, “Adadelta: an adaptive learning rate method,” arXiv preprint arXiv:1212.5701
2012
Earlier work this paper cites.
T. Tieleman and G. Hinton, “Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude,” COURSERA: Neural networks for machine learning
2012
Cited alongside, same era.
R. Johnson and T. Zhang, “Accelerating stochastic gradient descent using predictive variance reduction,” in Advances in neural information processing systems
2013
Cited alongside, same era.
2013
Cited alongside, same era.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980
2014
Cited alongside, same era.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature
2015
Y. Haimin, P. Zhisong, and T. Qing, “Robust and adaptive online time series prediction with long short-term memory [j],” Computational Intelligence and Neuroscience
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Gupta, A. Murali, D. P. Gandhi, and L. Pinto, “Robot learning in homes: Improving generalization and reducing dataset bias,” in Advances in Neural Information Processing Systems
2018
Later among the works it cites.
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
S. Minsker et al
2015
Cited alongside, same era.
C. Brownlees, E. Joly, G. Lugosi, et al
2015
Cited alongside, same era.
2016
Cited alongside, same era.
D. Hsu and S. Sabato, “Loss minimization and parameter estimation with heavy tails,” The Journal of Machine Learning Research
2016
Cited alongside, same era.
W. Shang, K. Sohn, D. Almeida, and H. Lee, “Understanding and improving convolutional neural networks via concatenated rectified linear units,” in international conference on machine learning
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition
2016
Cited alongside, same era.
C. Gulcehre, J. Sotelo, M. Moczulski, and Y. Bengio, “A robust adaptive stochastic gradient method for deep learning,” in 2017 International Joint Conference on Neural Networks (IJCNN)
2017
Cited alongside, same era.
F. Z. Doğru, Y. M. Bulut, and O. Arslan, “Doubly reweighted estimators for the parameters of the multivariate t-distribution,” Communications in Statistics-Theory and Methods
2018
Later among the works it cites.
M. Suchi, T. Patten, D. Fischinger, and M. Vincze, “Easylabel: A semi-automatic pixel-wise object annotation tool for creating robotic rgb-d datasets,” in International Conference on Robotics and Automation (ICRA)
2019
Later among the works it cites.
2019
Later among the works it cites.
M. J. Holland and K. Ikeda, “Efficient learning with robust gradient descent,” Machine Learning
2019
Later among the works it cites.
Y. Chen, L. Su, and J. Xu, “Distributed statistical machine learning in adversarial settings: Byzantine gradient descent,” ACM SIGMETRICS Performance Evaluation Review
2019
Later among the works it cites.
2019
Later among the works it cites.
E. Coumans and Y. Bai, “Pybullet, a python module for physics simulation for games, robotics and machine learning.” http://pybullet.org , 2016–2019
2019
Later among the works it cites.
2019
Later among the works it cites.