← Search

Charbel Sakr

11 accepted papers

2026

LO-BCQ: Locally Optimal Block Clustered Quantization for 4-bit (W4A4) LLM Inference

ICML 2026poster

Post-training quantization (PTQ) is a promising approach to reducing the storage and computational requirements of large language models (LLMs) without additional training cost. Recent PTQ studies have primarily focused on quantizing only weights to sub-$8$-bits while maintaining activations at $8$-…

Cited by 0SourceScholar
2026

ThinKV: Thought-Adaptive KV Cache Compression for Efficient Reasoning Models

ICLR 2026oral

The long-output context generation of large reasoning models enables extended chain of thought (CoT) but also drives rapid growth of the key–value (KV) cache, quickly overwhelming GPU memory. To address this challenge, we propose ThinKV, a thought-adaptive KV cache compression framework. ThinKV is b…

Cited by 12SourceScholar
2023

VaPr: Variable-Precision Tensors to Accelerate Robot Motion Planning

IROS 2023poster

High-dimensional motion generation requires nu-merical precision for smooth, collision-free solutions. Typically, double-precision or single-precision floating-point (FP) formats are utilized. Using these for big tensors imposes a strain on the memory bandwidth provided by the devices and alters the…

Cited by 5SourceScholar
2022

Optimal Clipping and Magnitude-aware Differentiation for Improved Quantization-aware Training

ICML 2022spotlight

Data clipping is crucial in reducing noise in quantization operations and improving the achievable accuracy of quantization-aware training (QAT). Current practices rely on heuristics to set clipping threshold scalars and cannot be shown to be optimal. We propose Optimally Clipped Tensors And Vectors…

Cited by 45SourcePDFScholar
2019

Accumulation Bit-Width Scaling For Ultra-Low Precision Training Of Deep Networks

ICLR 2019poster

Efforts to reduce the numerical precision of computations in deep learning training have yielded systems that aggressively quantize weights and activations, yet employ wide high-precision accumulators for partial sums in inner-product operations to preserve the quality of convergence. The absence of…

Cited by 43SourcePDFScholar
2018

An Analytical Method to Determine Minimum Per-Layer Precision of Deep Neural Networks

ICASSP 2018accepted

There has been growing interest in the deployment of deep learning systems onto resource-constrained platforms for fast and efficient inference. However, typical models are overwhelmingly complex, making such integration very challenging and requiring compression mechanisms such as reduced precision…

Cited by 0SourceScholar
2018

True Gradient-Based Training of Deep Binary Activated Neural Networks Via Continuous Binarization

ICASSP 2018accepted

With the ever growing popularity of deep learning, the tremendous complexity of deep neural networks is becoming problematic when one considers inference on resource constrained platforms. Binary networks have emerged as a potential solution, however, they exhibit a fundamentallimi-tation in realizi…

Cited by 0SourceScholar
2017

Analytical Guarantees on Numerical Precision of Deep Neural Networks

ICML 2017poster

The acclaimed successes of neural networks often overshadow their tremendous complexity. We focus on numerical precision – a key parameter defining the complexity of neural networks. First, we present theoretical bounds on the accuracy in presence of limited precision. Interestingly, these bounds ca…

Cited by 123SourcePDFScholar
2017

Minimum precision requirements for the SVM-SGD learning algorithm

ICASSP 2017accepted

It is well-known that the precision of data, weight vector, and internal representations employed in learning systems directly impacts their energy, throughput, and latency. The precision requirements for the training algorithm are also important for systems that learn on-the-fly. In this paper, we…

Cited by 0SourceScholar