Good Papers

Showing papers from Technische Universität Berlin Show all papers

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

Approximation Guarantees for Robust Aggregation in Federated Learning

Mélanie Cambus, Darya Melnyk, Tijana Milentijević, Stefan Schmid

Atlanta Poster Session 1, Wed, Dec 9, 10:00 AM–1:00 PM, Hall C1 · 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
67%Highly rated
?Highly ratedVote to see the score

How Much of a Model Do We Need? Redundancy and Slimmability in Remote Sensing Foundation Models

Leonard Hackel, Begum Demir, Tom Burgert

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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
70%Highly rated
?Highly ratedVote to see the score

Resilient Byzantine Agreement with Predictions

Byzantine agreement with predictors achieves tight consistency-robustness trade-offs and linear resilience degradation with prediction errors.

Julien Dallot, Darya Melnyk, Tijana Milentijević, Stefan Schmid and 1 more

Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026

– ReadersNo votes yet
5/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: 5 of 20 reviewers recommend it
lenient 0/5
medium 4/10
strict 1/5
83%Must read
?Must readVote to see the score

Manifold Sampling via Entropy Maximization

MASEM samples disconnected manifolds by entropy maximization via resampling, exponentially reducing KL divergence and improving Sinkhorn distance by an order of magnitude.

Cornelius Braun, Tilman Burghoff, Marc Toussaint

Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 PM, Hall C1 · Published 2026

– ReadersNo votes yet
13/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: 13 of 20 reviewers recommend it
lenient 5/5
medium 7/10
strict 1/5
80%Must read
?Must readVote to see the score

Symb-xMIL: Symbolic Explanations for Multiple Instance Learning in Digital Pathology

Symb-xMIL quantifies alignment between MIL predictions and human-readable logical rules to expose decision patterns, recover ground-truth rules, and refine survival stratification beyond HPV status.

Yanqng Luo, Julius Hense, Niklas Prenißl, Andreas Mock and 3 more

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026

– ReadersNo votes yet
12/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: 12 of 20 reviewers recommend it
lenient 5/5
medium 7/10
strict 0/5
71%Highly rated
?Highly ratedVote to see the score

Curvature-Dependent Lower Bounds for Frank-Wolfe

Frank-Wolfe achieves Ω(T^{-p/(p-1)}) lower bounds on p-uniformly convex sets for p ≥ 3 under exact line search or short steps, matching upper bounds via low-dimensional dynamics.

Jannis Halbey, Christophe Roux, Sebastian Pokutta

Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7:30 PM, Paris Poster Hall · 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 1/5
medium 4/10
strict 2/5
88%Must read
?Must readVote to see the score

SecureClaw: Clawing Back Control of LLM Agents

SecureClaw dual-bounds LLM agents by confining plaintext via opaque handles at the read boundary and enforcing authorized previews at the action sink, achieving near-zero attack success with preserved utility.

Yuhan Ma, Stefan Schmid

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

– ReadersNo votes yet
15/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: 15 of 20 reviewers recommend it
lenient 5/5
medium 8/10
strict 2/5
78%Highly rated
?Highly ratedVote to see the score

Fingerprinting Inference Systems of Large Language Models

LLM inference components cause detectable output deviations enabling fingerprinting of engines, attention backends, and hardware from queries.

Anna Wimbauer, Jonas Möller, Erik Imgrund, Konrad Rieck

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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
88%Must read
?Must readVote to see the score

When a Zero-Shooter Cheats: Improving Age Estimation via Activation Steering

Vision-language models use celebrity identity shortcuts rather than visual age cues, and activation steering suppresses this to cut mean absolute error by up to 25%.

Erik Imgrund, Pia Hanfeld, Klim Kireev, Konrad Rieck

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026

– ReadersNo votes yet
15/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: 15 of 20 reviewers recommend it
lenient 5/5
medium 9/10
strict 1/5
71%Highly rated
?Highly ratedVote to see the score

Learning-Augmented Online Scheduling with Parsimonious Preemption

Learning-augmented online scheduling achieves O(1)-competitive latency with O(1) preemptions per job on parallel machines, with overhead scaling logarithmically in prediction error.

Mugen Blue, Sungjin Im, Alexander Lindermayr

Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 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 2/5
medium 4/10
strict 1/5
70%Highly rated
?Highly ratedVote to see the score

Structural Causal Bottleneck Models

Structural causal bottleneck models assume causal effects depend on low-dimensional cause summaries, enabling flexible dimension reduction via standard algorithms, improved low-sample transfer, and identifiable bottlenecks.

Simon Bing, Jonas Wahl, Jakob Runge

Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8:00 PM, Hall 1-4 · Published 2026

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