FLEA: Provably robust fair multisource learning from unreliable training data
E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).

On the impossibility of fairness-aware learning from corrupted data
N.H. Konstantinov, C. Lampert, in:, Proceedings of Machine Learning Research, ML Research Press, 2022, pp. 59–83.

Robustness and fairness in machine learning
N.H. Konstantinov, Robustness and Fairness in Machine Learning, Institute of Science and Technology Austria, 2022.

Fairness-aware PAC learning from corrupted data
N.H. Konstantinov, C. Lampert, Journal of Machine Learning Research 23 (2022) 1–60.

Fairness through regularization for learning to rank
N.H. Konstantinov, C. Lampert, ArXiv (n.d.).

On the sample complexity of adversarial multi-source PAC learning
N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 5416–5425.

Robust learning from untrusted sources
N.H. Konstantinov, C. Lampert, in:, Proceedings of the 36th International Conference on Machine Learning, ML Research Press, 2019, pp. 3488–3498.

The convergence of stochastic gradient descent in asynchronous shared memory
D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–178.

The convergence of sparsified gradient methods
D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, Advances in Neural Information Processing Systems 31, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.