← Search

Vage Egiazarian

15 accepted papers

2026

Bridging the Gap Between Promise and Performance for FP4 Quantization

ICLR 2026poster

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 (LLM) inference. Yet, their practical benefits remain unproven. We present the first comprehensive study of MXFP4 and NV…

Cited by 0SourcecodeScholar
2026

WUSH: Near-Optimal Adaptive Transforms for LLM Quantization

ICML 2026poster

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 error. Prior transform-based mitigations (e.g., Hadamard rotations) are fixed and data-agnostic, and their optimality for …

Cited by 0SourceScholar
2025

AutoJudge: Judge Decoding Without Manual Annotation

NeurIPS 2025poster

We introduce AutoJudge, a method that accelerates large language model (LLM) inference with task-specific lossy speculative decoding. Instead of matching the original model output distribution token-by-token, we identify the generated tokens that affect the downstream quality of the response, relax…

Cited by 0SourceScholar
2025

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

ICML 2025poster

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 computation. For large contexts, Key-Value caches can take up tens of gigabytes of device memory, as they store vector represen…

2025

Hogwild! Inference: Parallel LLM Generation via Concurrent Attention

NeurIPS 2025spotlight

Large Language Models (LLMs) have demonstrated the ability to tackle increasingly complex tasks through advanced reasoning, long-form content generation, and tool use. Solving these tasks often involves long inference-time computations. In human problem solving, a common strategy to expedite work is…

Cited by 0SourcecodeScholar
2025

Unified Scaling Laws for Compressed Representations

NeurIPS 2025poster

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, the rise in computational cost for AI has motivated model compression techniques, notably quantization and sparsification…

Cited by 0SourceScholar
2024

Extreme Compression of Large Language Models via Additive Quantization

ICML 2024poster

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 this paper, we revisit the problem of ``extreme'' LLM compression---defined as targeting extremely low bit counts, such as…

2024

Neural Optimal Transport with General Cost Functionals

ICLR 2024poster

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., $\ell^1$ or $\ell^2$, such functionals provide more flexibility and allow using auxiliary information, such as class labels, to const…

2024

Rethinking Optimal Transport in Offline Reinforcement Learning

NeurIPS 2024poster

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 some of them can be sub-optimal. To extract an efficient policy, it is necessary to \emph{stitch} the best behaviors from…

Cited by 3SourcePDFScholar
2024

SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression

ICLR 2024poster

Recent advances in large language model (LLM) pretraining have led to high-quality LLMs with impressive abilities. By compressing such LLMs via quantization to 3-4 bits per parameter, they can fit into memory-limited devices such as laptops and mobile phones, enabling personalized use. Quantizing mo…

2022

Wasserstein Iterative Networks for Barycenter Estimation

NeurIPS 2022accept

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 algorithm to approximate the Wasserstein-2 barycenters of continuous measures via a generative model. Previous approaches…

2021

Wasserstein-2 Generative Networks

ICLR 2021poster

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 networks and a cycle-consistency regularization to approximate Wasserstein-2 distance. In contrast to popular entropic a…

2020

Deep Vectorization of Technical Drawings

ECCV 2020poster

We present a new method for vectorization of technical line drawings, such as floor plans, architectural drawings, and 2D CAD images. Our method includes (1) a deep learning-based cleaning stage to eliminate the background and imperfections in the image and fill in missing parts, (2) a transformer-b…

2019

Beyond Vector Spaces: Compact Data Representation as Differentiable Weighted Graphs

NeurIPS 2019poster

Learning useful representations is a key ingredient to the success of modern machine learning. Currently, representation learning mostly relies on embedding data into Euclidean space. However, recent work has shown that data in some domains is better modeled by non-euclidean metric spaces, and inapp…

2019

Perceptual Deep Depth Super-Resolution

ICCV 2019poster

RGBD images, combining high-resolution color and lower-resolution depth from various types of depth sensors, are increasingly common. One can significantly improve the resolution of depth maps by taking advantage of color information; deep learning methods make combining color and depth information…

Cited by 53PDFcodeScholar