no code implementations • 29 Mar 2024 • Nikita Trukhanov, Ilya Soloveychik
It made evident the colossal shortage of dedicated hardware capable of efficient and fast processing of the involved compute and memory movement.
1 code implementation • 14 Mar 2024 • Muhammad Adnan, Akhil Arunkumar, Gaurav Jain, Prashant J. Nair, Ilya Soloveychik, Purushotham Kamath
This approach effectively reduces both the KV cache size and memory bandwidth usage without compromising model accuracy.
no code implementations • 11 Oct 2022 • Ilya Soloveychik, Ilya Lyubomirsky, Xin Wang, Sudeep Bhoja
This measure allows us to determine the optimal parameters, such as the block size, yielding highest accuracy.
no code implementations • 5 Jun 2020 • Ilya Soloveychik
Ellipticity GoF tests are usually hard to analyze and often their statistical power is not particularly strong.
no code implementations • 10 Jun 2018 • Ilya Soloveychik, Vahid Tarokh
We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario.
no code implementations • 12 Feb 2018 • Ilya Soloveychik, Vahid Tarokh
Assuming that the entire graph can be partitioned into a number of spatial regions with similar edge parameters and reasonably regular boundaries, we develop new information-theoretic sample complexity bounds and show that a bounded number of samples can be sufficient to consistently recover these regions.
no code implementations • 20 Nov 2015 • Ilya Soloveychik, Ami Wiesel
We consider the problem of joint estimation of structured inverse covariance matrices.
no code implementations • 7 Apr 2014 • Ilya Soloveychik, Ami Wiesel
We address structured covariance estimation in elliptical distributions by assuming that the covariance is a priori known to belong to a given convex set, e. g., the set of Toeplitz or banded matrices.
no code implementations • 18 Jun 2013 • Ilya Soloveychik, Ami Wiesel
We consider robust covariance estimation with group symmetry constraints.