<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:media="http://search.yahoo.com/mrss/"><channel><title>Cross-Entropy on k4i's blog</title><link>https://k4i.top/zh/tags/cross-entropy/</link><description>Recent content in Cross-Entropy on k4i's blog</description><generator>Hugo -- gohugo.io</generator><language>zh</language><managingEditor>sky_io@outlook.com (K4i)</managingEditor><webMaster>sky_io@outlook.com (K4i)</webMaster><copyright>All content is subject to the license of &lt;a rel="license noopener" href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank"&gt;CC BY-NC-SA 4.0&lt;/a&gt; .</copyright><lastBuildDate>Tue, 23 Jun 2026 10:00:00 +0800</lastBuildDate><atom:link href="https://k4i.top/zh/tags/cross-entropy/index.xml" rel="self" type="application/rss+xml"/><item><title>Loss Function：模型到底在优化什么</title><link>https://k4i.top/zh/posts/loss-functions-cross-entropy/</link><pubDate>Tue, 23 Jun 2026 10:00:00 +0800</pubDate><author>sky_io@outlook.com (K4i)</author><atom:modified>Tue, 23 Jun 2026 10:00:00 +0800</atom:modified><guid>https://k4i.top/zh/posts/loss-functions-cross-entropy/</guid><description>&lt;p&gt;前向传播给出预测，反向传播计算梯度，梯度下降更新参数。但中间还有一个非常关键的问题：&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;预测结果到底怎样才算“错”？错多少？&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;这个问题由 &lt;strong&gt;loss function（损失函数）&lt;/strong&gt; 回答。它把模型输出和真实标签变成一个标量：&lt;/p&gt;</description><dc:creator>K4i</dc:creator><media:content url="https://k4i.top//images/icons/gradient-descent.png" medium="image"><media:title type="html">featured image</media:title></media:content><category>deep-learning</category><category>loss-function</category><category>cross-entropy</category><category>gradient-descent</category><category>AI</category></item></channel></rss>