activity
20182026
most citedDeep Vectorization of Technical Drawings

65 citations · 127 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

12 papers · 1 filter

cs.LG2026

WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms

Jiale Chen, Vage Egiazarian, Eldar Kurtić +2

KV cache memory and bandwidth costs grow with context length and batch size, which limits efficient long-context inference. To address this bottleneck, we introduce WUSH-KV for low…

cs.LG2025

WUSH: Near-Optimal Adaptive Transforms for LLM Quantization

Jiale Chen, Vage Egiazarian, Roberto L. Castro +2

Quantizing LLM weights and activations is a standard approach for efficient deployment, but a few extreme outliers can stretch the dynamic range and amplify low-bit quantization er…

cs.LG2025

Bridging the Gap Between Promise and Performance for Microscaling FP4 Quantization

Vage Egiazarian, Roberto L. Castro, Denis Kuznedelev +8

The recent hardware-accelerated microscaling 4-bit floating-point formats such as MXFP4 and NVFP4, supported on NVIDIA and AMD GPUs, promise to revolutionize large language model (…

cs.LG2025

Unified Scaling Laws for Compressed Representations

Andrei Panferov, Alexandra Volkova, Ionut-Vlad Modoranu +3

Scaling laws have shaped recent advances in machine learning by enabling predictable scaling of model performance based on model size, computation, and data volume. Concurrently, t…

cs.LG2025

Hogwild! Inference: Parallel LLM Generation via Concurrent Attention

Gleb Rodionov, Roman Garipov, Alina Shutova +6

Large Language Models (LLMs) have demonstrated the ability to tackle increasingly complex tasks through advanced reasoning, long-form content generation, and tool use. Solving thes…

cs.LG2025

Cache Me If You Must: Adaptive Key-Value Quantization for Large Language Models

Alina Shutova, Vladimir Malinovskii, Vage Egiazarian +5

Efficient real-world deployments of large language models (LLMs) rely on Key-Value (KV) caching for processing and generating long outputs, reducing the need for repetitive computa…

cs.LG2024

Rethinking Optimal Transport in Offline Reinforcement Learning

Arip Asadulaev, Rostislav Korst, Alexander Korotin +3

We propose a novel algorithm for offline reinforcement learning using optimal transport. Typically, in offline reinforcement learning, the data is provided by various experts and s…

cs.LG2024★ 4 cited

Extreme Compression of Large Language Models via Additive Quantization

Vage Egiazarian, Andrei Panferov, Denis Kuznedelev +3

The emergence of accurate open large language models (LLMs) has led to a race towards performant quantization techniques which can enable their execution on end-user devices. In th…

cs.LG2022★ 3 cited

Neural Optimal Transport with General Cost Functionals

Arip Asadulaev, Alexander Korotin, Vage Egiazarian +2

We introduce a novel neural network-based algorithm to compute optimal transport (OT) plans for general cost functionals. In contrast to common Euclidean costs, i.e., or $…

cs.LG2022★ 4 cited

Wasserstein Iterative Networks for Barycenter Estimation

Alexander Korotin, Vage Egiazarian, Lingxiao Li +1

Wasserstein barycenters have become popular due to their ability to represent the average of probability measures in a geometrically meaningful way. In this paper, we present an al…

cs.LG2019★ 1 cited

Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs

Denis Mazur, Vage Egiazarian, Stanislav Morozov +1

Learning useful representations is a key ingredient to the success of modern machine learning. Currently, representation learning mostly relies on embedding data into Euclidean spa…

cs.LG2019★ 18 cited

Wasserstein-2 Generative Networks

Alexander Korotin, Vage Egiazarian, Arip Asadulaev +2

We propose a novel end-to-end non-minimax algorithm for training optimal transport mappings for the quadratic cost (Wasserstein-2 distance). The algorithm uses input convex neural…