<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[c_cpp_csharp的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/c_cpp_csharp</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; c_cpp_csharp]]></copyright><item><title><![CDATA[Component and Dimension Sparsity in Transformer Refusal Mechanisms 论文总结]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168641211</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168641211</guid><author>c_cpp_csharp</author><pubDate>Wed, 28 Oct 2026 12:00:00 +0800</pubDate><description><![CDATA[# Component and Dimension Sparsity in Transformer Refusal Mechanisms 论文总结
> 论文信息：arXiv:2610.06903，接收于COLM 2026，作者：Vincen]]></description><category></category></item><item><title><![CDATA[CodeGraph: Open‑Taxonomy Knowledge Graph for Source Code with Wikidata Grounding]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168641368</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168641368</guid><author>c_cpp_csharp</author><pubDate>Wed, 28 Oct 2026 09:00:00 +0800</pubDate><description><![CDATA[# CodeGraph: Open‑Taxonomy Knowledge Graph for Source Code with Wikidata Grounding
> 论文arXiv链接：[https://arxiv.org/abs/26]]></description><category></category></item><item><title><![CDATA[LogicTrack: Auditing Reasoning Trajectories of Large Language Models with Formal Logic Solvers 论文总结与]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168643755</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168643755</guid><author>c_cpp_csharp</author><pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate><description><![CDATA[# LogicTrack: Auditing Reasoning Trajectories of Large Language Models with Formal Logic Solvers 论文总结与翻译
> 论文arXiv链接：htt]]></description><category></category></item><item><title><![CDATA[Accelerating Dense LLMs via L0‑regularized Mixture‑of‑Experts 论文总结与翻译]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168643895</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168643895</guid><author>c_cpp_csharp</author><pubDate>Wed, 28 Oct 2026 07:00:00 +0800</pubDate><description><![CDATA[# Accelerating Dense LLMs via L0‑regularized Mixture‑of‑Experts 论文总结与翻译
> 论文arXiv链接：https://arxiv.org/abs/2609.21672

##]]></description><category></category></item><item><title><![CDATA[Abstention and Noise Filtering: Two Missing Primitives of Softmax Attention 论文阅读总结]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168643792</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168643792</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 13:00:00 +0800</pubDate><description><![CDATA[# Abstention and Noise Filtering: Two Missing Primitives of Softmax Attention 论文阅读总结
> 论文arXiv链接：[https://arxiv.org/abs/]]></description><category></category></item><item><title><![CDATA[Block‑Sparse Attention with Semantic‑Geometric Decoupled Routing（arXiv:2609.22884）论文总结与翻译]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168643846</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168643846</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 12:00:00 +0800</pubDate><description><![CDATA[# Block‑Sparse Attention with Semantic‑Geometric Decoupled Routing（arXiv:2609.22884）论文总结与翻译
> 论文链接：[https://arxiv.org/ab]]></description><category></category></item><item><title><![CDATA[GVPO++: Group Variance Policy Optimization for LLM Post‑Training and On‑Policy Distillation]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168643973</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168643973</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 10:00:00 +0800</pubDate><description><![CDATA[# GVPO++: Group Variance Policy Optimization for LLM Post‑Training and On‑Policy Distillation
> 论文链接：https://arxiv.org/a]]></description><category></category></item><item><title><![CDATA[RBS‑Attention 论文阅读总结]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644008</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644008</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 09:00:00 +0800</pubDate><description><![CDATA[# RBS‑Attention 论文阅读总结
> 论文信息：arXiv:2609.20971，RBS‑Attention: Radius‑Bounded Sparse Prefill for Long‑Context Large Langu]]></description><category></category></item><item><title><![CDATA[Random Attention: Rethinking KV Cache Eviction for Efficient Reasoning（arXiv:2609.03430）]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644109</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644109</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate><description><![CDATA[# Random Attention: Rethinking KV Cache Eviction for Efficient Reasoning（arXiv:2609.03430）
## 一、文章主要内容总结
### 研究背景
大模型在长链]]></description><category></category></item><item><title><![CDATA[SWE‑Gate 论文阅读总结]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644136</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644136</guid><author>c_cpp_csharp</author><pubDate>Tue, 27 Oct 2026 07:00:00 +0800</pubDate><description><![CDATA[# SWE‑Gate 论文阅读总结
> 论文信息：arXiv:2609.04167，SWE‑Gate: Passing Functional Tests Is Not Enough for Software Engineering Agen]]></description><category></category></item><item><title><![CDATA[What Matters for Aggressive Decoding‑Time KV Eviction? Temporal Aggregation and Ranking Preservation]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644042</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644042</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 15:00:00 +0800</pubDate><description><![CDATA[# What Matters for Aggressive Decoding‑Time KV Eviction? Temporal Aggregation and Ranking Preservation
> arXiv:2609.0351]]></description><category></category></item><item><title><![CDATA[GrowPage: On‑Demand KV Budgeting for Efficient LLM Reasoning Serving（arXiv:2609.03494）]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644078</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644078</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 14:00:00 +0800</pubDate><description><![CDATA[# GrowPage: On‑Demand KV Budgeting for Efficient LLM Reasoning Serving（arXiv:2609.03494）
> 论文链接：[https://arxiv.org/abs/2]]></description><category></category></item><item><title><![CDATA[Large Language Models in Resolving Contextual Knowledge Conflicts（arXiv:2609.03148）]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644162</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644162</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 13:00:00 +0800</pubDate><description><![CDATA[# Large Language Models in Resolving Contextual Knowledge Conflicts（arXiv:2609.03148）
> 会议：EMNLP 2026
> 论文链接：https://arx]]></description><category></category></item><item><title><![CDATA[RuleMem: Active Rule Memory for Long‑Term Conversational Agents 论文总结与翻译]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644192</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644192</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 12:00:00 +0800</pubDate><description><![CDATA[# RuleMem: Active Rule Memory for Long‑Term Conversational Agents 论文总结与翻译
> 论文arXiv链接：https://arxiv.org/abs/2609.03915

]]></description><category></category></item><item><title><![CDATA[Representational alignment yields generalizable safety in language models]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644279</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644279</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 11:00:00 +0800</pubDate><description><![CDATA[> 说明：arXiv网页摘要接口仅公开**Abstract**，**Introduction、Conclusion**正文内容不在返回的元数据中，无法直接获取原文，因此仅完成摘要原文+翻译；文章主要内容、创新点基于摘要信息整理。

# Re]]></description><category></category></item><item><title><![CDATA[It‘s the Problem, Not the Path: Budget and Difficulty Confounds in LLM Reasoning Trajectories]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644313</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644313</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 10:00:00 +0800</pubDate><description><![CDATA[# It's the Problem, Not the Path: Budget and Difficulty Confounds in LLM Reasoning Trajectories
> 论文arXiv地址：https://arxi]]></description><category></category></item><item><title><![CDATA[论文总结：Doesn‘t Stop Reasoning: Analysis of Spurious CoT Termination]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644491</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644491</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 09:00:00 +0800</pubDate><description><![CDATA[# 论文总结：Doesn't Stop Reasoning: Analysis of Spurious CoT Termination
> 论文arXiv：https://arxiv.org/abs/2609.03633
> 会议：EMNL]]></description><category></category></item><item><title><![CDATA[GeoEdit: Geometric Knowledge Editing for Large Language Models]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168539988</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168539988</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 08:00:00 +0800</pubDate><description><![CDATA[### 摘要

定期更新对于保持大语言模型（LLMs）中的知识时效性至关重要。因此，人们开发了各种模型编辑方法来更新 LLMs 中的特定知识。然而，基于训练的方法往往难以在有效融入新知识的同时保留不相关的通用知识。为应对这一挑战，我们提出了]]></description><category></category></item><item><title><![CDATA[Survey of Large Multimodal Reasoning Models (LMRMs): From Modular to Native (arXiv:2505.04921)]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168460583</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168460583</guid><author>c_cpp_csharp</author><pubDate>Mon, 26 Oct 2026 07:00:00 +0800</pubDate><description><![CDATA[### 文章总结  
本文是哈尔滨工业大学（深圳）团队发表的关于大型多模态推理模型（LMRMs）的综述论文，系统梳理了多模态推理模型的发展脉络、技术挑战及未来方向。核心内容如下：


#### **主要内容**  
1. **多模态推理模型]]></description><category></category></item><item><title><![CDATA[MemoryLACE论文总结与翻译]]></title><link>https://blog.csdn.net/c_cpp_csharp/article/details/168644242</link><guid>https://blog.csdn.net/c_cpp_csharp/article/details/168644242</guid><author>c_cpp_csharp</author><pubDate>Sun, 25 Oct 2026 16:00:00 +0800</pubDate><description><![CDATA[# MemoryLACE论文总结与翻译
> 论文信息：arXiv:2609.03201，MemoryLACE: Memory Lifecycle‑Aware Consolidation and Evidence Retrieval

## ]]></description><category></category></item></channel></rss>