Donald E Knuth. The Art of Computer Programming. Addison Wesley Longman Publishing Co., Inc, Volume 3: (2nd Ed.) Sorting and Searching, 1998.
Havard Klamme and Ornulf Borgan. The Brier Score under Administrative Censoring: Problems and Solutions. Technical Report arXiv:1g912.08581, arXiv, December 2019. URL http://arxiv.org/abs/1912.08581.arXiv:1912.08581 [cs, stat] type: article.
Havard Kvamme, Ornulf Borgan, and Ida Scheel. Time-to-Event Prediction with Neural Networks and Cox Regression. arXiv:1907.00825 [cs, stat], September 2019. URL http://arxiv.org/abs/1907.00825. arXiv:1907.00825.
Changhee Lee, William Zame, Jinsung Yoon, and Mihaela Van Der Schaar. DeepHit: A Deep Learning Approach to Survival Analysis with Competing Risks. Proceedings of the AAAI Conference on Artificial Intelligence, page 8, 2018.
Yuval Netzer, Tao Wang, Adam Coates, Alessandro Bissacco, Bo Wu, and Andrew Y. Ng. Reading digits in natural images with unsupervised feature learning. In NIPS Workshop on Deep Learning and Unsupervised Feature Learning 2011, 2011. URL http://ufldl.stanford.edu/housenumbers/nips2011_housenumbers.pdf.
Felix Petersen, Christian Borgelt, Hilde Kuehne, and Oliver Deussen. Differentiable Sorting Networks for Scalable Sorting and Ranking Supervision. arXiv:2105.04019 [cs], July 2021. URL http://arxiv.org/abs/2105.04019.arXiv:2105.04019.
Felix Petersen, Christian Borgelt, Hilde Kuehne, and Oliver Deussen. Monotonic Differentiable Sorting Networks. arXiv:2203.09630 [cs, stat], March 2022a. URL http://arxiv.org/abs/2203.09630. arXiv:2203.09630.
Felix Petersen, Hilde Kuehne, Christian Borgelt, and Oliver Deussen. Differentiable Top-k Classification Learning, June 2022b. URL http://arxiv.org/abs/2206.07290. Number: arXiv:2206.07290 arXiv:2206.07290 [cs].
Sebastian Pölsterl. scikit-survival: A library for time-to-event analysis built on top of scikit-learn. Journal of Machine Learning Research, 21(212):1-6, 2020. URL http://jmlr.org/papers/v21/20-729.html.
Sebastian Pölsterl. Survival Analysis for Deep Learning, July 2019. URL https://k-d-w.org/blog/2019/07/survival-analysis-for-deep-learning/.
Vikas C Raykar, Harald Steck, Balaji Krishnapuram, Cary Dehing-oberije, and Philippe Lambin. On Ranking in Survival Analysis: Bounds on the Concordance Index. In Advances in Neural Information Processing Systems, volume 20. Curran Associates, Inc., 2007. URL https://papers.nips.cc/paper/2007/hash/33e8075e9970de0cfea955afd4644bb2-Abstract.html.
Mingxing Tan and Quoc V. Le. EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks, September 2020. URL http://arxiv.org/abs/1905.11946. arXiv:1905.11946 [cs, stat].
Bokun Wang and Tianbao Yang. Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications, September 2022. URL http://arxiv.org/abs/2202.12396.arXiv:2202.12396 [cs, math].
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, and Hang Li. Listwise Approach to Learning to Rank - Theory and Algorithm. Proceedings of the 25th International Conference on Machine learning, 2008.
Xuelin Yang, Louis Abraham, Sejin Kim, Petr Smirnov, Feng Ruan, Benjamin Haibe-Kains, and Robert Tibshirani. FastCPH: Efficient Survival Analysis for Neural Networks, August 2022. URL http://arxiv.org/abs/2208.09793. arXiv:2208.09793 [cs, stat].