Source author record

Vincent Corlay

Vincent Corlay appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

5works
6topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Adaptive Transform Coding for Semantic Compression

Visual data compression is shifting from human-centered reconstruction to machine-oriented representation coding. In this setting, an image is often mapped to a compact semantic embedding, which is then compressed and transmitted for downstream inference. We propose an adaptive transform-coding method for semantic-feature compression motivated by the conditional rate-distortion function of a Gaussian mixture model. The scheme uses mode-dependent transforms and quantizers selected according to the inferred source component, enabling more efficient coding of heterogeneous feature distributions. Evaluations on features from widely used vision backbones and foundation models show that the proposed method outperforms or is competitive with state-of-the-art neural compression methods while preserving flexibility and interpretability.

preprint2022arXiv

A simple Sign-Bit Probabilistic Shaping Scheme

We propose a new shaping scheme for the Gaussian channel whose complexity is approximately half the one of a binary distribution matcher (DM). The result is obtained as follows: We first show that most of the shaping gain can be obtained via a simplified version of sign-bit shaping, which uses only two non-uniform binary sources. This is achieved by considering a stepwise Maxwell-Boltzmann-like distribution of the symbols. One of the two binary sources has a parameter $p$ close to 0. Hence, we then describe a binary DM which explicitly takes advantage of this aspect and has a negligible complexity. Since the two binary sources are used alternately with equal probability, the complexity of the proposed shaping scheme is half the one of the second binary DM.

preprint2022arXiv

On the latency of multi-level polar coded modulations

A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that the decoding time complexity of the multi-level scheme, using successive-cancellation list decoding for each polar code, is only 1.5 times the one of a single polar code, regardless of the signal-to-noise ratio and the number of levels.

preprint2020arXiv

A lattice-based approach to the expressivity of deep ReLU neural networks

We present new families of continuous piecewise linear (CPWL) functions in Rn having a number of affine pieces growing exponentially in $n$. We show that these functions can be seen as the high-dimensional generalization of the triangle wave function used by Telgarsky in 2016. We prove that they can be computed by ReLU networks with quadratic depth and linear width in the space dimension. We also investigate the approximation error of one of these functions by shallower networks and prove a separation result. The main difference between our functions and other constructions is their practical interest: they arise in the scope of channel coding. Hence, computing such functions amounts to performing a decoding operation.