<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hyperbolic Geometry on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/hyperbolic-geometry/</link><description>Recent content in Hyperbolic Geometry on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Wed, 01 May 2024 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/hyperbolic-geometry/index.xml" rel="self" type="application/rss+xml"/><item><title>HCGR: Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation</title><link>https://www.chenk.top/en/standalone/hcgr/</link><pubDate>Wed, 01 May 2024 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/standalone/hcgr/</guid><description>&lt;p>A user opens a sneaker app, taps &amp;ldquo;running shoes,&amp;rdquo; drills into a brand, then a price band, and finally a single SKU. This trajectory forms a &lt;em>tree&lt;/em>: each click narrows the candidate set roughly multiplicatively. In Euclidean space, you need many dimensions to keep all the leaves of the tree apart because the volume grows polynomially with radius. In hyperbolic space, volume grows &lt;em>exponentially&lt;/em> with radius, so the tree fits naturally — a few dimensions are enough to keep the long tail untangled.&lt;/p></description></item></channel></rss>