Nikita Kalinin
3 Publications
2026 |
Published |
Conference Paper |
IST-REx-ID: 22146 |
N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in 7th Symposium on Foundations of Responsible Computing, Cambridge, MA; United States, 2026, vol. 368.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20298 |
N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.
[Published Version]
View
| Files available
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18875 |
N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.
[Published Version]
View
| Files available
| arXiv
Grants
3 Publications
2026 |
Published |
Conference Paper |
IST-REx-ID: 22146 |
N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in 7th Symposium on Foundations of Responsible Computing, Cambridge, MA; United States, 2026, vol. 368.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20298 |
N. Kalinin and L. Steinberger, “Efficient estimation of a Gaussian mean with local differential privacy,” in Proceedings of the 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 118–126.
[Published Version]
View
| Files available
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18875 |
N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.
[Published Version]
View
| Files available
| arXiv