<?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>研究生科研记录 on Haleuan&#39;s Blog</title>
    <link>https://haleuan.github.io/categories/%E7%A0%94%E7%A9%B6%E7%94%9F%E7%A7%91%E7%A0%94%E8%AE%B0%E5%BD%95/</link>
    <description>Recent content in 研究生科研记录 on Haleuan&#39;s Blog</description>
    <generator>Hugo</generator>
    <language>zh-cn</language>
    <lastBuildDate>Thu, 17 Apr 2025 01:19:16 +0000</lastBuildDate>
    <atom:link href="https://haleuan.github.io/categories/%E7%A0%94%E7%A9%B6%E7%94%9F%E7%A7%91%E7%A0%94%E8%AE%B0%E5%BD%95/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>论文精读 | Simple Is Effective</title>
      <link>https://haleuan.github.io/post/paperdive-simpleiseffective/</link>
      <pubDate>Thu, 17 Apr 2025 01:19:16 +0000</pubDate>
      <guid>https://haleuan.github.io/post/paperdive-simpleiseffective/</guid>
      <description>&lt;h2 id=&#34;metadata&#34;&gt;Metadata&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Title&lt;/strong&gt;: &lt;a href=&#34;https://arxiv.org/abs/2410.20724&#34;&gt;Simple Is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Venue&lt;/strong&gt;: ICLR 2025&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Source Code&lt;/strong&gt;: &lt;a href=&#34;https://github.com/Graph-COM/SubgraphRAG&#34;&gt;Github&lt;/a&gt;&lt;/p&gt;
&lt;h2 id=&#34;tldr&#34;&gt;TL;DR&lt;/h2&gt;
&lt;h3 id=&#34;motivation&#34;&gt;Motivation：&lt;/h3&gt;
&lt;ol&gt;
&lt;li&gt;Retriever效率和准确性之间的平衡。&lt;/li&gt;
&lt;li&gt;知识的结构信息没有被充分利用&lt;/li&gt;
&lt;/ol&gt;
&lt;hr&gt;
&lt;h2 id=&#34;sections&#34;&gt;Sections&lt;/h2&gt;
&lt;h3 id=&#34;the-subgraphrag-framework&#34;&gt;The SubgraphRAG Framework&lt;/h3&gt;
&lt;h4 id=&#34;图的建立&#34;&gt;图的建立&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;blockquote&gt;
&lt;p&gt;Given a training set of question-answer pairs D, the subgraph retriever learning problem can be formulated as the following problem:&lt;/p&gt;</description>
    </item>
    <item>
      <title>AutoGen学习笔记</title>
      <link>https://haleuan.github.io/post/note-of-autogen/</link>
      <pubDate>Wed, 04 Sep 2024 20:47:24 +0800</pubDate>
      <guid>https://haleuan.github.io/post/note-of-autogen/</guid>
      <description>学习AutoGen的一些简单笔记和大致框架</description>
    </item>
  </channel>
</rss>
