Good Papers

Showing papers from University of Padua Show all papers

67%Highly rated
?Highly ratedVote to see the score

Submodular Multi-Agent Reinforcement Learning for Effective Online Distributed Task Allocation

Jing Liu, Yangyang YANG, Luca Ballotta, Fangfei Li and 2 more

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

– ReadersNo votes yet
2/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: 2 of 20 reviewers recommend it
lenient 2/5
medium 0/10
strict 0/5
57%Worth a look
?Worth a lookVote to see the score

RankAlign: Unsupervised Vision-Language Representation Alignment via Rank Transformation

Enzhe Zhao, Marco Fiorucci, Lamberto Ballan

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4:30 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
70%Highly rated
?Highly ratedVote to see the score

Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions

Discrete Flow Matching achieves non-asymptotic KL and total variation convergence bounds under minimal approximation error assumptions with improved scaling in vocabulary size and dimension.

Le-Tuyet-Nhi PHAM, Giovanni Conforti, Zhenjie Ren, Alain Durmus

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4: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 2/5
medium 1/10
strict 1/5
71%Highly rated
?Highly ratedVote to see the score

Dynamic k-center clustering with lifetimes

A dynamic k-center model with known lifetimes achieves deterministic (2+ε)-approximation with amortized updates and linear memory, plus a (6+ε)-approximation with worst-case updates and sublinear memory.

Simone Moretti, Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci

Atlanta Poster Session 2, Wed, Dec 9, 4:30 PM–7:30 PM, Hall C1 · Published 2026

– ReadersNo votes yet
7/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: 7 of 20 reviewers recommend it
lenient 3/5
medium 2/10
strict 2/5