{"id":1106013,"date":"2024-11-25T09:00:00","date_gmt":"2024-11-25T17:00:00","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?p=1106013"},"modified":"2025-06-06T11:42:49","modified_gmt":"2025-06-06T18:42:49","slug":"lazygraphrag-setting-a-new-standard-for-quality-and-cost","status":"publish","type":"post","link":"https:\/\/www.microsoft.com\/en-us\/research\/blog\/lazygraphrag-setting-a-new-standard-for-quality-and-cost\/","title":{"rendered":"LazyGraphRAG: Setting a new standard for quality and cost"},"content":{"rendered":"\n<figure class=\"wp-block-image size-large\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"576\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1024x576.png\" alt=\"A white geometric network icon with interconnected nodes and lines is centered on a gradient background transitioning from blue on the left to pink on the right.\" class=\"wp-image-1106046\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1024x576.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-300x169.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-768x432.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1066x600.png 1066w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-655x368.png 655w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-240x135.png 240w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-640x360.png 640w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-960x540.png 960w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1280x720.png 1280w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1.png 1400w\" sizes=\"auto, (max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<p><strong><em>Editor&#8217;s note, June 6, 2025 \u2013\u00a0<\/em><\/strong><em>If you would like to use LazyGraphRAG, the technology has been integrated into\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/nam06.safelinks.protection.outlook.com\/?url=https%3A%2F%2Fazure.microsoft.com%2Fen-us%2Fblog%2Ftransforming-rd-with-agentic-ai-introducing-microsoft-discovery%2F%23%3A~%3Atext%3DGet%2520started%2520today%2520by%2520using%2520Azure%2520HPC%2520and%2520Azure%2520AI%2520Foundry%2520infrastructure.%26text%3DMicrosoft%2520Discovery%2520is%2520built%2520on%2Cmake%2520any%2520adjustments%2520as%2520needed.&data=05%7C02%7Cambertingle%40microsoft.com%7C9493e5131162489a0afe08dda52854e3%7C72f988bf86f141af91ab2d7cd011db47%7C1%7C0%7C638848314819888780%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=zQW1wp5wiGCBr9By%2Bk%2BsIZwm4uD6jCUHUOBanhattBw%3D&reserved=0\" target=\"_blank\" rel=\"noopener noreferrer\">Microsoft Discovery<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>,\u00a0an agentic platform for scientific research built on Azure, and into\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/nam06.safelinks.protection.outlook.com\/?url=https%3A%2F%2Ftechcommunity.microsoft.com%2Fblog%2Fazurearcblog%2Ftransforming-on-premises-data-with-rag-capabilities-on-azure-local%2F4415217&data=05%7C02%7Cambertingle%40microsoft.com%7C9493e5131162489a0afe08dda52854e3%7C72f988bf86f141af91ab2d7cd011db47%7C1%7C0%7C638848314819902976%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=bzgvX2umce0%2B9BdSFmJB49lTfBu2y6ecACwJFsQdy%2F4%3D&reserved=0\" target=\"_blank\" rel=\"noopener noreferrer\">Azure Local<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>\u00a0services as part of a\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/nam06.safelinks.protection.outlook.com\/?url=https%3A%2F%2Ftechcommunity.microsoft.com%2Fblog%2Fazurearcblog%2Fempowering-the-physical-world-with-ai%2F4415204&data=05%7C02%7Cambertingle%40microsoft.com%7C9493e5131162489a0afe08dda52854e3%7C72f988bf86f141af91ab2d7cd011db47%7C1%7C0%7C638848314819916250%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&sdata=1ReUiWOwiuZtR6DGOpM9bGwYkEstnpsGUvL%2BSYiKBDY%3D&reserved=0\" target=\"_blank\" rel=\"noopener noreferrer\">public preview<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>.<\/em><\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"affordable-graphrag-for-every-use-case\">Affordable GraphRAG for every use case<\/h2>\n\n\n\n<p>The <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/aka.ms\/graphrag\" target=\"_blank\" rel=\"noopener noreferrer\">GraphRAG project<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> aims to expand the class of questions that AI systems can answer over private datasets by leveraging the implicit relationships within unstructured text.&nbsp;<\/p>\n\n\n\n<p>A key advantage of GraphRAG over conventional vector RAG (or \u201csemantic search\u201d) is its ability to answer <em>global<\/em> <em>queries<\/em> that address the entire dataset, such as \u201cwhat are the main themes in the data?\u201d, or \u201cwhat are the most important implications for X?\u201d. Conversely, vector RAG excels for <em>local<\/em> <em>queries<\/em> where the answer resembles the query and can be found within specific text regions, as is typically the case for \u201cwho\u201d, \u201cwhat\u201d, \u201cwhen\u201d, and \u201cwhere\u201d questions.&nbsp;<\/p>\n\n\n\n<p>In recent blog posts, we have shared two new query mechanisms that exploit the rich, summary-based data index created by GraphRAG to improve <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/blog\/introducing-drift-search-combining-global-and-local-search-methods-to-improve-quality-and-efficiency\/\" target=\"_blank\" rel=\"noreferrer noopener\">local search performance<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/blog\/graphrag-improving-global-search-via-dynamic-community-selection\/\" target=\"_blank\" rel=\"noreferrer noopener\">global search costs<\/a>, respectively.&nbsp;<\/p>\n\n\n\n<p>In this blog post, we introduce a radically different approach to graph-enabled RAG that requires no prior summarization of the source data, avoiding the up-front indexing costs that may be prohibitive for some users and use cases. We call this approach \u201cLazyGraphRAG\u201d.&nbsp;<\/p>\n\n\n\n<p>A key advantage of LazyGraphRAG is its inherent scalability in terms of both cost and quality. Across a range of competing methods (standard vector RAG, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/github.com\/profintegra\/raptor-rag\" target=\"_blank\" rel=\"noopener noreferrer\">RAPTOR<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, and GraphRAG <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/microsoft.github.io\/graphrag\/query\/local_search\/\" target=\"_blank\" rel=\"noopener noreferrer\">local<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/microsoft.github.io\/graphrag\/query\/global_search\/\" target=\"_blank\" rel=\"noopener noreferrer\">global<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, and <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/microsoft.github.io\/graphrag\/query\/drift_search\/\" target=\"_blank\" rel=\"noopener noreferrer\">DRIFT<span class=\"sr-only\"> (opens in new tab)<\/span><\/a> search mechanisms), LazyGraphRAG shows strong performance across the cost-quality spectrum as follows:&nbsp;<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>LazyGraphRAG data indexing costs are identical to vector RAG and 0.1% of the costs of full GraphRAG.&nbsp;<\/li>\n\n\n\n<li>For comparable query costs to vector RAG, LazyGraphRAG outperforms all competing methods on local queries, including long-context vector RAG and GraphRAG <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/blog\/introducing-drift-search-combining-global-and-local-search-methods-to-improve-quality-and-efficiency\/\" target=\"_blank\" rel=\"noreferrer noopener\">DRIFT<\/a> search (our recently introduced RAG approach shown to outperform vector RAG) as well as GraphRAG local search.&nbsp;<\/li>\n\n\n\n<li>The same LazyGraphRAG configuration also shows comparable answer quality to GraphRAG Global Search for global queries, but <em>more than 700 times lower query cost<\/em>.<\/li>\n\n\n\n<li>For 4% of the query<em> <\/em>cost of GraphRAG global search, LazyGraphRAG <em>significantly outperforms all competing methods<\/em> on both local and global query types, including GraphRAG global search at the C2 level (the third level of the community hierarchy recommended for most applications).<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"blending-vector-rag-and-graph-rag-with-deferred-llm-use\">Blending vector RAG and Graph RAG with deferred LLM use<\/h2>\n\n\n\n<p>LazyGraphRAG aims to blend the advantages of vector RAG and Graph RAG while overcoming their respective limitations:&nbsp;<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Vector RAG is a form of <em>best-first<\/em> <em>search<\/em> that uses the similarity with the query to select the best-matching source text chunks. However, it has no sense of the breadth of the dataset to consider for global queries.&nbsp;<\/li>\n\n\n\n<li>GraphRAG global search is a form of <em>breadth-first search<\/em> that uses the community structure of source text entities to ensure that queries are answered considering the full breadth of the dataset. However, it has no sense of the best communities to consider for local queries.<\/li>\n<\/ul>\n\n\n\n<p>LazyGraphRAG combines best-first and breadth-first search dynamics in an iterative deepening manner (Table 1). Compared to the global search mechanism of full GraphRAG, this approach is \u201clazy\u201d in ways that defer LLM use and dramatically increase the efficiency of answer generation. Overall performance can be scaled via a single main parameter \u2013 the <em>relevance test budget <\/em>\u2013 that controls the cost-quality trade-off in a consistent manner.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><thead><tr><th><\/th><th>GraphRAG<\/th><th>LazyGraphRAG<\/th><\/tr><\/thead><tbody><tr><td>Build index<\/td><td>Uses an LLM to extract and describe entities and their relationships, b) uses an LLM to summarize all observations of each entity and relationship, c) uses graph statistics to optimize the entity graph and extract hierarchical community structure<\/td><td>Uses NLP noun phrase extraction to extract concepts and their co-occurrences, b) uses graph statistics to optimize the concept graph and extract hierarchical community structure<\/td><\/tr><tr><td>Summarize index<\/td><td>Uses an LLM to summarize entities and relationships in each community<\/td><td>None \u2013 the \u201clazy\u201d approach defers all LLM use until query time<\/td><\/tr><tr><td>Refine query<\/td><td>None \u2013 the original query is used throughout<\/td><td>Uses an LLM to a) identify relevant subqueries and recombine them into a single expanded query, b) refine subqueries with matching concepts from the concept graph<\/td><\/tr><tr><td>Match query<\/td><td>None \u2013 all queries are answered using all community summaries (<em>breadth first<\/em>)&nbsp;<\/td><td>For each of <em>q <\/em>subqueries [3-5]:&nbsp;<br>&#8211; Uses text chunk embeddings and chunk-community relationships to first rank text chunks by similarity to the query, then rank communities by the rank of their top-<em>k<\/em> text chunks (<em>best first<\/em>)&nbsp;<br>&#8211; Uses an LLM-based sentence-level relevance assessor to rate the relevance of the top-<em>k<\/em> untested text chunks from communities in rank order (<em>breadth first<\/em>)&nbsp;<br>&#8211; Recurses into relevant sub-communities after&nbsp;<em>z&nbsp;<\/em>successive communities yield zero relevant text chunks &nbsp;(<em>iterative deepening<\/em>)<br>&#8211; Terminates when no relevant communities remain or&nbsp;<em>relevance test budget<\/em>&nbsp;\/&nbsp;<em>q<\/em>&nbsp;is reached<\/td><\/tr><tr><td>Map answers<\/td><td>Uses an LLM to answer the original query over random batches of community summaries in parallel<\/td><td>For each of <em>q<\/em> subqueries [3-5]:&nbsp;<br>&#8211; Builds a subgraph of concepts from the relevant text chunks&nbsp;<br>&#8211; Uses the community assignments of\u202fconcepts to group related chunks together&nbsp;<br>&#8211; Uses an LLM to\u202fextract\u202fsubquery-relevant claims from groups of related chunks as a way of focusing on relevant content only&nbsp;<br>&#8211; Ranks and filters extracted claims to fit a pre-defined context window size&nbsp;<\/td><\/tr><tr><td>Reduce answers<\/td><td>Uses an LLM to answer the original query using the mapped answers<\/td><td>Uses an LLM to answer the expanded query\u202fusing the extracted map claims<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"lazygraphrag-answer-quality-is-state-of-the-art\">LazyGraphRAG answer quality is state-of-the-art<\/h2>\n\n\n\n<p>We compared LazyGraphRAG at varying levels of relevance test budget to a range of competing methods, as follows:&nbsp;<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Dataset: 5,590 AP news articles (used with license)<\/li>\n\n\n\n<li>Queries: 100 synthetic queries (50 local and 50 global), generated using a new method to be described in a future blog post<\/li>\n\n\n\n<li>Metrics: Comprehensiveness, Diversity, Empowerment (as described <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/from-local-to-global-a-graph-rag-approach-to-query-focused-summarization\/\">here<\/a>, with an LLM used to compare pairs of answers head-to-head on each metric)<\/li>\n\n\n\n<li>Conditions: Includes LazyGraphRAG with three relevance test budget settings, in addition to eight competing conditions from GraphRAG and literature (Table 2).<\/li>\n<\/ul>\n\n\n\n<figure class=\"wp-block-table\"><table><thead><tr><th>Condition<\/th><th>Description<\/th><\/tr><\/thead><tbody><tr><td>Z100_Lite<\/td><td>LazyGraphRAG with a relevance test budget of 100 and using a low-cost LLM model at all steps&nbsp;<\/td><\/tr><tr><td>Z500<\/td><td>LazyGraphRAG with a relevance test budget of 500, using a low-cost LLM for relevance tests and a more advanced (higher cost) LLM for query refinement and map\/reduce answer generation&nbsp;<\/td><\/tr><tr><td>Z1500<\/td><td>LazyGraphRAG with a relevance test budget of 1,500, using a low-cost LLM for relevance tests and a more advanced (higher cost) LLM for query refinement and map\/reduce answer generation&nbsp;<\/td><\/tr><tr><td>C1<\/td><td>GraphRAG Global Search at community level 1&nbsp;<\/td><\/tr><tr><td>C2<\/td><td>GraphRAG Global Search at community level 2<\/td><\/tr><tr><td>C3_Dynamic<\/td><td>GraphRAG Global Search at community level 3 using dynamic community selection (a cost saving solution introduced in our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/blog\/graphrag-improving-global-search-via-dynamic-community-selection\/\" target=\"_blank\" rel=\"noreferrer noopener\">previous blog post<\/a>)<\/td><\/tr><tr><td>LS<\/td><td>GraphRAG Local Search<\/td><\/tr><tr><td>DRIFT<\/td><td>GraphRAG DRIFT Search<\/td><\/tr><tr><td>SS_8K<\/td><td>Semantic Search with vector RAG retrieving 8k tokens of input&nbsp;<\/td><\/tr><tr><td>SS_64K<\/td><td>Semantic Search with vector RAG retrieving 64k tokens of input (included to examine the effect of long-context window on vector RAG)&nbsp;<\/td><\/tr><tr><td>RAPTOR<\/td><td>A hierarchical clustering-based approach to RAG that shares some similar features to LazyGraphRAG&nbsp;<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>Figure 1 shows LazyGraphRAG win rates against each of the eight competing conditions. At the lowest budget level of 100 relevance tests using a low-cost LLM model&nbsp;(same cost as SS_8K), LazyGraphRAG significantly outperforms all conditions on local and global queries, except for GraphRAG global search conditions for global queries. At an increased budget of 500 relevance tests using a more advanced LLM model (4% of the query cost of C2), LazyGraphRAG significantly outperforms all conditions on both local and global queries. LazyGraphRAG\u2019s win rates continue to increase as the relevance test budget increases to 1,500, demonstrating its scalability in terms of cost vs. quality.&nbsp;<\/p>\n\n\n\n<figure class=\"wp-block-image aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"1400\" height=\"2100\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1.png\" alt=\"Figure 1. Clustered bar charts showing win rates of LazyGraphRAG with relevance test budgets of (100, 500, 1,500) over competing conditions for each combination of (local, global) queries and (comprehensiveness, diversity, empowerment) metrics.\" class=\"wp-image-1106040\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1.png 1400w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-200x300.png 200w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-683x1024.png 683w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-768x1152.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-1024x1536.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-1365x2048.png 1365w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-blog_fig1-120x180.png 120w\" sizes=\"auto, (max-width: 1400px) 100vw, 1400px\" \/><figcaption class=\"wp-element-caption\">Figure 1. Clustered bar charts showing win rates of LazyGraphRAG with relevance test budgets of (100, 500, 1,500) over competing conditions for each combination of (local, global) queries and (comprehensiveness, diversity, empowerment) metrics<\/figcaption><\/figure>\n\n\n\n<p>An example comparison is shown in Table 3.<\/p>\n\n\n\n<p><em>Query: Describe what factors individuals in the United States should consider when selecting a health insurance plan during the open enrollment period for 2024 health insurance plans.<\/em><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><thead><tr><th>Vector RAG (64K context)<\/th><th>LazyGraphRAG<\/th><\/tr><\/thead><tbody><tr><td># Factors to Consider When Selecting a Health Insurance Plan During Open Enrollment for 2024&nbsp;<br>&nbsp;<br>Selecting a health insurance plan during the open enrollment period can be a complex process, but understanding the key factors to consider can help individuals make informed decisions. Here are some important aspects to keep in mind:&nbsp;<br>&nbsp;<br>## Coverage and Networks&nbsp;<br>&nbsp;<br>One of the primary considerations is the coverage network of the plan. Insurers form coverage networks of hospitals and doctors, and it is crucial to ensure that your preferred healthcare providers are included in the network of the plan you are considering. Many marketplace plans, such as Health Maintenance Organizations (HMOs) and Exclusive Provider Organizations (EPOs), do not cover claims for most non-emergency care outside their networks [Data: Sources (47419, 47421, 47420, 47410, 47408)].&nbsp;<br>&nbsp;<br>## Costs: Premiums, Deductibles, and Out-of-Pocket Maximums&nbsp;<br>&nbsp;<br>Understanding the costs associated with a health insurance plan is essential. This includes the monthly premiums, deductibles, copays, and coinsurance. Plans are typically categorized into different levels such as platinum, gold, silver, and bronze, with bronze plans generally having lower premiums but higher out-of-pocket costs [Data: Sources (47411, 47412, 47416, 47414, 47418)]. Additionally, it is important to consider the out-of-pocket maximum, which is the most you will have to pay in a year for covered services before the insurance starts covering all costs [Data: Sources (47416, 47415)].&nbsp;<br>&nbsp;<br>## Tax Credits and Cost-Sharing Reductions&nbsp;<br>&nbsp;<br>Individuals with lower incomes may qualify for income-based tax credits to help reduce the cost of premiums. It is important to accurately estimate your income for the coming year when applying for these credits to avoid having to repay any excess credits received [Data: Sources (47412, 47413)]. Additionally, those with incomes below 250% of the federal poverty level may qualify for cost-sharing reductions if they select a silver plan, which can lower deductibles and out-of-pocket maximums [Data: Sources (47417, 47418)].&nbsp;<br>&nbsp;<br>## Special Considerations for Medicaid and Medicare&nbsp;<br>&nbsp;<br>For those transitioning from Medicaid, it is important to understand that marketplace plans may come with higher premiums and copays compared to Medicaid. Additionally, many people who have been removed from Medicaid may be eligible to enroll in marketplace plans through an extended enrollment period [Data: Sources (6284, 6285, 6286, 6287)]. For seniors, the Medicare open enrollment period allows for switching between traditional Medicare and Medicare Advantage plans, with considerations for prescription drug coverage and additional benefits like dental and vision [Data: Sources (72060, 72061, 72062, 72063, 72064)].&nbsp;<br>&nbsp;<br>## Assistance and Resources&nbsp;<br>&nbsp;<br>Navigating the complexities of health insurance can be challenging, and seeking assistance from insurance agents or government-funded navigators can be beneficial. These professionals can help individuals understand their options and make informed decisions without recommending specific plans [Data: Sources (47424, 47425, 47426)].&nbsp;<br>&nbsp;<br>## Conclusion&nbsp;<br>&nbsp;<br>Selecting the right health insurance plan requires careful consideration of various factors including coverage networks, costs, eligibility for tax credits and cost-sharing reductions, and available assistance. By thoroughly evaluating these aspects, individuals can choose a plan that best meets their healthcare needs and financial situation for the upcoming year.<\/td><td>### Types of Health Insurance Plans&nbsp;<br>&nbsp;<br>When selecting a health insurance plan during the open enrollment period for 2024, individuals in the United States have several options to consider:&nbsp;<br>&nbsp;<br>1. **Marketplace Plans**: These are available under the Affordable Care Act (ACA) and are categorized into platinum, gold, silver, and bronze levels. Bronze plans generally have lower premiums but higher out-of-pocket costs, while platinum plans have higher premiums but lower out-of-pocket costs [Data: Sources (47411, 47420, 47421)].&nbsp;<br>&nbsp;<br>2. **Low-Cost Marketplace Plans**: These often come with high deductibles, requiring patients to pay thousands of dollars before most coverage kicks in. They also have annual out-of-pocket maximums that can exceed $9,000 for individuals and $18,000 for families [Data: Sources (47415, 47416, 47414)].&nbsp;<br>&nbsp;<br>3. **Exclusive Provider Organizations (EPOs) and Health Maintenance Organizations (HMOs)**: EPOs and HMOs generally restrict patients to a network of doctors and require a primary care doctor to direct care. They tend to be cheaper but lack out-of-network flexibility [Data: Sources (47420, 47421, 43218, 43217)].&nbsp;<br>&nbsp;<br>4. **Preferred Provider Organizations (PPOs)**: These plans allow for out-of-network services but at a higher cost. They offer more flexibility compared to HMOs and EPOs [Data: Sources (43217)].&nbsp;<br>&nbsp;<br>5. **High-Deductible Health Plans (HDHPs)**: Defined as plans with a deductible of at least $1,600 for individual coverage or $3,200 for family coverage, with out-of-pocket maximums of no more than $8,050 or $16,100, respectively. HDHPs usually have lower premiums, and sometimes companies contribute to a health savings account (HSA) to help cover the deductible [Data: Sources (43227, 43226)].&nbsp;<br>&nbsp;<br>6. **Medicare Advantage**: These are privately run versions of the federal government&#8217;s Medicare program, mostly for people aged 65 and over. They often include prescription drug coverage and may offer additional benefits like dental or vision coverage not provided by traditional Medicare [Data: Sources (72063, 72061, 72060, 72062)].&nbsp;<br>&nbsp;<br>7. **Short-Term Health Insurance Plans**: These plans are limited to three months and can only be renewed for a maximum of four months under new rules. They are intended for temporary coverage but often lack comprehensive benefits [Data: Sources (97999, 97995, 97996, 97997)].&nbsp;<br>&nbsp;<br>### Cost Factors: Premiums, Deductibles, Co-pays, and Out-of-Pocket Maximums&nbsp;<br>&nbsp;<br>The overall cost of health insurance plans in 2024 is influenced by several factors:&nbsp;<br>&nbsp;<br>&#8211; **Premiums**: This is the set monthly cost you pay for your health insurance plan. Premiums have been rising, with a notable increase of 7% for both family and single plans in 2023, partly due to inflation [Data: Sources (83383, 83382, 83384, 83385, 83381, +more)].&nbsp;<br>&nbsp;<br>&#8211; **Deductibles**: The amount you pay out-of-pocket for health care services before your insurance starts to pay. For HDHPs, the deductible is at least $1,600 for individual coverage or $3,200 for family coverage [Data: Sources (43226, 43225)].&nbsp;<br>&nbsp;<br>&#8211; **Co-pays and Co-insurance**: These are the costs you pay each time you receive a medical service. Co-pays are fixed amounts, while co-insurance is a percentage of the service cost.&nbsp;<br>&nbsp;<br>&#8211; **Out-of-Pocket Maximums**: This is the maximum amount you will pay for covered services in a year. For example, HDHPs have out-of-pocket maximums of no more than $8,050 for individual coverage or $16,100 for family coverage [Data: Sources (43227, 43226)].&nbsp;<br>&nbsp;<br>### Provider Networks: In-Network vs. Out-of-Network&nbsp;<br>&nbsp;<br>The network of healthcare providers is a crucial factor in selecting a health insurance plan:&nbsp;<br>&nbsp;<br>&#8211; **In-Network Providers**: These are doctors and hospitals that have agreements with your insurance plan to provide services at lower rates. Ensuring your preferred doctors and specialists are in-network can save you significant costs [Data: Sources (43216, 47419)].&nbsp;<br>&nbsp;<br>&#8211; **Out-of-Network Providers**: Services from these providers are usually more expensive and may not be covered at all, except in emergencies. PPO plans offer some out-of-network coverage but at a higher cost, while HMOs and EPOs generally do not cover non-emergency out-of-network care [Data: Sources (43217, 47421)].&nbsp;<br>&nbsp;<br>### Specific Medical Needs and Services&nbsp;<br>&nbsp;<br>When selecting a health insurance plan, individuals should consider their specific medical needs:&nbsp;<br>&nbsp;<br>&#8211; **Prescription Drugs**: Ensure that your medications are covered by the plan&#8217;s formulary, as drug coverage can change annually [Data: Sources (43220, 43218, 43219)].&nbsp;<br>&nbsp;<br>&#8211; **Mental Health Services**: Coverage for mental health treatments is essential, especially with new rules pushing insurers to increase their coverage of these services [Data: Sources (97031, 97028, 97027, 97030, 97033, +more)].&nbsp;<br>&nbsp;<br>&#8211; **Chronic Conditions**: Plans should cover ongoing treatments and medications for chronic conditions. Medicare Supplement Insurance (Medigap) can help cover gaps in Medicare for chronic disease management [Data: Sources (93367, 93368)].&nbsp;<br>&nbsp;<br>&#8211; **Preventive Care**: Coverage for preventive services like cancer screenings and HIV prevention is mandated under the ACA, though its future is uncertain due to ongoing legal battles [Data: Sources (71106, 71109, 71098, 71099, 71100, +more)].&nbsp;<br>&nbsp;<br>### Key Dates and Steps for Open Enrollment&nbsp;<br>&nbsp;<br>The open enrollment period for 2024 health insurance plans involves several key dates and steps:&nbsp;<br>&nbsp;<br>&#8211; **Marketplace Plans**: Open enrollment starts on November 1, 2023, and runs through mid-December in most states, ending on January 16, 2024 [Data: Sources (47419, 47411, 47416, 47421, 47409, +more)].&nbsp;<br>&nbsp;<br>&#8211; **Medicare**: Open enrollment for Medicare runs from October 15, 2023, to December 7, 2023. During this period, individuals can choose between traditional Medicare, Medicare Advantage plans, and prescription drug plans [Data: Sources (72061, 72063, 72060, 72062)].&nbsp;<br>&nbsp;<br>&#8211; **Special Enrollment Periods**: Individuals who lose coverage due to life events like job loss or moving may qualify for special enrollment periods. For example, those removed from Medicaid may enroll in marketplace plans through July 2024 [Data: Sources (6288, 6289)].&nbsp;<br>&nbsp;<br>By considering these factors, individuals can make informed decisions about their health insurance coverage for 2024, ensuring they select plans that best meet their medical needs and financial situations.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"looking-forward\">Looking forward<\/h2>\n\n\n\n<p>LazyGraphRAG shows that it is possible for a single, flexible query mechanism to substantially outperform a diverse range of specialized query mechanisms across the local-global query spectrum, and to do so without the up-front costs of LLM data summarization. Its very fast and almost-free indexing make LazyGraphRAG ideal for one-off queries, exploratory analysis, and streaming data use cases, while its ability to smoothly increase answer quality with increasing relevance test budget makes it a valuable tool for benchmarking RAG approaches in general (e.g., \u201cRAG approach X beats LazyGraphRAG with budget Y for task Z\u201d).&nbsp;<\/p>\n\n\n\n<p>Does this mean that all graph-enabled RAG should be lazy? We believe the answer is no, for three reasons:&nbsp;<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>A GraphRAG data index of entity, relationship, and community summaries has use value beyond question answering (e.g., reading and sharing as reports).&nbsp;<\/li>\n\n\n\n<li>A GraphRAG data index of entity, relationship, and community summaries, combined with a LazyGraphRAG-like search mechanism, is likely to achieve better results than LazyGraphRAG alone.&nbsp;<\/li>\n\n\n\n<li>A new kind of GraphRAG data index designed to support a LazyGraphRAG-like search mechanism (e.g., through pre-emptive claim and topic extraction) is likely to achieve the best possible results.&nbsp;<\/li>\n<\/ol>\n\n\n\n<p>We will be exploring these directions in the coming period. Stay tuned!&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Introducing a new approach to graph-enabled RAG. LazyGraphRAG needs no prior summarization of source data, avoiding prohibitive up-front indexing costs. It\u2019s inherently scalable in cost and quality across multiple methods and search mechanisms.<\/p>\n","protected":false},"author":38004,"featured_media":1106046,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":[{"type":"user_nicename","value":"Darren Edge","user_id":"31509"},{"type":"user_nicename","value":"Ha Trinh","user_id":"43245"},{"type":"user_nicename","value":"Jonathan Larson","user_id":"32385"}],"msr_hide_image_in_river":null,"footnotes":""},"categories":[1],"tags":[],"research-area":[13556],"msr-region":[],"msr-event-type":[],"msr-locale":[268875],"msr-post-option":[269148,243984,269142],"msr-impact-theme":[],"msr-promo-type":[],"msr-podcast-series":[],"class_list":["post-1106013","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-research-blog","msr-research-area-artificial-intelligence","msr-locale-en_us","msr-post-option-approved-for-river","msr-post-option-blog-homepage-featured","msr-post-option-include-in-river"],"msr_event_details":{"start":"","end":"","location":""},"podcast_url":"","podcast_episode":"","msr_research_lab":[],"msr_impact_theme":[],"related-publications":[],"related-downloads":[],"related-videos":[],"related-academic-programs":[],"related-groups":[],"related-projects":[1027041],"related-events":[],"related-researchers":[{"type":"user_nicename","value":"Darren Edge","user_id":31509,"display_name":"Darren Edge","author_link":"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/daedge\/\" aria-label=\"Visit the profile page for Darren Edge\">Darren Edge<\/a>","is_active":false,"last_first":"Edge, Darren","people_section":0,"alias":"daedge"},{"type":"user_nicename","value":"Ha Trinh","user_id":43245,"display_name":"Ha Trinh","author_link":"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/trinhha\/\" aria-label=\"Visit the profile page for Ha Trinh\">Ha Trinh<\/a>","is_active":false,"last_first":"Trinh, Ha","people_section":0,"alias":"trinhha"},{"type":"user_nicename","value":"Jonathan Larson","user_id":32385,"display_name":"Jonathan Larson","author_link":"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jolarso\/\" aria-label=\"Visit the profile page for Jonathan Larson\">Jonathan Larson<\/a>","is_active":false,"last_first":"Larson, Jonathan","people_section":0,"alias":"jolarso"}],"msr_type":"Post","featured_image_thumbnail":"<img width=\"960\" height=\"540\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-960x540.png\" class=\"img-object-cover\" alt=\"LazyGraphRAG blog hero\" decoding=\"async\" loading=\"lazy\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-960x540.png 960w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-300x169.png 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1024x576.png 1024w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-768x432.png 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1066x600.png 1066w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-655x368.png 655w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-240x135.png 240w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-640x360.png 640w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1-1280x720.png 1280w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2024\/11\/LazyGraphRAG-BlogHeroFeature-1400x788-1.png 1400w\" sizes=\"auto, (max-width: 960px) 100vw, 960px\" \/>","byline":"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/daedge\/\" title=\"Go to researcher profile for Darren Edge\" aria-label=\"Go to researcher profile for Darren Edge\" data-bi-type=\"byline author\" data-bi-cN=\"Darren Edge\">Darren Edge<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/trinhha\/\" title=\"Go to researcher profile for Ha Trinh\" aria-label=\"Go to researcher profile for Ha Trinh\" data-bi-type=\"byline author\" data-bi-cN=\"Ha Trinh\">Ha Trinh<\/a>, and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/jolarso\/\" title=\"Go to researcher profile for Jonathan Larson\" aria-label=\"Go to researcher profile for Jonathan Larson\" data-bi-type=\"byline author\" data-bi-cN=\"Jonathan Larson\">Jonathan Larson<\/a>","formattedDate":"November 25, 2024","formattedExcerpt":"Introducing a new approach to graph-enabled RAG. LazyGraphRAG needs no prior summarization of source data, avoiding prohibitive up-front indexing costs. It\u2019s inherently scalable in cost and quality across multiple methods and search mechanisms.","locale":{"slug":"en_us","name":"English","native":"","english":"English"},"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/1106013","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/users\/38004"}],"replies":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/comments?post=1106013"}],"version-history":[{"count":29,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/1106013\/revisions"}],"predecessor-version":[{"id":1141546,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/posts\/1106013\/revisions\/1141546"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/1106046"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=1106013"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/categories?post=1106013"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/tags?post=1106013"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=1106013"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=1106013"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=1106013"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=1106013"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=1106013"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=1106013"},{"taxonomy":"msr-promo-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-promo-type?post=1106013"},{"taxonomy":"msr-podcast-series","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-podcast-series?post=1106013"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}