Good Papers

Showing Learning theory Show all papers

45%Niche pick
?Niche pickVote to see the score

Bentkus-type asymptotic e-values

Diego Martinez Taboada, Ben Chugg, Aaditya Ramdas

Sydney Poster Session 2, Tue, Dec 8, 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
45%Niche pick
?Niche pickVote to see the score

A Theory of Adversary-Directed Online Learning

Steve Hanneke, Amirreza Shaeiri

Atlanta Poster Session 4, Thu, Dec 10, 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
67%Highly rated
?Highly ratedVote to see the score

Settling the Sample Complexity of Deterministic Agnostic PAC Learning

Shai Ben-David, Steve Hanneke, Farnam Mansouri, Amirreza Shaeiri

Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 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.

45%Niche pick
?Niche pickVote to see the score

Information-Theoretic Generalization for Set-Input Optimization-Valued Objectives

Futoshi Futami, Masahiro Fujisawa

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Bounds on Extrapolation across Phase Transitions with Generalized Regression

Jeffrey Wei, Manolis Zampetakis, John Sous

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Proper Agnostic Learning of Functions of Halfspaces

Sergei Tikhonov, Arsen Vasilyan

Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 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

Escaping Parameter Space: Tight Generalization Bounds via Representation Quality

Niclas A Göring, Shuofeng Zhang, Branton DeMoss, Ard Louis

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

Fault Tolerant Coresets

Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam

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

Post-Processing Guarantees for Classification under Linear-Fractional Performance Metrics

Andrea Della Vecchia

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Complete or Sparse: A Tale of Two Identifiabilities

Junze Zhou, David Klindt

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Sample Complexity of Linear Regression under Random-Location Coordinate Corruptions

Ilias Diakonikolas, Jingyi Gao, Daniel Kane, Thanasis Pittas

Atlanta Poster Session 4, Thu, Dec 10, 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.

45%Niche pick
?Niche pickVote to see the score

(Strongly) Replicable Distribution Testers imply High Probability Distribution Testers

Ilias Diakonikolas, Jingyi Gao, Daniel Kane, Sihan Liu and 1 more

Atlanta Poster Session 3, Thu, Dec 10, 10:00 AM–1:00 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

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.

45%Niche pick
?Niche pickVote to see the score

Tree-Sliced Orlicz Integral Probability Metric

Tuan Hoang, Trung-Khang Tran, Viet-Hoang Tran, Tan Nguyen

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1: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.

45%Niche pick
?Niche pickVote to see the score

Can Metadata Fix the Gauge? Calibration Turns Sparse Multi-Source Learning from Sparse PCA into Sparse Mean Recovery

Yibo Zhou, Yirong Xiang

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4: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.

45%Niche pick
?Niche pickVote to see the score

Quantum Composite Hypothesis Testing with Small Error

Chenghua Liu, Qisheng Wang

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Improved Algorithms for Online Classification with Surrogate Losses

Abed Razawy, Valentina Masarotto, Dirk van der Hoeven

Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Adaptive Random Forests from Online Learning and Testing by Betting

Salim I. Amoukou, Saumitra Mishra, Manuela Veloso

Sydney Poster Session 2, Tue, Dec 8, 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
45%Niche pick
?Niche pickVote to see the score

Looking Through the Mirror: Minimax-Optimal Regularized Regrets in Online Learning and Bandits

Junghyun Lee, Yujun Kim, Chulhee Yun, Se-Young Yun

Sydney Poster Session 2, Tue, Dec 8, 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
45%Niche pick
?Niche pickVote to see the score

Toward Minimal-dimensional Convex Calibrated Surrogate Losses for Classification with Rejection

Yuzhou Cao, Han Bao, Bo An

Sydney Poster Session 2, Tue, Dec 8, 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
45%Niche pick
?Niche pickVote to see the score

Learning from Ranking Feedback: Improved Regret Bounds via Independence Preserving Rank Breaking

Nigel Strachan, Sattar Vakili, Matthijs Spaan, Julia Olkhovskaya

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4: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.

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

No Free Best-of-Both-Worlds Learning in Repeated Bilateral Trade

Yutian Cheng, Canzhe Zhao, Jingye Zhao, Shuai Li

Sydney Poster Session 3, Wed, Dec 9, 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 0/5
medium 0/10
strict 1/5
45%Niche pick
?Niche pickVote to see the score

Majority-of-Three is an Optimal PAC Learner

Grigoris Velegkas

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Importance-Weighted Operator Learning Under Probability Measure Shifts

Lei Sun, Yusuke Tanaka, Xiaocheng Shang, Takaharu Yaguchi and 1 more

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Harnessing Data Asymmetry in Manifold Learning

Thomas Dagès, Simon Weber, Daniel Cremers, Ron Kimmel

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.

45%Niche pick
?Niche pickVote to see the score

Second-Order Complexity Theory for Risk, Explanation, and Calibration in Machine Learning

Yoshihiro Maruyama

Sydney Poster Session 6, Thu, Dec 10, 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
45%Niche pick
?Niche pickVote to see the score

Certification-Enhanced Generalization Bounds

Leo Elmecker-Plakolm, Matthew R Wicker

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Finite Resources False Discovery Rate Control on Structured Hypothesis Spaces

Binyamin Perets, Shie Mannor

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
45%Niche pick
?Niche pickVote to see the score

Tight Gap-Dependent Regret Bounds and Problem-Independent Bounds for Cost-aware Cascading Bandits

Yuji TAMAKOSHI, Shinji Ito

Sydney Poster Session 2, Tue, Dec 8, 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.

45%Niche pick
?Niche pickVote to see the score

Phase Transitions in Heavy-Tailed Mean Estimation under $\ell_p$ Norms

Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, Mikael Møller Høgsgaard, Kasper Green Larsen and 1 more

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1: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.

45%Niche pick
?Niche pickVote to see the score

Sub-Gaussian Confidence Intervals for Heavy-Tailed Data: Characterizing the Limits of Inference

Ilyes Hammouda, Stanislav Minsker, Mohamed Ndaoud

Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7: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.

45%Niche pick
?Niche pickVote to see the score

Linear-time rule mining under formal guarantees

Jonathan Feldstein, Dominic Phillips, Efthymia Tsamoura

Paris Poster Session 1, Wed, Dec 9, 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.

45%Niche pick
?Niche pickVote to see the score

The Benefits of Temporal Correlations: SGD Efficiently Learns k-Juntas from Random Walks

Elisabetta Cornacchia, Dan Mikulincer, Elchanan Mossel

Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1: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.

45%Niche pick
?Niche pickVote to see the score

Tropical Gaussian Anticoncentration: Settling Optimal Instance-Dependent Bounds for Online Learning in Extensive-Form Games

Ashkan Soleymani, Zhiyuan Fan, Lillian Ratliff, Patrick Jaillet and 1 more

Sydney Poster Session 6, Thu, Dec 10, 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
67%Highly rated
?Highly ratedVote to see the score

Is Memorization Actually Necessary for Generalization

Hadi Abdullah

Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8: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 1/5
medium 1/10
strict 0/5
45%Niche pick
?Niche pickVote to see the score

Can Ideologues Agree on Quality? From Non-identifiable Latent Factors to Collective Outcomes

David Gamba, Seura Ha, Daniel Romero, Grant Schoenebeck

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

On Minimizing Regret in Fixed-Confidence $\varepsilon$-Best Arm Identification

Tianyuan Jin, Junwen Yang, Vincent Tan

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Exact-Form Regret and Conservative Correlated Equilibria

Ashkan Soleymani, Patrick Jaillet, Gabriele Farina

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
45%Niche pick
?Niche pickVote to see the score

Invariance and Body-Order Compose Additively: Minimax Rates on $\mathrm{SO}(3)^n$

Zheshuo Li, Zhengxiong Li

Atlanta Poster Session 6, Fri, Dec 11, 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

Rare-Tail Statistics For Learning Biased Gaussian Halfspaces with Label Noise

Prateeti Mukherjee, Arya Mazumdar, Harsh Vardhan

Atlanta Poster Session 3, Thu, Dec 10, 10:00 AM–1:00 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

Generalized Adaptive Boosting and the Geometry of Mistakes

Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi, Emmanuel Esposito and 3 more

Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 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.

45%Niche pick
?Niche pickVote to see the score

Smoothed Elicitation Complexity for Approximate $\Gamma$-calibration of Discrete Classification Tasks

Jessica Finocchiaro, Victor Ganson, Drona Khurana

Atlanta Poster Session 4, Thu, Dec 10, 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.

45%Niche pick
?Niche pickVote to see the score

The Long-Run Distribution of Regularized Learning in Non-Concave Games: A Large Deviations Approach

Waïss Azizian, Pierre-Louis Cauvin, Franck Iutzeler, Jérôme Malick and 1 more

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

Worst-Case Regret Bounds for Combinatorial Bandits with Ranking Feedback

Cristiano Migali, Gianmarco Genalti, Alberto Maria Metelli, Marco Mussi

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1: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.

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

Beyond Marginal Coverage: Efficient Localized Conformal Prediction via Residual Rank Calibration

Xiangshi Li, Wenqing He

Atlanta Poster Session 4, Thu, Dec 10, 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.

45%Niche pick
?Niche pickVote to see the score

Quantum Best Arm Identification with Limited Round of Adaptivity: Lower Bounds and Algorithms

Haoran Li, Chen Wang, Xuchuang Wang

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1: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.

45%Niche pick
?Niche pickVote to see the score

In-Context Benign Overfitting: A Feature-Selection Model in Linear Regression ICL

Puneesh Deora, Bhavya Vasudeva, Christos Thrampoulidis

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1: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
45%Niche pick
?Niche pickVote to see the score

Debiasing Sketched Ridge Regression: A Functional Estimation Perspective

Yucong Liu, Florian Schäfer

Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 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.

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

Resolving AdaBoost Cycling with LLMs: A Computer-Assisted Counterexample

Erik Wang

Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8: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 0/5
medium 0/10
strict 1/5
45%Niche pick
?Niche pickVote to see the score

Fast, Relaxation‑ and Hyperparameter‑Free Pairwise Worst-Case Class Separation

Mohammad Mahdi Omati, Arash Amini, Nezam Mahdavi-Amiri

Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7: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.

45%Niche pick
?Niche pickVote to see the score

Minimax-Optimal Transformer Classification for Functional Data with Dense-Sparse Phase Transition

Shuoyang Wang, Yidan Tian, Guanqun Cao

Atlanta Poster Session 4, Thu, Dec 10, 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.

71%Highly rated
?Highly ratedVote to see the score

Persistent-Transient Policy Evaluation for Markov Chains via Minimal Peripheral Quotients

Quotienting Markov chains by their peripheral invariant subspace separates persistent regime profiles from transient dynamics for stable policy evaluation.

Yang Xu, Vaneet Aggarwal

Atlanta Poster Session 6, Fri, Dec 11, 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.

78%Highly rated
?Highly ratedVote to see the score

A mathematical theory of balancing relational generalization and memorization

A theory of transitive inference with exceptions shows relational generalization and memorization depend on representational geometry, with pretrained language models exhibiting predicted systematic errors.

Luke Cheng, Samuel Lippl

Sydney Poster Session 3, Wed, Dec 9, 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.

72%Highly rated
?Highly ratedVote to see the score

Generating in the Limit with Infinitely Many Hallucinations

Language generation in the limit is recast as recall-precision trade-offs, showing that allowing infinitely many vanishing-frequency hallucinations can strictly increase recall when adversaries withhold target portions.

Irene Strauss, Alexandra Butoi, Ryan Cotterell

Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8:00 PM, Hall 1-4 · 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.

76%Highly rated
?Highly ratedVote to see the score
NeurIPS 2026SpotlightHSLULearning theory

Nearly Optimal Robust Covariance and Scatter Matrix Estimation Beyond Gaussians

A polynomial-time algorithm robustly estimates elliptical scatter matrices with nearly optimal samples and error beyond Gaussians.

Gleb Novikov

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Information-Theoretic Generalization Bounds for Sequential Decision Making

A sequential supersample framework bounds sequential decision-making generalization via roundwise mutual information and faster Bernstein rates, applying to online learning and bandits.

Futoshi Futami, Masahiro Fujisawa

Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · 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.

74%Highly rated
?Highly ratedVote to see the score

Adaptive Calibration in Non-Stationary Environments

Online prediction algorithms achieve calibration error adapting to non-stationarity via $\tilde O(\min\{\sqrt{T}+(TC)^{1/3},\sqrt{KT}\})$ bounds, smoothly interpolating between i.i.d. and adversarial settings.

Junyan Liu, Haipeng Luo, Lillian Ratliff

Atlanta Poster Session 5, Fri, Dec 11, 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.

88%Must read
?Must readVote to see the score

Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling

Determinantal sampling builds smaller k-clustering coresets with sub-quadratic ε dependence under mild data assumptions, breaking worst-case bounds.

Diptarka Chakraborty, Satyaki Mukherjee, Gaurav Vallabhdas Revankar, Hoang Son Tran

Paris Poster Session 4, Thu, Dec 10, 5:30 PM–7: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.

76%Highly rated
?Highly ratedVote to see the score

Logistic Bandits with $\tilde{O}(\sqrt{dT})$ Regret without Context Diversity Assumptions

SupSplitLog achieves near-optimal logistic bandit regret without context diversity assumptions via sample splitting and Newton-type corrections.

Seoungbin Bae, Dabeen Lee

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Profit Maximization in Bilateral Trade against a Smooth Adversary

A profit-maximizing broker achieves tight O√T regret against smooth adversaries in bilateral trade via continuity and hierarchical nets.

Simone Di Gregorio, Paul Duetting, Federico Fusco, Chris Schwiegelshohn

Paris Poster Session 6, Fri, Dec 11, 2:30 PM–4:30 PM, Paris Poster Hall · 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.

76%Highly rated
?Highly ratedVote to see the score

Estimation of the Label-Noise Transition Matrix with Performance Guarantees via Selective Classification

A selective-classification method estimates label-noise transition matrices with finite-sample guarantees while bypassing fragile class-posterior estimation.

Xabier de Juan, Santiago Mazuelas, Yilun Zhu, Clay Scott

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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.

74%Highly rated
?Highly ratedVote to see the score

Tree Search With Predictions

No algorithm achieves O(log η) search on general trees via distance predictions, but O(k log η) queries work for trees of pathwidth k with optimal complexity.

Michael Dinitz, Bob Dong

Atlanta Poster Session 5, Fri, Dec 11, 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.

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.

74%Highly rated
?Highly ratedVote to see the score

Mean Testing under Truncation beyond Gaussian

Under truncation hiding an ε-fraction of mass, mean testing faces a bias floor of order ν ε^{1−1/p}; above it a second-order test achieves near-optimal sample complexity, while median regularity restores classical √d testing rates.

Yuhao Wang, Roberto I Oliveira, Themis Gouleakis

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Intrinsic Riemannian Cross-covariance for Manifold-valued Random Objects

Intrinsic Riemannian cross-covariance defines manifold-valued covariance via parallel transport to a common tangent space, yielding coordinate-independent second-order descriptors with Euclidean-like properties and verified asymptotic behavior.

Carlos Soto, Cheng Wang, Yujing Huang, Xiaoyu Chen

Atlanta Poster Session 2, Wed, Dec 9, 4:30 PM–7:30 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.

71%Highly rated
?Highly ratedVote to see the score

Learning Theory of Transformers: Local-to-Global Approximation via Softmax Partition of Unity

Transformers approximate α-Hölder functions via softmax partition of unity with two encoder blocks, achieving near minimax-optimal generalization rates.

Zhongjie Shi, Wenjing Liao

Atlanta Poster Session 4, Thu, Dec 10, 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.

71%Highly rated
?Highly ratedVote to see the score

Learning to Persuade a Biased Receiver

Proposes safe exploration to learn a receiver's unknown belief bias via signaling, achieving optimal O(log log T) regret by exploiting asymmetric probing costs.

Yuqi Pan, Sadie Zhao, Milind Tambe, Yiling Chen

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.

80%Must read
?Must readVote to see the score

Deep Barycentric Regression for Optimal Transport Map Estimation and its Statistical Optimality

BROT estimates optimal transport maps via barycentric regression with deep networks, achieving minimax optimal convergence rates under Lipschitz conditions with stable training.

Kunwoong Kim, Insung Kong, Yongdai Kim

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.

72%Highly rated
?Highly ratedVote to see the score

Persuasive Prediction via Decision Calibration

Persuasive prediction learns decision-calibrated predictors from data without common priors, matching Bayesian persuasion utility with efficient algorithms.

Jingwu Tang, Jiahao Zhang, Fei Fang, Steven Wu

Atlanta Poster Session 2, Wed, Dec 9, 4:30 PM–7:30 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.

74%Highly rated
?Highly ratedVote to see the score

Human-AI Teaming Through the Lens of Calibration

Calibrated human-AI teaming shows combination methods lose human calibration, while delegation preserves predictor calibration but requires an unattainably precise rejector.

Eric Nalisnick, Chi Zhang, Chengxin Qian, Yixin Wang

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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 3/5
medium 5/10
strict 1/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.

70%Highly rated
?Highly ratedVote to see the score

Beyond Kemeny Medians: Consensus Ranking Distributions. Definition, Properties and Statistical Learning

Consensus ranking distributions approximate ranking distributions via sparse Dirichlet mixtures with optimal Kendall τ distortion expressed through pairwise probabilities, enabling efficient tree-structured statistical learning.

Stephan Clémençon, Ekhine Irurozki

Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 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.

71%Highly rated
?Highly ratedVote to see the score

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport

This paper develops minimax-optimal estimators for transport-growth pairs in unbalanced optimal transport and proves matching lower bounds via a stability reduction.

Donlapark Ponnoprat, Noboru Isobe, Masaaki Imaizumi

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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.

71%Highly rated
?Highly ratedVote to see the score

SGD in Multiclass Logistic Regression: Sequential Learning and Scaling Laws

Multiclass logistic regression learns Gaussian mixtures sequentially by class frequency, producing power-law risk phases and compute-optimal scaling laws.

Konstantinos Tsiolis, Denny Wu, Christos Thrampoulidis, Murat Erdogdu

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · 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.

74%Highly rated
?Highly ratedVote to see the score

Intrinsic-dimension empirical Bernstein inequalities for bounded self-adjoint operators

Empirical Bernstein inequalities for bounded self-adjoint operators replace unknown variance with data-driven estimates and scale with intrinsic dimension for dimension-free, infinite-dimensional guarantees.

Diego Martinez Taboada, Aaditya Ramdas

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · 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.

74%Highly rated
?Highly ratedVote to see the score

Prediction Under Imperfect Compression: A Theory of Approximate MDL

Approximate balanced MDL with additive slack yields finite cumulative squared error for regularization weight lambda at least 1, but multiplicative approximation and lambda under 1 cause failure, establishing additive approximation is essential.

Qian Li, Xinyu Mao, Shang-Hua Teng, Guangxu Yang

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

On the Convergence of Multicalibration Gradient Boosting

Multicalibration gradient boosting converges at O(1/sqrt(T)) with linear rates under smoothness, plus adaptive guarantees backed by experiments.

Daniel Haimovich, Fridolin Linder, Lorenzo Perini, Niek Tax and 1 more

Sydney Poster Session 1, Tue, Dec 8, 10:00 AM–1:00 PM, Hall 1-4 · 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.

76%Highly rated
?Highly ratedVote to see the score

Domination-Avoiding Learning Agents Cannot Collude

Domination-avoiding learning agents provably avoid collusion in competitive markets and converge to non-dominated strategies.

Noam Nisan, Emmanuel Zerah

Paris Poster Session 1, Wed, Dec 9, 12:30 PM–2: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.

76%Highly rated
?Highly ratedVote to see the score

Asymptotic Anytime-Valid Inference for U-statistics

Derives asymptotic anytime-valid confidence sequences for U-statistics via Hoeffding projections and a SAGE boundary, achieving optimal time-uniform rates for both nondegenerate and degenerate cases.

Leheng Cai, Qirui Hu, Weijia Li

Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 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 6/10
strict 2/5
88%Must read
?Must readVote to see the score

Learn from your own latents and not from tokens: A sample-complexity theory

Latent prediction learns hierarchical latent trees with samples constant in depth L, exponentially more efficient than token-level self-supervision, making explicit multi-scale stacking largely redundant.

Daniel Korchinski, Alessandro Favero, Matthieu Wyart

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

– 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.

71%Highly rated
?Highly ratedVote to see the score

Transfer Learning of Linear Regression with Multiple Pretrained Models: Benefiting from More Pretrained Models via Overparameterization Debiasing

Overparameterized pretrained linear models risk transfer learning bias, but combining many with a multiplicative debiasing correction improves target predictions.

Daniel Boharon, Yehuda Dar

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · 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.

70%Highly rated
?Highly ratedVote to see the score

A second order regret bound for NormalHedge

A NormalHedge variant achieves second-order ε-quantile regret O(sqrt(V_T log(V_T/ε))) for easy sequences via self-concordance analysis.

Yoav S Freund, Nicholas Harvey, Victor S. Portella, Yabing Qi and 1 more

Atlanta Poster Session 6, Fri, Dec 11, 4:30 PM–7:30 PM, Hall C1 · 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.

76%Highly rated
?Highly ratedVote to see the score

Instance-Adaptive Online Multicalibration

An efficient online multicalibration algorithm adaptively refines a dyadic grid to interpolate between worst-case and benign sequences, achieving rates from O(T^{2/3}) down to O(sqrt(T)) and O(sqrt(JT)) with tight threshold-complexity dependence.

Zhiming Huang, Jamie Morgenstern, Aaron Roth, Claire Jie Zhang

Atlanta Poster Session 1, Wed, Dec 9, 10:00 AM–1:00 PM, Hall C1 · 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.

74%Highly rated
?Highly ratedVote to see the score

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting

Multiclass PAC learning with bandit feedback is characterized by the new bandit DS dimension via pseudo-boxes, yielding sharp sample complexity scaling with total neighbors.

Steve Hanneke, Qinglin Meng, Shay Moran, Amirreza Shaeiri

Atlanta Poster Session 1, Wed, Dec 9, 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.

80%Must read
?Must readVote to see the score

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback

Online gradient descent achieves optimal O(sqrt(T)) regret for hidden-convex losses via sharper discrete equivalence, with a necessary Hessian compatibility condition and O(T^{3/4}) bandit regret.

Anas Barakat, Andreas Kontogiannis, Vasilis Pollatos, Ioannis Panageas and 1 more

Atlanta Poster Session 6, Fri, Dec 11, 4:30 PM–7:30 PM, Hall C1 · 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.

74%Highly rated
?Highly ratedVote to see the score

Learning Distributions from Multiple Data Providers

Pointwise consistency requires a connected co-occurrence graph and PAC learning needs completeness, with optimal sample complexity ranging from nearly linear to quadratic.

Jon Kleinberg, Amin Saberi, Xizhi Tan, Grigoris Velegkas

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

Capacity-Constrained Online Convex Optimization with Delayed Feedback

Capacity-constrained online convex optimization with delayed feedback achieves near-standard regret with logarithmic tracking capacity via randomized scheduling and weighted FTRL.

Alexander Ryabchenko, Idan Attias, Dan Roy

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · 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.

83%Must read
?Must readVote to see the score

Learning with Synthetic Data via SGD in High-Dimensional Linear Regression

One-pass SGD analysis of high-dimensional linear regression reveals mixed synthetic training causes model collapse, but two-stage curricula avoid the risk floor via synthetic pretraining.

Jichu Li, Difan Zou

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness

A projection-free second-order perceptron-style algorithm achieves O(d log T) contextual recommendation regret without Mahalanobis projections, improves efficiency over ONS, and remains robust to suboptimal feedback.

Shinsaku Sakaue

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · 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.

83%Must read
?Must readVote to see the score

Co-optimization for Adaptive Conformal Prediction

CoCP jointly learns interval centers and radii via alternating quantile regression and soft-coverage optimization, yielding shorter, asymptotically length-optimal conformal intervals with finite-sample validity.

Xiaoyi Su, Zhixin Zhou, Rui Luo

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

Closing the Gap on the Sample Complexity of 1-Identification

A new lower bound and matching logarithmic-factor upper bound are derived for the sample complexity of 1-identification in multi-armed bandits. The algorithm achieves near-optimal expected pulls uniformly across all instances via a novel optimization formulation.

ZITIAN LI, Wang Chi Cheung

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

– ReadersNo votes yet
3/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.

71%Highly rated
?Highly ratedVote to see the score

Why Learning Rediscovers the Closed-Form Diagonal Regularizer

Diagonal regularizers saturate at a prior-driven power law because isotropic truncation noise and eigenvalue counting yield flat loss landscapes, so learned diagonal forms barely beat the closed form and only cross-mode coupling enables real gains.

Jeahn Han, Pyojin Kim

Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Optimal Recalibration of an Online Predictor

An online algorithm achieves optimal ε-recalibration with ε² excess error in ε⁻³ rounds via Blackwell approachability, and yields simultaneous calibration and calibeating for smooth losses.

Lunjia Hu, Kevin Tian, Chutong Yang

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

Truthful Calibration Errors for Multi-Class Prediction

The paper defines truthful multiclass calibration errors for linear label properties, proves they preserve Blackwell informativeness ordering, and show they stabilize model rankings across bin choices.

Yuxuan Lu, Yifan Wu, Jason Hartline, Lunjia Hu

Atlanta Poster Session 6, Fri, Dec 11, 4:30 PM–7:30 PM, Hall C1 · 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.

74%Highly rated
?Highly ratedVote to see the score

ToMAToMP: Robust and Multi-Parameter Topological Clustering

ToMAToMP extends topological clustering to multiple functions via MMA decomposition, yielding robustness, automatic graph tuning, and outlier resistance with strong empirical gains.

Ludo Andrianirina, Mathieu Carrière

Paris Poster Session 1, Wed, Dec 9, 12:30 PM–2:30 PM, Paris Poster Hall · 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 3/5
medium 5/10
strict 1/5
76%Highly rated
?Highly ratedVote to see the score

Iterative Chow Filtering for Learning with Distribution Shift

Iterative Chow filtering enables efficient PQ learning via L1 sandwiching approximations, yielding quasipolynomial DNF algorithms and exponential improvements for circuits and polynomial thresholds.

Gautam Chandrasekaran, Georgios Gkrinias, Adam Klivans, Konstantinos Stavropoulos and 1 more

Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · 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.

72%Highly rated
?Highly ratedVote to see the score

Testable Learning of General Halfspaces under Massart Noise

A testable learning algorithm learns general Massart halfspaces under Gaussian marginals with quasi-polynomial complexity matching SQ lower bounds.

Ilias Diakonikolas, Giannis Iakovidis, Daniel Kane, Sihan Liu

Atlanta Poster Session 2, Wed, Dec 9, 4:30 PM–7:30 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 4/10
strict 2/5
78%Highly rated
?Highly ratedVote to see the score

Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals

Multiclass linear classification under Gaussian marginals achieves polynomial-time robust learning via pairwise and localization frameworks, yielding near-optimal error bounds and exposing perceptron limitations.

Ilias Diakonikolas, Giannis Iakovidis, Mingchen Ma

Atlanta Poster Session 5, Fri, Dec 11, 10:00 AM–1:00 PM, Hall C1 · 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.

76%Highly rated
?Highly ratedVote to see the score

Contrastive Identification and Generation in the Limit

Contrastive identification and generation in the limit studies learning from unlabeled differing pairs, yielding geometric characterizations, a strict generation hierarchy, and robust corruption reversal via common crossing graphs.

Xiaoyu Li, Andi Han, Jiaojiao Jiang, Junbin Gao

Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8:00 PM, Hall 1-4 · 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 1/5
medium 6/10
strict 3/5
78%Highly rated
?Highly ratedVote to see the score

Certification from Examples is Hard for Circuits and Transformers under Minimal Overparametrization

Certification becomes exponentially hard for slightly overparameterized depth-2+ circuits and constant-overhead transformers, requiring exponentially large example sets and allowing imperfect models to hide errors.

Artur Back de Luca, Kimon Fountoulakis

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

The Minimax Rate of Second-Order Calibration

Sech perturbation kernels make calibration functions analytic, enabling polynomial regression to estimate second-order calibration error at the minimax optimal rate of tilde O(1/sqrt(n)). This yields the first finite-sample guarantee for second-order Platt scaling and a bucket-free calibration defin

Kamil Ciosek, Banafsheh Rafiee, Sina Ghiassian, Nicolò Felicioni

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

Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds

Joint KL yields horizon-free approximation and linear estimation bounds, fully characterizing long-sequence autoregressive learning under misspecification.

Yunbei Xu, Yuzhe Yuan, Ruohan Zhan

Sydney Poster Session 6, Thu, Dec 10, 5:00 PM–8: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 2/5
medium 6/10
strict 3/5
72%Highly rated
?Highly ratedVote to see the score

A Theory of Time-Sensitive Language Generation: Sparse Hallucination Beats Mode Collapse

Eventually consistent generators cannot generate high-ranked strings before deadlines, but vanishing hallucination rates enable timely superlinear-deadline coverage, which is impossible under linear deadlines.

Atul Ganju, Travis McVoy, Shaddin Dughmi, Shang-Hua Teng

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1:00 PM, Hall 1-4 · 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 1/5
medium 5/10
strict 2/5
71%Highly rated
?Highly ratedVote to see the score

Even Sharper Bounds for Transductive Learning and Its Applications

STLC improves transductive local complexity bounds via modified log-Sobolev and entropy closure, matching inductive rates without extra logarithmic factors and yielding sharper kernel learning bounds.

Yingzhen Yang

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

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

Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret

CQB-η-2 improves contextual queueing bandit queue length regret to O~(T^-1/2) via phased exploration, matching a minimax lower bound.

Seoungbin Bae, Dabeen Lee

Sydney Poster Session 4, Wed, Dec 9, 5:00 PM–8:00 PM, Hall 1-4 · 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 1/5
medium 6/10
strict 3/5
72%Highly rated
?Highly ratedVote to see the score

Online Set Learning from Precision and Recall Feedback

Online set learning with randomized precision or recall feedback is learnable exactly when the hypothesis class has finite VC dimension, though standard empirical risk minimization can fail and algorithms must handle feedback dependencies to achieve regret bounds.

Lee Cohen, Yishay Mansour, Shay Moran, Han Shao

Paris Poster Session 3, Thu, Dec 10, 12:30 PM–2:30 PM, Paris Poster Hall · 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 3/5
medium 3/10
strict 2/5
72%Highly rated
?Highly ratedVote to see the score

Direct Estimation of Schrödinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guarantees

A direct Nadaraya-Watson estimator for Schrödinger bridge time-series drifts achieves uniform non-asymptotic bounds, a pointwise CLT, and adaptive minimax optimality by isolating statistical error from optimization errors.

Othmane Mazhar, Huyen PHAM

Sydney Poster Session 3, Wed, Dec 9, 10:00 AM–1:00 PM, Hall 1-4 · 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 4/10
strict 2/5
76%Highly rated
?Highly ratedVote to see the score

Minimax Rates and Spectral Distillation for Tree Ensembles

Tree ensemble minimax rates depend on induced kernel eigenvalue decay, and spectral compression yields orders-of-magnitude smaller distilled models with competitive accuracy.

Binh Vu, David Watson

Sydney Poster Session 2, Tue, Dec 8, 5:00 PM–8:00 PM, Hall 1-4 · 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 4/5
medium 6/10
strict 0/5
74%Highly rated
?Highly ratedVote to see the score

Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand

Conservative-Markdown Redirect-UCB Pricing achieves optimal Õ(T^{2/3}) regret for contextual dynamic pricing with agnostic non-Lipschitz demand, closing the prior regret gap.

Jianyu Xu, Yu-Xiang Wang

Atlanta Poster Session 4, Thu, Dec 10, 4:30 PM–7:30 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 2/5
medium 4/10
strict 3/5
Show 20 more papers