3 papers
cs.CC2026
A lower bound for matrix multiplication
Askar Tsyganov, Uliana Parkina, Sergey Samsonov +1
We prove that, over any field, the bilinear complexity of multiplying a matrix by a matrix is strictly greater than . In particular, every exact bili…
cs.IR2026
Bradley-Terry Rankings for Recommender Systems Across Dataset Taxonomies
Ekaterina Grishina, Stepan Kuznetsov, Askar Tsyganov +8
The ranking of recommendation algorithms is a challenging problem since model performance is sensitive to dataset characteristics such as sparsity, sequential structure, and scale.…
cs.LG2025
COALA: Numerically Stable and Efficient Framework for Context-Aware Low-Rank Approximation
Uliana Parkina, Maxim Rakhuba
Recent studies suggest that context-aware low-rank approximation is a useful tool for compression and fine-tuning of modern large-scale neural networks. In this type of approximati…