Funder
Division of Mathematical Sciences
Dunn Family Endowed Chair Fund
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Agarwal, A., Agarwal, S., Khanna, S., Patil, P.: Rank aggregation from pairwise comparisons in the presence of adversarial corruptions. In: International Conference on Machine Learning, pp. 85–95. PMLR (2020)
2. Aggarwal, C.C.: Recommender systems: the textbook (2013)
3. Agmon, S.: The relaxation method for linear inequalities. Can. J. Math. 6, 382–392 (1954)
4. Borkar, V.S., Karamchandani, N., Mirani, S.: Randomized Kaczmarz for rank aggregation from pairwise comparisons. In: 2016 IEEE Information Theory Workshop, pp. 389–393 (2016). https://doi.org/10.1109/ITW.2016.7606862
5. Cai, Y., Zhao, Y., Tang, Y.: Exponential convergence of a randomized Kaczmarz algorithm with relaxation. In: Proceedings of the 2011 2nd International Congress on Computer Applications and Computational Science, pp. 467–473. Springer (2012)