Papers by Mikhail Arkhipov
Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacity (2025.acl-long)
Copied to clipboard
| Challenge: | Recent work addresses problem of compression of tokens into shorter sequence of real-valued vectors . attainable lossless compression ratio is typically not higher than x10 . |
| Approach: | They propose to compress a sequence of tokens into a shorter sequence of real-valued vectors to be used as inputs instead of token embeddings or key-value cache. |
| Outcome: | The proposed algorithms reduce the amount of compute in existing language models rather than minimizing number of bits needed to store text. |
DeepPavlov: Open-Source Library for Dialogue Systems (P18-4)
Copied to clipboard
Mikhail Burtsev, Alexander Seliverstov, Rafael Airapetyan, Mikhail Arkhipov, Dilyara Baymurzina, Nickolay Bushkov, Olga Gureenkova, Taras Khakhulin, Yuri Kuratov, Denis Kuznetsov, Alexey Litinsky, Varvara Logacheva, Alexey Lymar, Valentin Malykh, Maxim Petrov, Vadim Polulyakh, Leonid Pugachev, Alexey Sorokin, Maria Vikhreva, Marat Zaynutdinov
| Challenge: | open-source library DeepPavlov is designed for rapid development of dialogue systems. |
| Approach: | open-source library DeepPavlov is tailored for development of conversational agents . the library prioritizes efficiency, modularity and extensibility with the goal to make it easier to develop dialogue systems from scratch . |
| Outcome: | the open-source library DeepPavlov is designed for rapid development of dialogue systems . it supports modular as well as end-to-end approaches to implementation of conversational agents . |