<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Property on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/property/</link><description>Recent content in Property on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 08:52:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/property/index.xml" rel="self" type="application/rss+xml"/><item><title>The Gram Matrix Is Positive Semi-Definite (property)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-property-gram-psd/</link><pubDate>Mon, 21 Sep 2026 08:52:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-property-gram-psd/</guid><description>&lt;p&gt;&lt;strong&gt;Demo note.&lt;/strong&gt; This note demonstrates what the &lt;strong&gt;SciDraft&lt;/strong&gt; Hugo theme can do
for academic and scientific publishing — for research institutions, researchers
and students. Its content is demonstration material only: readers should ignore
whether the demo content is correct.&lt;/p&gt;
&lt;p&gt;The matrix of pairwise inner products of a set of vectors has a property that constrains
what similarity patterns are possible: it is symmetric and positive semi-definite, so its
eigenvalues are non-negative and its diagonal entries are the squared lengths of the
vectors.&lt;/p&gt;</description></item><item><title>Cross-Entropy Is Convex in the Logits (property)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-property-cross-entropy-convex/</link><pubDate>Mon, 21 Sep 2026 08:02:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-property-cross-entropy-convex/</guid><description>&lt;p&gt;&lt;strong&gt;Demo note.&lt;/strong&gt; This note demonstrates what the &lt;strong&gt;SciDraft&lt;/strong&gt; Hugo theme can do
for academic and scientific publishing — for research institutions, researchers
and students. Its content is demonstration material only: readers should ignore
whether the demo content is correct.&lt;/p&gt;
&lt;p&gt;Convexity of a loss in the parameters is rare in deep learning, but convexity in the
scores is not, and the cross-entropy of a softmax has it. The property is what guarantees
that the inner optimisation — fitting the output layer, probing a frozen representation —
has no local minima to fall into.&lt;/p&gt;</description></item></channel></rss>