Good Papers

Showing papers from The Pennsylvania State University Show all papers

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

Progress-Aware Distillation for Mitigating Stagnation in Small Language Model Agents

Yuanpu Cao, Saket Sathe, Hanyu Wang, Ziyi Yin and 2 more

Atlanta Poster Session 2, Wed, Dec 9, 4:30 PM–7:30 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
45%Niche pick
?Niche pickVote to see the score

Uncertainty Aware SURE Transfer Learning for Classification Problems

Haoyue Li, Shubo Li, Runze Li

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

– ReadersNo votes yet
0/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: 0 of 20 reviewers recommend it
lenient 0/5
medium 0/10
strict 0/5
45%Niche pick
?Niche pickVote to see the score

Search-Tree Scaling in Parallel Monte Carlo Tree Search

Scott Cheng, Meng-Yu Tsai, Ding-Yong Hong, Mahmut T Kandemir

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

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

Preference Conditioned Multi-Objective Reinforcement Learning: Decomposed, Diversity-Driven Policy Optimization

D³PO fixes multi-objective RL via decomposed per-objective updates, late preference weighting, and diversity regularization to recover dense Pareto fronts with one policy.

Tanmay Ambadkar, Sourav Panda, Shreyash Kale, Jonathan Dodge and 1 more

Atlanta Poster Session 1, Wed, Dec 9, 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 3/5
medium 9/10
strict 1/5
74%Highly rated
?Highly ratedVote to see the score

Generalizing Test-time Compute-optimal Scaling as an Optimizable Graph

This paper formalizes test-time scaling as an optimizable multi-LLM collaboration graph and proposes Agent-REINFORCE to search compute-optimal architectures under budget constraints. Experiments show it outperforms baselines in efficiency and finds graphs balancing accuracy with latency.

Fali Wang, Jihai Chen, Shuhua Yang, Runxue Bao and 6 more

Atlanta Poster Session 3, Thu, Dec 10, 10:00 AM–1:00 PM, Hall C1 · Published 2026

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