Fetching the paper…
Reading the bibliography…
Our goal is to train control policies that generalize well to unseen environments.
K. Perlin, “An image synthesizer,” ACM Siggraph Computer Graphics , vol. 19, no. 3, pp. 287–296, 1985
1985
Earlier work this paper cites.
J. J. Hull, “A database for handwritten text recognition research,” IEEE Transactions on Pattern Analysis and Machine intelligence , vol. 16, no. 5, pp. 550–554, 1994
1994
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
G. E. Hinton and R. R. Salakhutdinov, “Reducing the dimensionality of data with neural networks,” Science , vol. 313, no. 5786, pp. 504–507, 2006
2006
Earlier work this paper cites.
C. Villani, Optimal transport: old and new . Springer, 2009, vol. 338
2009
Earlier work this paper cites.
W. Wohlkinger, A. Aldoma, R. B. Rusu, and M. Vincze, “3DNet: Large-scale object class recognition from CAD models,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) , 2012, pp. 5384–5391
2012
Earlier work this paper cites.
I. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2015
2015
Earlier work this paper cites.
H. Namkoong and J. C. Duchi, “Stochastic gradient methods for distributionally robust optimization with f f -divergences.” in Proceedings of the Advances in Neural Information Processing Systems (NIPS) , vol. 29, 2016, pp. 2208–2216
2016
Earlier work this paper cites.
J. Tobin, R. Fong, A. Ray, J. Schneider, W. Zaremba, and P. Abbeel, “Domain randomization for transferring deep neural networks from simulation to the real world,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , 2017, pp. 23–30
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein generative adversarial networks,” in Proceedings of the International Conference on Machine Learning (ICML) , 2017, pp. 214–223
2017
Earlier work this paper cites.
C. R. Qi, H. Su, K. Mo, and L. J. Guibas, “PointNet: Deep learning on point sets for 3D classification and segmentation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2017, pp. 652–660
2017
Earlier work this paper cites.
N. Sünderhauf, O. Brock, W. Scheirer, R. Hadsell, D. Fox, J. Leitner, B. Upcroft, P. Abbeel, W. Burgard, M. Milford, et al. , “The limits and potentials of deep learning for robotics,” The International Journal of Robotics Research , vol. 37, no. 4-5, pp. 405–420, 2018
2018
Earlier work this paper cites.
A. Sinha, H. Namkoong, and J. Duchi, “Certifiable distributional robustness with principled adversarial training,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2018
2018
Cited alongside, same era.
P. M. Esfahani and D. Kuhn, “Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations,” Mathematical Programming , vol. 171, no. 1, pp. 115–166, 2018
2018
Cited alongside, same era.
R. Volpi, H. Namkoong, O. Sener, J. C. Duchi, V. Murino, and S. Savarese, “Generalizing to unseen domains via adversarial data augmentation,” in Proceedings of the Advances in Neural Information Processing Systems (NIPS) , 2018, pp. 5334–5344
2018
Cited alongside, same era.
J. Tobin, L. Biewald, R. Duan, M. Andrychowicz, A. Handa, V. Kumar, B. McGrew, A. Ray, J. Schneider, P. Welinder, et al. , “Domain randomization and generative models for robotic grasping,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , 2018, pp. 3482–3489
J. J. Park, P. Florence, J. Straub, R. Newcombe, and S. Lovegrove, “DeepSDF: Learning continuous signed distance functions for shape representation,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2019, pp. 165–174
2019
Later among the works it cites.
B. Mehta, M. Diaz, F. Golemo, C. J. Pal, and L. Paull, “Active domain randomization,” in Proceedings of the Conference on Robot Learning (CoRL) , 2020, pp. 1162–1176
2020
Later among the works it cites.
M. Laskin, K. Lee, A. Stooke, L. Pinto, P. Abbeel, and A. Srinivas, “Reinforcement learning with augmented data,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , vol. 33, 2020, pp. 19 884–19 895
2020
Later among the works it cites.
M. Dennis, N. Jaques, E. Vinitsky, A. Bayen, S. Russell, A. Critch, and S. Levine, “Emergent complexity and zero-shot transfer via unsupervised environment design,” in Proceedings of the Advances in Neural Information Processing Systems (NeurIPS) , vol. 33, 2020, pp. 13 049–13 061
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
P. Achlioptas, O. Diamanti, I. Mitliagkas, and L. Guibas, “Learning representations and generative models for 3D point clouds,” in Proceedings of the International Conference on Machine Learning (ICML) , 2018, pp. 40–49
2018
Cited alongside, same era.
T. Haarnoja, A. Zhou, P. Abbeel, and S. Levine, “Soft Actor-Critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor,” in Proceedings of the International Conference on Machine Learning (ICML) , 2018, pp. 1861–1870
2018
Cited alongside, same era.
A. Zeng, S. Song, S. Welker, J. Lee, A. Rodriguez, and T. Funkhouser, “Learning synergies between pushing and grasping with self-supervised deep reinforcement learning,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , 2018, pp. 4238–4245
2018
Cited alongside, same era.
J. Blanchet and K. Murthy, “Quantifying distributional model risk via optimal transport,” Mathematics of Operations Research , vol. 44, no. 2, pp. 565–600, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
S. Zakharov, W. Kehl, and S. Ilic, “DeceptionNet: Network-driven domain randomization,” in Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) , 2019, pp. 532–541
2019
Cited alongside, same era.
D. Wang, D. Tseng, P. Li, Y. Jiang, M. Guo, M. Danielczuk, J. Mahler, J. Ichnowski, and K. Goldberg, “Adversarial grasp objects,” in Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE) , 2019, pp. 241–248
2019
Cited alongside, same era.
A. Joshi, A. Mukherjee, S. Sarkar, and C. Hegde, “Semantic adversarial attacks: Parametric transformations that fool deep classifiers,” in Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) , 2019, pp. 4773–4783
2019
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Morrison, P. Corke, and J. Leitner, “EGAD! an evolved grasping analysis dataset for diversity and reproducibility in robotic manipulation,” IEEE Robotics and Automation Letters , vol. 5, no. 3, pp. 4368–4375, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
D. Yarats, I. Kostrikov, and R. Fergus, “Image augmentation is all you need: Regularizing deep reinforcement learning from pixels,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2021
2021
Closest in time.
E. Wong and J. Z. Kolter, “Learning perturbation sets for robust machine learning,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2021
2021
Closest in time.
2021
Closest in time.
E. Coumans and Y. Bai, “PyBullet, a Python module for physics simulation for games, robotics and machine learning,” http://pybullet.org
2021
Closest in time.