Institution profile

Télécom Paris

Academic institutioneurope · fr
Official website
Research library302linked papers
Opportunities0open roles
Selected work

Representative Papers

Plug-and-Play image restoration with Stochastic deNOising REgularization

Feb 01, 2024International Conference on Machine Learning

Plug-and-Play (PnP) algorithms apply denoisers to progressively noise-decaying iterates, conflicting with diffusion models (DMs), which deploy denoisers exclusively on controllably noisy data. This inconsistency undermines theoretical alignment and practical performance. Method: We propose SNORE—a stochastic noise-level-adaptive regularization framework for image inverse problems (e.g., deblurring, inpainting). SNORE constructs a noise-level-matched stochastic gradient descent optimizer via explicit noise-aware regularization. Contribution/Results: This is the first PnP method to incorporate noise-perceptive stochastic regularization, unifying PnP and DM denoising logic while providing rigorous convergence and annealing-theoretic analysis. Experiments demonstrate that SNORE, when integrated with deep denoisers (e.g., DnCNN), achieves state-of-the-art performance on deblurring and inpainting—outperforming prior methods in PSNR, SSIM, and perceptual quality.

8 citations2 influentialRead paper

Efficient Hamiltonian, structure and trace distance learning of Gaussian states

Nov 05, 2024arXiv.org

This work addresses the efficient learning of thermal bosonic Gaussian states at positive temperature, aiming to jointly infer the underlying quadratic Hamiltonian parameters, interaction graph structure, and approximate the state in trace distance—using only heterodyne measurements and with low sample complexity. Under bounded temperature, squeezing magnitude, displacement amplitude, and graph maximum degree, we propose a method based on local covariance submatrix estimation and a novel local inversion technique, circumventing full covariance matrix estimation. Leveraging continuity bounds between Hamiltonians and covariance matrices, we achieve, for the first time, quadratic-precision learning of Gaussian states in trace distance: achieving error ε requires only $O(varepsilon^{-2})$ samples, with polynomial dependence on system parameters. The algorithm is both sample- and computationally efficient, providing the first practical framework for continuous-variable quantum state learning with rigorous trace-distance guarantees.

4 citationsRead paper

Contrastive Knowledge Distillation for Embedding Refinement in Personalized Speech Enhancement

Apr 06, 2025IEEE International Conference on Acoustics, Speech, and Signal Processing

This work addresses the limitations of conventional personalized speech enhancement methods, which rely on pre-extracted static speaker embeddings that struggle to adapt to target speaker variations during inference and require computationally expensive upstream models for high-quality embeddings. To overcome these challenges, the authors propose a lightweight speaker encoder with only 150K parameters, coupled with a contrastive knowledge distillation strategy tailored for embedding optimization. This approach enables dynamic refinement of speaker representations at inference time by efficiently distilling discriminative features from a complex teacher model. The proposed method achieves significant performance gains in speech enhancement while maintaining minimal computational overhead.

3 citationsRead paper

Promises, Perils, and (Timely) Heuristics for Mining Coding Agent Activity

Jan 26, 2026

This study addresses the lack of systematic empirical evidence regarding the real-world impact of coding agents in software development. Leveraging Mining Software Repositories (MSR) methods, it presents the first large-scale analysis of activity traces from large language model–based coding agents on GitHub, systematically identifying their behavioral patterns, potential risks, and effective usage strategies in authentic development environments. The research yields a set of empirically grounded insights concerning optimal timing for agent adoption, reliability concerns, and practical heuristics for deployment. These findings fill a critical gap in the literature, offering actionable guidance for developers and establishing a foundation for future investigations into AI-assisted programming.

2 citationsRead paper
Recent publications

Latest Papers

TuiML: Machine Learning for AI Agents

Sep 15, 2026

为解决AI代理使用传统机器学习库时遇到的问题,本文提出TuiML,一个专为AI代理设计的自包含机器学习库,通过可机读元数据和参数模式提高搜索、验证及实验再现性。

0 citationsRead paper