Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2502.18611
Cited By
Tight Bounds on the Binomial CDF, and the Minimum of i.i.d Binomials, in terms of KL-Divergence
25 February 2025
Xiaohan Zhu
Mesrob I. Ohannessian
Nathan Srebro
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Tight Bounds on the Binomial CDF, and the Minimum of i.i.d Binomials, in terms of KL-Divergence"
2 / 2 papers shown
Title
Learning to Choose or Choosing to Learn: Best-of-N vs. Supervised Fine-Tuning for Bit String Generation
Seamus Somerstep
Vinod Raman
Unique Subedi
Yuekai Sun
76
0
0
22 May 2025
Quantifying Overfitting along the Regularization Path for Two-Part-Code MDL in Supervised Classification
Xiaohan Zhu
Nathan Srebro
118
0
0
03 Mar 2025
1