按年被提到
20202020 · 3 次2026
机器学习与深度学习›优化与可微编程·arXiv:2002.08676 · cs.LG

Learning with Differentiable Perturbed Optimizers

Quentin Berthet, Mathieu Blondel, Olivier Teboul, Marco Cuturi, Jean-Philippe Vert, Francis Bach · 2020
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2020-02-24 · 最近 2020-09-28
2不同的人
2活跃月份
3讨论串
53被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Machine learning pipelines often rely on optimization procedures to make discrete decisions (e.g., sorting, picking closest neighbors, or shortest paths). Although these discrete decisions are easily computed, they break the back-propagation of computational graphs. In order to expand the scope of learning problems that can be solved in an end-to-end fashion, we propose a systematic method to transform optimizers into operations that are differentiable and never locally constant. Our approach relies on stochastically perturbed optimizers, and can be used readily together with existing solvers. Their derivatives can be evaluated efficiently, and smoothness tuned via the chosen noise amplitude. We also show how this framework can be connected to a family of losses developed in structured prediction, and give theoretical guarantees for their use in learning tasks. We demonstrate experimentally the performance of our approach on various tasks.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论RrLbDpMo · 2020-02

“There's this work from the same team (posted the same day), more general problems with a different method https://arxiv.org/abs/2002.08676”

Fast Differentiable Sorting and Ranking原评论 ↗
被提交为 story · 2 次