Nikola H Konstantinov

Graduate School
Lampert Group

9 Publications

Mark all

[9]
2022 | Journal Article | IST-REx-ID: 12495 | OA
FLEA: Provably robust fair multisource learning from unreliable training data
E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[8]
2022 | Journal Article | IST-REx-ID: 10802 | OA
Fairness-aware PAC learning from corrupted data
N.H. Konstantinov, C. Lampert, Journal of Machine Learning Research 23 (2022) 1–60.
[Published Version] View | Files available | arXiv
 
[7]
2022 | Conference Paper | IST-REx-ID: 13241 | OA
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.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[6]
2022 | Thesis | IST-REx-ID: 10799 | OA
Robustness and fairness in machine learning
N.H. Konstantinov, Robustness and Fairness in Machine Learning, Institute of Science and Technology Austria, 2022.
[Published Version] View | Files available | DOI
 
[5]
2021 | Preprint | IST-REx-ID: 10803 | OA
Fairness through regularization for learning to rank
N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
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.
[Published Version] View | Files available | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6590 | OA
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.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
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.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed

9 Publications

Mark all

[9]
2022 | Journal Article | IST-REx-ID: 12495 | OA
FLEA: Provably robust fair multisource learning from unreliable training data
E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022).
[Published Version] View | Files available | Download Published Version (ext.) | arXiv
 
[8]
2022 | Journal Article | IST-REx-ID: 10802 | OA
Fairness-aware PAC learning from corrupted data
N.H. Konstantinov, C. Lampert, Journal of Machine Learning Research 23 (2022) 1–60.
[Published Version] View | Files available | arXiv
 
[7]
2022 | Conference Paper | IST-REx-ID: 13241 | OA
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.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[6]
2022 | Thesis | IST-REx-ID: 10799 | OA
Robustness and fairness in machine learning
N.H. Konstantinov, Robustness and Fairness in Machine Learning, Institute of Science and Technology Austria, 2022.
[Published Version] View | Files available | DOI
 
[5]
2021 | Preprint | IST-REx-ID: 10803 | OA
Fairness through regularization for learning to rank
N.H. Konstantinov, C. Lampert, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[4]
2020 | Conference Paper | IST-REx-ID: 8724 | OA
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.
[Published Version] View | Files available | arXiv
 
[3]
2019 | Conference Paper | IST-REx-ID: 6590 | OA
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.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[2]
2018 | Conference Paper | IST-REx-ID: 5962 | OA
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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[1]
2018 | Conference Paper | IST-REx-ID: 6589 | OA
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.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed