Good Papers

Showing papers from Télécom Paris Show all papers

57%Worth a look
?Worth a lookVote to see the score

AR-Edit: Training-Free Streaming Video Editing without Inversion

Hovhannes Margaryan, Vicky Kalogeiton, Quentin Bammey, Christian Sandor

Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 PM, Paris Poster Hall · Published 2026

– ReadersNo votes yet
1/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 1 of 20 reviewers recommend it
lenient 1/5
medium 0/10
strict 0/5
78%Highly rated
?Highly ratedVote to see the score

A Comprehensive View of Fairness through Distributional Stability

Reframing fairness as distributional stability under protected-group shifts unifies classical fairness notions via Lipschitz constants and yields a second-order cone program with uniform test-time guarantees.

Gayane Taturyan, Charlotte Laclau, Stephan Clémençon

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4:30 PM, Paris Poster Hall · Published 2026

– ReadersNo votes yet
11/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 11 of 20 reviewers recommend it
lenient 4/5
medium 6/10
strict 1/5
78%Highly rated
?Highly ratedVote to see the score

Diff-CA: Separating Common and Salient Factors with Diffusion Models

Diff-CA conditions diffusion models to decompose image representations into common and salient factors via weak supervision, achieving high-fidelity contrastive generation and editing with provable factorization identifiability.

Michaël Soumm, Alexandre Fournier Montgieux, Yunlong HE, Pietro Gori and 1 more

Paris Poster Session 1, Wed, Dec 9, 12:30 PM–2:30 PM, Paris Poster Hall · Published 2026

– ReadersNo votes yet
11/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 11 of 20 reviewers recommend it
lenient 5/5
medium 5/10
strict 1/5
70%Highly rated
?Highly ratedVote to see the score

Decentralized Ranking Aggregation via Gossip: Convergence and Robustness

Gossip algorithms enable decentralized ranking aggregation via local peer interactions, yielding global consensus without central authority despite corrupted nodes and distributed preferences.

Kerrian Le Caillec, Anna van Elst, Igor Colin, Stephan Clémençon

Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7:30 PM, Paris Poster Hall · Published 2026

– ReadersNo votes yet
4/20 AI panelreviewers recommend it

Readers and the AI panel: vote on this paper to see what they said.

Only vote on papers you've read. Sign in with GitHub to vote.

AI panel: 4 of 20 reviewers recommend it
lenient 3/5
medium 1/10
strict 0/5