<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[小白的编程学习之旅]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CL_passion</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CL_passion]]></copyright><item><title><![CDATA[【AutoDL四周年活动】聊聊和AutoDL的故事]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/151768033</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/151768033</guid><author>CL_passion</author><pubDate>Wed, 17 Sep 2025 00:37:51 +0800</pubDate><description><![CDATA[【AutoDL四周年活动】推荐科研利器——AutoDL远程开发]]></description><category></category></item><item><title><![CDATA[K 折交叉验证详细介绍]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/151360177</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/151360177</guid><author>CL_passion</author><pubDate>Tue, 09 Sep 2025 14:17:37 +0800</pubDate><description><![CDATA[K折交叉验证介绍]]></description><category></category></item><item><title><![CDATA[稠密矩阵和稀疏矩阵的对比]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/151184327</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/151184327</guid><author>CL_passion</author><pubDate>Thu, 04 Sep 2025 14:00:06 +0800</pubDate><description><![CDATA[稠密矩阵和稀疏矩阵的对比]]></description><category></category></item><item><title><![CDATA[离散特征和连续特征不同的处理方式]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/151151398</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/151151398</guid><author>CL_passion</author><pubDate>Wed, 03 Sep 2025 16:00:52 +0800</pubDate><description><![CDATA[离散特征和连续特征不同的处理方式]]></description><category></category></item><item><title><![CDATA[【报错】RuntimeError: Function ‘MmBackward0‘ returned nan values in its 0th output.]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/150505498</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/150505498</guid><author>CL_passion</author><pubDate>Tue, 19 Aug 2025 11:32:37 +0800</pubDate><description><![CDATA[【报错】RuntimeError: Function ‘MmBackward0‘ returned nan values in its 0th output.]]></description><category></category></item><item><title><![CDATA[【报错】RuntimeError: Trying to backward through the graph a second time (or directly access saved tenso]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/150491320</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/150491320</guid><author>CL_passion</author><pubDate>Mon, 18 Aug 2025 14:50:52 +0800</pubDate><description><![CDATA[【报错】RuntimeError: Trying to backward through the graph a second time (or directly access saved tenso]]></description><category></category></item><item><title><![CDATA[pycharm远程连接服务器跑实验详细操作]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/149985584</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/149985584</guid><author>CL_passion</author><pubDate>Thu, 14 Aug 2025 22:21:29 +0800</pubDate><description><![CDATA[pycharm远程连接AutoDL服务器跑实验详细操作]]></description><category></category></item><item><title><![CDATA[【报错】Assertion `srcIndex ＜ srcSelectDimSize` failed.RuntimeError: CUDA error: device-side assert trig]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/149839294</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/149839294</guid><author>CL_passion</author><pubDate>Sat, 02 Aug 2025 08:15:26 +0800</pubDate><description><![CDATA[python报错：embedding索引超出范围]]></description><category></category></item><item><title><![CDATA[函数参数的解包与顺序匹配机制]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/149663173</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/149663173</guid><author>CL_passion</author><pubDate>Sat, 26 Jul 2025 11:15:37 +0800</pubDate><description><![CDATA[函数参数的解包与顺序匹配机制：1.使用 * 顺序传参 2.使用 ** 按名称传参]]></description><category></category></item><item><title><![CDATA[跑实验训练太慢了]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/149659214</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/149659214</guid><author>CL_passion</author><pubDate>Sat, 26 Jul 2025 08:23:49 +0800</pubDate><description><![CDATA[训练模型太慢，GPT给的解决办法]]></description><category></category></item><item><title><![CDATA[pycharm一打开就闪退]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/149397704</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/149397704</guid><author>CL_passion</author><pubDate>Wed, 16 Jul 2025 14:46:09 +0800</pubDate><description><![CDATA[pycharm闪退电脑内存不足]]></description><category></category></item><item><title><![CDATA[Python数据分析小知识]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/128322013</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/128322013</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:31:34 +0800</pubDate><description><![CDATA[数据分析是指用适当的分析方法对收集来的大量数据进行分析，提取有用信息和形成结论，对数据加以详细研究和概括总结的过程。]]></description><category></category></item><item><title><![CDATA[数据结构C语言版部分代码]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/129880570</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/129880570</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:24:48 +0800</pubDate><description><![CDATA[例如，表示某单链表L的头节点的指针域用“ L->next ”，但是顺序栈的栈顶指针用“ S.top ”指针变量操作某成员用“ -> ”而不是“ . ”链栈 LinkStack（StackNode）链队列 LinkQueue（QNode）单链表 LinkList（LNode）循环队列（顺序存储） SqQueue。顺序栈 SqStack。顺序表 SqList。]]></description><category></category></item><item><title><![CDATA[Python之类class&异常处理]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/128165499</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/128165499</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:23:27 +0800</pubDate><description><![CDATA[在 Python 中，可以自定义特殊类型的异常，但前提是确保从 Exception 类继承（不管是直接继承还是间接继承）。pass。]]></description><category></category></item><item><title><![CDATA[Python之面向对象编程]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/128173767</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/128173767</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:18:42 +0800</pubDate><description><![CDATA[面向对象程序设计（Object Oriented Programming，OOP）是一种计算机编程架构。OOP的一条基本原则是计算机程序由单个能够起到子程序作用的单元或对象组合而成。重用性、灵活性和扩展性。OOP = 对象 + 类 + 继承 + 多态 + 消息，其中核心概念是类和对象。面向对象程序设计方法是尽可能模拟人类的思维方式，以对象为核心，认为程序由一系列对象组成。]]></description><category></category></item><item><title><![CDATA[《数据结构C语言版》学习笔记]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/129285017</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/129285017</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:16:40 +0800</pubDate><description><![CDATA[介绍C的几个有用的库函数/算符（需要加载头文件<stdlib.h>）代码介绍sizeof(x)计算变量 x 的长度(字节数)malloc(m)开辟 m 字节长度的地址空间，并返回这段空间的首地址函数的意思是:新开一片大小为 newsize 的连续空间，并把以*p为首址的原空间数据都拷贝进去free ( p )释放指针 p 所指变量的存储空间，即彻底删除一个变量大量的malloc和free会把内存分成很多碎块，不建议无限制的使用普通变量用 . 来引用成员，例如L.elem。]]></description><category></category></item><item><title><![CDATA[C语言基础知识]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/128725792</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/128725792</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:14:07 +0800</pubDate><description><![CDATA[/ #define 定义的标识符常量:10//max是常量int main()return 0;运行结果：10int add(int x, int y) //add是函数名，括号里面是函数的参数，int是函数的返回类型{ //大括号里面是函数体return z;//返回的z是整型intint main()return 0;运行结果：sum = 30sum = 300//自定义函数（比较两数大小）if (x > y)return x;else。]]></description><category></category></item><item><title><![CDATA[决策树理论介绍]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/133579794</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/133579794</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:11:30 +0800</pubDate><description><![CDATA[决策树（Decision tree）是一类常见的机器学习方法，是一个自上而下、分而治之的过程。决策树是基于树结构来进行决策，它的每一个叶子节点都对应着分类结果，非叶子节点则对应着某个属性上的测试。决策树的根节点包含样本的所有数据集，每个节点包含的样本集合会根据属性测试的结果被划分到子节点中。生成决策树的过程，显然是一个递归的过程，而生成决策树的关键在于每一步如何选择最优的属性对样本数据进行划分。一般而言，随着决策树划分过程的推进，最理想的情况是各分支节点所包含的样本都尽可能属于同一类别，也就是各节点的纯度（]]></description><category></category></item><item><title><![CDATA[【深度学习】从零开始下载安装&环境配置]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/133719175</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/133719175</guid><author>CL_passion</author><pubDate>Tue, 10 Jun 2025 15:07:08 +0800</pubDate><description><![CDATA[（1）找到c盘中.condarc文件，用记事本打开，在里面添加语句（不知道为啥我右键打开方式没有记事本，然后我在应用>安装的应用>记事本，找到记事本中重置>修复，点击修复了一下就好了）更奇怪的是添加完之后右下角显示出来多了python39解释器，然后过了一会又没有了？点击免费下载，输入一个邮箱之后会发送一封邮件，点击邮件链接即可进入下载网址（也可以不注册直接跳过skip），然后下载对应版本，并安装（选择all users，后面都勾选上）。发现问题：我直接新建python39环境给我安装到C盘去了？]]></description><category></category></item><item><title><![CDATA[解决Linux上网问题]]></title><link>https://blog.youkuaiyun.com/CL_passion/article/details/143690297</link><guid>https://blog.youkuaiyun.com/CL_passion/article/details/143690297</guid><author>CL_passion</author><pubDate>Mon, 11 Nov 2024 19:49:36 +0800</pubDate><description><![CDATA[Linux上网问题]]></description><category></category></item></channel></rss>