Good Papers

Showing papers from University of Iowa Show all papers

45%Niche pick
?Niche pickVote to see the score

Strongly Adaptive Online Learning with Time-Varying Movement Cost

Andrew Jacobsen, Hao Qiu, Emmanuel Esposito, Mengxiao Zhang

Paris Poster Session 3, Thu, Dec 10, 12:30 PM–2:30 PM, Paris Poster Hall · 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
57%Worth a look
?Worth a lookVote to see the score

DiffRisk: Diffusion Representation Learning with Informative Missingness for Health Risk Prediction

Shailesh Dahal, Ratri Mukherjee, Nicholas Mathews, Kishlay Jha

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

Near-Optimal Stochastic Linear Bandits with Delay

Stochastic linear bandits with delayed feedback yield near-optimal, dimension-free additive penalties for loss-independent delays but dimension-dependent penalties for loss-dependent delays, unlike multi-armed bandits.

Ofir Schlisselberg, Mengxiao Zhang, Yishay Mansour

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

– ReadersNo votes yet
10/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: 10 of 20 reviewers recommend it
lenient 2/5
medium 4/10
strict 4/5
72%Highly rated
?Highly ratedVote to see the score
NeurIPS 2026U IowaOptimization

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems

Penalty-based first-order methods solve bilevel minimax optimization without lower-level strong convexity, achieving O(ε^-4) deterministic and O(ε^-9) stochastic complexity.

Yiyang Shen, Yutian He, Weiran Wang, Qihang Lin

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

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