Latest

Every published item, in order · 8120 items
Nov 3
PapersMulti-source15:38
Chinese content非凸分布采样新算法:超越对数凹性的近端采样复杂度分析

理论向的文章:作者改进了近端采样器在非凸密度下的查询复杂度,LSI 条件下得到次多项式查询上界,还证明了 PI 情形的 oracle 下界。做采样理论的朋友可以看看证明思路。

Event
arXiv: OpenAI@Wei Guo et al. (6)Source
Tomorrow 08:00, the daily lands in your inboxTelegram channel or email. Same screening as this page, no ads.
PapersSelected15:17
Scaling Theory Links Multi-Epoch Pretraining Overfitting to Ensembling

As datasets saturate, labs will reuse data across epochs, and this work predicts when that overfits and how ensembling shifts the optimal stopping point. Practitioners planning pretraining or distillation budgets get concrete allocation rules rather than intuition. The FineWeb experiments make the theory testable against single-model scaling baselines.

Event
arXiv cs.LG@Zhen Yang et al. (3)Source

Only the latest 2000 items are listed; for older ones see the daily archive