<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>NLP on Aditya Bavadekar</title><link>https://adityabavadekar.github.io/tags/nlp/</link><description>Recent content in NLP on Aditya Bavadekar</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 09 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://adityabavadekar.github.io/tags/nlp/index.xml" rel="self" type="application/rss+xml"/><item><title>Spectral Graph Pruning for Context Optimization in Retrieval-Augmented Generation</title><link>https://adityabavadekar.github.io/papers/spectral-graph-pruning/</link><pubDate>Sat, 09 May 2026 00:00:00 +0000</pubDate><guid>https://adityabavadekar.github.io/papers/spectral-graph-pruning/</guid><description>&lt;h3 id="abstract"&gt;
 Abstract
 &lt;a class="anchor" href="#abstract" aria-hidden="true"&gt;#&lt;/a&gt;
&lt;/h3&gt;
&lt;p&gt;Spectral Graph Pruning (SGP) is a framework for efficient context optimization and compression in Retrieval-Augmented Generation (RAG). It models retrieved text segments as a heterogeneous semantic graph and applies query-biased spectral centrality analysis to identify and retain the most structurally important segments. SGP reduces token consumption by 40-50% while maintaining high reasoning accuracy on multi-hop benchmarks.&lt;/p&gt;
&lt;h3 id="methodology"&gt;
 Methodology
 &lt;a class="anchor" href="#methodology" aria-hidden="true"&gt;#&lt;/a&gt;
&lt;/h3&gt;
&lt;p&gt;The SGP framework constructs a heterogeneous graph representing Chunk Nodes, Entity Nodes, and Structural document hierarchy.&lt;/p&gt;</description></item></channel></rss>