← Search

Tsachy Weissman

11 accepted papers

2026

GaussianVision: Vision-Language Alignment from Compressed Image Representations using 2D Gaussian Splatting

CVPR 2026

Modern vision-language pipelines are driven by RGB vision encoders trained on massive image-text corpora. While these pipelines have enabled impressive zero-shot capabilities and strong transfer across tasks, they still inherit two structural inefficiencies from the pixel domain: (i) transmitting de

Cited by 0SourceScholar
2025

ItDPDM: Information-Theoretic Discrete Poisson Diffusion Model

NeurIPS 2025poster

Generative modeling of non-negative, discrete data, such as symbolic music, remains challenging due to two persistent limitations in existing methods. Firstly, many approaches rely on modeling continuous embeddings, which is suboptimal for inherently discrete data distributions. Secondly, most model…

Cited by 0SourceScholar
2025

Win Fast or Lose Slow: Balancing Speed and Accuracy in Latency-Sensitive Decisions of LLMs

NeurIPS 2025spotlight

Large language models (LLMs) have shown remarkable performance across diverse reasoning and generation tasks, and are increasingly deployed as agents in dynamic environments such as code generation and recommendation systems. However, many real-world applications, such as high-frequency trading and…

Cited by 0SourcecodeScholar
2024

Adaptive Compression in Federated Learning via Side Information

AISTATS 2024poster

The high communication cost of sending model updates from the clients to the server is a significant bottleneck for scalable federated learning (FL). Among existing approaches, state-of-the-art bitrate-accuracy tradeoffs have been achieved using stochastic compression methods – in which the client n…

2023

Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimation

NeurIPS 2023poster

We study the mean estimation problem under communication and local differential privacy constraints. While previous work has proposed order-optimal algorithms for the same problem (i.e., asymptotically optimal as we spend more bits), exact optimality (in the non-asymptotic setting) still has not bee…

2023

Sparse Random Networks for Communication-Efficient Federated Learning

ICLR 2023poster

One main challenge in federated learning is the large communication cost of exchanging weight updates from clients to the server at each round. While prior work has made great progress in compressing the weight updates through gradient compression methods, we propose a radically different approach t…

2022

Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions

NeurIPS 2022accept

With the advent and increasing consolidation of e-commerce, digital advertising has very recently replaced traditional advertising as the main marketing force in the economy. In the past four years, a particularly important development in the digital advertising industry is the shift from second-pri…

Cited by 17SourcePDFScholar
2020

Overcoming High Nanopore Basecaller Error Rates for DNA Storage via Basecaller-Decoder Integration and Convolutional Codes

ICASSP 2020accepted

As magnetization and semiconductor based storage technologies approach their limits, bio-molecules, such as DNA, have been identified as promising media for future storage systems, due to their high storage density (petabytes/gram) and long-term durability (thousands of years). Furthermore, nanopore…

Cited by 0SourceScholar
2019

Neural Joint Source-Channel Coding

ICML 2019oral

For reliable transmission across a noisy communication channel, classical results from information theory show that it is asymptotically optimal to separate out the source and channel coding processes. However, this decomposition can fall short in the finite bit-length regime, as it requires non-tri…

2018

Entropy Rate Estimation for Markov Chains with Large State Space

NeurIPS 2018spotlight

Entropy estimation is one of the prototypical problems in distribution property testing. To consistently estimate the Shannon entropy of a distribution on $S$ elements with independent samples, the optimal sample complexity scales sublinearly with $S$ as $\Theta(\frac{S}{\log S})$ as shown by Valian…

Cited by 22SourcePDFScholar