PageSourceSearch

https://toomanydigits.online/Block1/Sem3/intro.html

html toomanydigits.online collected 2026-10-06 07:12:10 UTC 40,847 bytes, 693 lines download raw bytes

1
2<!DOCTYPE html>
3
4
5<html lang="ru" data-content_root="../../" >
6
7  <head>
8    <meta charset="utf-8" />
9    <meta name="viewport" content="width=device-width, initial-scale=1.0" /><meta name="viewport" content="width=device-width, initial-scale=1" />
10
11    <title>1.3 Линейная регрессия. PCA &#8212; Вычислительная математика</title>
12  
13  
14  
15  
15<script data-cfasync="false">
16    document.documentElement.dataset.mode = localStorage.getItem("mode") || "";
17    document.documentElement.dataset.theme = localStorage.getItem("theme") || "light";
18  </script>
18
19  
20  <!-- Loaded before other Sphinx assets -->
21  <link href="../../_static/styles/theme.css?digest=8d27b9dea8ad943066ae" rel="stylesheet" />
22<link href="../../_static/styles/bootstrap.css?digest=8d27b9dea8ad943066ae" rel="stylesheet" />
23<link href="../../_static/styles/pydata-sphinx-theme.css?digest=8d27b9dea8ad943066ae" rel="stylesheet" />
24
25  
26  <link href="../../_static/vendor/fontawesome/6.5.1/css/all.min.css?digest=8d27b9dea8ad943066ae" rel="stylesheet" />
27  <link rel="preload" as="font" type="font/woff2" crossorigin href="../../_static/vendor/fontawesome/6.5.1/webfonts/fa-solid-900.woff2" />
28<link rel="preload" as="font" type="font/woff2" crossorigin href="../../_static/vendor/fontawesome/6.5.1/webfonts/fa-brands-400.woff2" />
29<link rel="preload" as="font" type="font/woff2" crossorigin href="../../_static/vendor/fontawesome/6.5.1/webfonts/fa-regular-400.woff2" />
30
31    <link rel="stylesheet" type="text/css" href="../../_static/pygments.css?v=fa44fd50" />
32    <link rel="stylesheet" type="text/css" href="../../_static/styles/sphinx-book-theme.css?v=384b581d" />
33    <link rel="stylesheet" type="text/css" href="../../_static/togglebutton.css?v=13237357" />
34    <link rel="stylesheet" type="text/css" href="../../_static/copybutton.css?v=76b2166b" />
35    <link rel="stylesheet" type="text/css" href="../../_static/mystnb.4510f1fc1dee50b3e5859aac5469c37c29e427902b24a333a5f9fcb2f0b3ac41.css?v=be8a1c11" />
36    <link rel="stylesheet" type="text/css" href="../../_static/sphinx-thebe.css?v=4fa983c6" />
37    <link rel="stylesheet" type="text/css" href="../../_static/design-style.1e8bd061cd6da7fc9cf755528e8ffc24.min.css?v=0a3b3ea7" />
38    <link rel="stylesheet" type="text/css" href="../../_static/test.css?v=b8724412" />
39  
40  <!-- Pre-loaded scripts that we'll load fully later -->
41  <link rel="preload" as="script" href="../../_static/scripts/bootstrap.js?digest=8d27b9dea8ad943066ae" />
42<link rel="preload" as="script" href="../../_static/scripts/pydata-sphinx-theme.js?digest=8d27b9dea8ad943066ae" />
43  
43<script src="../../_static/vendor/fontawesome/6.5.1/js/all.min.js?digest=8d27b9dea8ad943066ae"></script>
43
44
45    
45<script src="../../_static/documentation_options.js?v=dd46f0c4"></script>
45
46    
46<script src="../../_static/doctools.js?v=9a2dae69"></script>
46
47    
47<script src="../../_static/sphinx_highlight.js?v=dc90522c"></script>
47
48    
48<script src="../../_static/clipboard.min.js?v=a7894cd8"></script>
48
49    
49<script src="../../_static/copybutton.js?v=f281be69"></script>
49
50    
50<script src="../../_static/scripts/sphinx-book-theme.js?v=efea14e4"></script>
50
51    
51<script>let toggleHintShow = 'Click to show';</script>
51
52    
52<script>let toggleHintHide = 'Click to hide';</script>
52
53    
53<script>let toggleOpenOnPrint = 'true';</script>
53
54    
54<script src="../../_static/togglebutton.js?v=4a39c7ea"></script>
54
55    
55<script src="../../_static/translations.js?v=29b1f277"></script>
55
56    
56<script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
56
57    
57<script src="../../_static/design-tabs.js?v=36754332"></script>
57
58    
58<script>const THEBE_JS_URL = "https://unpkg.com/[email protected]/lib/index.js"; const thebe_selector = ".thebe,.cell"; const thebe_selector_input = "pre"; const thebe_selector_output = ".output, .cell_output"</script>
58
59    
59<script async="async" src="../../_static/sphinx-thebe.js?v=c100c467"></script>
59
60    
60<script>var togglebuttonSelector = '.toggle, .admonition.dropdown';</script>
60
61    
61<script>const THEBE_JS_URL = "https://unpkg.com/[email protected]/lib/index.js"; const thebe_selector = ".thebe,.cell"; const thebe_selector_input = "pre"; const thebe_selector_output = ".output, .cell_output"</script>
61
62    
62<script>window.MathJax = {"options": {"processHtmlClass": "tex2jax_process|mathjax_process|math|output_area"}}</script>
62
63    
63<script defer="defer" src="../../_static/mathjax/tex-chtml.js?v=20daa33d"></script>
63
64    
64<script>DOCUMENTATION_OPTIONS.pagename = 'Block1/Sem3/intro';</script>
64
65    
65<script src="../../_static/test.js?v=32d70693"></script>
65
66    <link rel="icon" href="../../_static/favicon.ico"/>
67    <link rel="index" title="Алфавитный указатель" href="../../genindex.html" />
68    <link rel="search" title="Поиск" href="../../search.html" />
69    <link rel="next" title="Задача регрессии (аппроксимации)" href="1.html" />
70    <link rel="prev" title="Домашнее задание" href="../Sem2/hw.html" />
71  <meta name="viewport" content="width=device-width, initial-scale=1"/>
72  <meta name="docsearch:language" content="ru"/>
73  </head>
74  
75  
76  <body data-bs-spy="scroll" data-bs-target=".bd-toc-nav" data-offset="180" data-bs-root-margin="0px 0px -60%" data-default-mode="">
77
78  
79  
80  <a id="pst-skip-link" class="skip-link" href="#main-content">Перейти к основному содержанию</a>
81  
82  <div id="pst-scroll-pixel-helper"></div>
83  
84  <button type="button" class="btn rounded-pill" id="pst-back-to-top">
85    <i class="fa-solid fa-arrow-up"></i>
86    Back to top
87  </button>
88
89  
90  <input type="checkbox"
91          class="sidebar-toggle"
92          name="__primary"
93          id="__primary"/>
94  <label class="overlay overlay-primary" for="__primary"></label>
95  
96  <input type="checkbox"
97          class="sidebar-toggle"
98          name="__secondary"
99          id="__secondary"/>
100  <label class="overlay overlay-secondary" for="__secondary"></label>
101  
102  <div class="search-button__wrapper">
103    <div class="search-button__overlay"></div>
104    <div class="search-button__search-container">
105<form class="bd-search d-flex align-items-center"
106      action="../../search.html"
107      method="get">
108  <i class="fa-solid fa-magnifying-glass"></i>
109  <input type="search"
110         class="form-control"
111         name="q"
112         id="search-input"
113         placeholder="Search this book..."
114         aria-label="Search this book..."
115         autocomplete="off"
116         autocorrect="off"
117         autocapitalize="off"
118         spellcheck="false"/>
119  <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span>
120</form></div>
121  </div>
122  
123    <header class="bd-header navbar navbar-expand-lg bd-navbar">
124    </header>
125  
126
127  <div class="bd-container">
128    <div class="bd-container__inner bd-page-width">
129      
130      
131      
132      <div class="bd-sidebar-primary bd-sidebar">
133        
134
135  
136  <div class="sidebar-header-items sidebar-primary__section">
137    
138    
139    
140    
141  </div>
142  
143    <div class="sidebar-primary-items__start sidebar-primary__section">
144        <div class="sidebar-primary-item">
145
146  
147
148<a class="navbar-brand logo" href="../../index.html">
149  
150  
151  
152  
153  
154    
155    
156      
157    
158    
159    <img src="../../_static/logo.jpeg" class="logo__image only-light" alt="Вычислительная математика - Home"/>
160    
160<script>document.write(`<img src="../../_static/logo.jpeg" class="logo__image only-dark" alt="Вычислительная математика - Home"/>`);</script>
160
161  
162  
163</a></div>
164        <div class="sidebar-primary-item">
165
166 
166<script>
167 document.write(`
168   <button class="btn navbar-btn search-button-field search-button__button" title="Поиск" aria-label="Поиск" data-bs-placement="bottom" data-bs-toggle="tooltip">
169    <i class="fa-solid fa-magnifying-glass"></i>
170    <span class="search-button__default-text">Поиск</span>
171    <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd class="kbd-shortcut__modifier">K</kbd></span>
172   </button>
173 `);
174 </script>
174</div>
175        <div class="sidebar-primary-item"><nav class="bd-links bd-docs-nav" aria-label="Main">
176    <div class="bd-toc-item navbar-nav active">
177        
178        <ul class="nav bd-sidenav bd-sidenav__home-link">
179            <li class="toctree-l1">
180                <a class="reference internal" href="../../index.html">
181                    Вычислительная математика
182                </a>
183            </li>
184        </ul>
185        <p aria-level="2" class="caption" role="heading"><span class="caption-text">I.🚀Основы вычислительной математики. Линейные модели</span></p>
186<ul class="current nav bd-sidenav">
187<li class="toctree-l1 has-children"><a class="reference internal" href="../Sem1/intro.html">1.1 Введение, Численное дифференцирование, Погрешности</a><input class="toctree-checkbox" id="toctree-checkbox-1" name="toctree-checkbox-1" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-1"><i class="fa-solid fa-chevron-down"></i></label><ul>
188<li class="toctree-l2"><a class="reference internal" href="../Sem1/1.html">Введение</a></li>
189<li class="toctree-l2"><a class="reference internal" href="../Sem1/2.html">Численное дифференцирование</a></li>
190<li class="toctree-l2"><a class="reference internal" href="../Sem1/3.html">Погрешность метода</a></li>
191<li class="toctree-l2"><a class="reference internal" href="../Sem1/4.html">Погрешность машинного округления</a></li>
192<li class="toctree-l2"><a class="reference internal" href="../Sem1/5.html">Оптимальный шаг дифференцирования</a></li>
193<li class="toctree-l2"><a class="reference internal" href="../Sem1/hw.html">Домашнее задание</a></li>
194</ul>
195</li>
196<li class="toctree-l1 has-children"><a class="reference internal" href="../Sem2/intro.html">1.2 Нормы. Числа обусловленности</a><input class="toctree-checkbox" id="toctree-checkbox-2" name="toctree-checkbox-2" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-2"><i class="fa-solid fa-chevron-down"></i></label><ul>
197<li class="toctree-l2"><a class="reference internal" href="../Sem2/1.html">Задачи вычислительной линейной алгебры</a></li>
198<li class="toctree-l2"><a class="reference internal" href="../Sem2/2.html">Линейная алгебра (напоминание)</a></li>
199<li class="toctree-l2"><a class="reference internal" href="../Sem2/3.html">Числа обусловленности</a></li>
200<li class="toctree-l2"><a class="reference internal" href="../Sem2/hw.html">Домашнее задание</a></li>
201</ul>
202</li>
203<li class="toctree-l1 current active has-children"><a class="current reference internal" href="#">1.3 Линейная регрессия. PCA</a><input checked="" class="toctree-checkbox" id="toctree-checkbox-3" name="toctree-checkbox-3" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-3"><i class="fa-solid fa-chevron-down"></i></label><ul>
204<li class="toctree-l2"><a class="reference internal" href="1.html">Задача регрессии (аппроксимации)</a></li>
205<li class="toctree-l2"><a class="reference internal" href="2.html">Линейная регрессия</a></li>
206<li class="toctree-l2"><a class="reference internal" href="3.html">Метод главных компонент (PCA)</a></li>
207<li class="toctree-l2"><a class="reference internal" href="hw.html">Домашнее задание</a></li>
208</ul>
209</li>
210<li class="toctree-l1 has-children"><a class="reference internal" href="../Sem4/intro.html">1.4 Взвешенный МНК. Погрешности весов. Матричные разложения</a><input class="toctree-checkbox" id="toctree-checkbox-4" name="toctree-checkbox-4" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-4"><i class="fa-solid fa-chevron-down"></i></label><ul>
211<li class="toctree-l2"><a class="reference internal" href="../Sem4/1.html">Матричные разложения</a></li>
212<li class="toctree-l2"><a class="reference internal" href="../Sem4/2.html">Погрешности данных и весов</a></li>
213<li class="toctree-l2"><a class="reference internal" href="../Sem4/hw.html">Домашнее задание</a></li>
214</ul>
215</li>
216</ul>
217<p aria-level="2" class="caption" role="heading"><span class="caption-text">II.✨Обработка данных и оптимизация. Нелинейные модели</span></p>
218<ul class="nav bd-sidenav">
219<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block2/Sem1/intro.html">2.1 Байесовское оценивание. Регуляризация. Численное решение регрессии</a><input class="toctree-checkbox" id="toctree-checkbox-5" name="toctree-checkbox-5" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-5"><i class="fa-solid fa-chevron-down"></i></label><ul>
220<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem1/1.html">Критерии переобучения и регуляризация</a></li>
221<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem1/2.html">Теорема Байеса</a></li>
222
223<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem1/3.html">Градиентный спуск - численный способ минимизации Loss-a. Простейший случай</a></li>
224<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem1/4.html">Гиперпараметры и кросс-валидация</a></li>
225<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem1/hw.html">Домашнее задание</a></li>
226</ul>
227</li>
228<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block2/Sem2/intro.html">2.2 Минимизация функции. Нелинейная регрессиÑ
228</a><input class="toctree-checkbox" id="toctree-checkbox-6" name="toctree-checkbox-6" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-6"><i class="fa-solid fa-chevron-down"></i></label><ul>
229<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem2/1.html">Локальная минимизация по одной переменной</a></li>
230<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem2/2.html">Локальная минимизация по нескольким переменным</a></li>
231<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem2/3.html">Нелинейная регрессия</a></li>
232<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem2/hw.html">Домашнее задание</a></li>
233</ul>
234</li>
235<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block2/Sem3/intro.html">2.3 Нелинейные уравнения и системы.</a><input class="toctree-checkbox" id="toctree-checkbox-7" name="toctree-checkbox-7" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-7"><i class="fa-solid fa-chevron-down"></i></label><ul>
236<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem3/1.html">Нелинейные уравнения одной переменной</a></li>
237
238<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem3/2.html">Нелинейные системы уравнений</a></li>
239<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem3/hw.html">Домашнее задание</a></li>
240</ul>
241</li>
242<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block2/Sem4/intro.html">2.4 Кластеризация</a><input class="toctree-checkbox" id="toctree-checkbox-8" name="toctree-checkbox-8" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-8"><i class="fa-solid fa-chevron-down"></i></label><ul>
243<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem4/1.html">Кластеризация - что это и где нужно</a></li>
244<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem4/2.html">Методы кластеризации</a></li>
245<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem4/3.html">Оценка качества кластеризации</a></li>
246<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem4/hw.html">Домашнее задание</a></li>
247</ul>
248</li>
249<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block2/Sem5/intro.html">2.5* Классификация. Нейронки</a><input class="toctree-checkbox" id="toctree-checkbox-9" name="toctree-checkbox-9" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-9"><i class="fa-solid fa-chevron-down"></i></label><ul>
250<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem5/1.html">Задача классификации</a></li>
251<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem5/2.html">Построение многослойного персептрона</a></li>
252<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem5/3.html">Обучение перспетрона</a></li>
253
254<li class="toctree-l2"><a class="reference internal" href="../../Block2/Sem5/hw.html">Домашнее задание</a></li>
255</ul>
256</li>
257</ul>
258<p aria-level="2" class="caption" role="heading"><span class="caption-text">III.🌀Вычислительная линейная алгебра</span></p>
259<ul class="nav bd-sidenav">
260<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block3/Sem1/intro.html">3.1 Итерационные методы для решения СЛАУ</a><input class="toctree-checkbox" id="toctree-checkbox-10" name="toctree-checkbox-10" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-10"><i class="fa-solid fa-chevron-down"></i></label><ul>
261<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem1/1.html">Прямые методы решения СЛАУ.</a></li>
262<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem1/2.html">Двухслойные итерационные схемы</a></li>
263<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem1/3.html">Многослойные итерационные схемы</a></li>
264<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem1/4.html">Сравнение итерационного метода Якоби и прямого метода Гаусса</a></li>
265
266<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem1/hw.html">Домашнее задание</a></li>
267</ul>
268</li>
269<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block3/Sem2/intro.html">3.2 Проблема собственных значений</a><input class="toctree-checkbox" id="toctree-checkbox-11" name="toctree-checkbox-11" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-11"><i class="fa-solid fa-chevron-down"></i></label><ul>
270<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem2/1.html">Степенной метод и определения</a></li>
271<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem2/2.html">QR алгоритм</a></li>
272<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem2/3.html">Другие методы</a></li>
273<li class="toctree-l2"><a class="reference internal" href="../../Block3/Sem2/hw.html">Домашнее задание</a></li>
274</ul>
275</li>
276</ul>
277<p aria-level="2" class="caption" role="heading"><span class="caption-text">IV.🧮Вычислительный математический анализ</span></p>
278<ul class="nav bd-sidenav">
279<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block4/Sem1/intro.html">4.1 Интерполяция</a>
279<input class="toctree-checkbox" id="toctree-checkbox-12" name="toctree-checkbox-12" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-12"><i class="fa-solid fa-chevron-down"></i></label><ul>
280<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem1/1.html">Задача интерполяции. Полиномиальная интерполяция</a></li>
281<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem1/2.html">Погрешности алгебраической интерполяции</a></li>
282<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem1/3.html">Интерполяция сплайном</a></li>
283<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem1/hw.html">Домашнее задание</a></li>
284</ul>
285</li>
286<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block4/Sem2/intro.html">4.2 Численное интегрирование</a><input class="toctree-checkbox" id="toctree-checkbox-13" name="toctree-checkbox-13" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-13"><i class="fa-solid fa-chevron-down"></i></label><ul>
287<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem2/1.html">Квадратуры Ньютона</a></li>
288<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem2/2.html">Практическая оценка погрешности</a></li>
289<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem2/3.html">Квадратуры Гаусса</a></li>
290<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem2/4.html">Интегралы с особенностями</a></li>
291<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem2/hw.html">Домашнее задание</a></li>
292</ul>
293</li>
294<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block4/Sem3/intro.html">4.3 Пределы и ряды</a><input class="toctree-checkbox" id="toctree-checkbox-14" name="toctree-checkbox-14" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-14"><i class="fa-solid fa-chevron-down"></i></label><ul>
295<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem3/1.html">Численное интегрирование на разностных схемах</a></li>
296<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem3/2.html">Расчёт бесконечных сумм</a></li>
297<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem3/3.html">Быстрое вычисление пределов</a></li>
298<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem3/hw.html">Домашнее задание</a></li>
299</ul>
300</li>
301<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block4/Sem4/intro.html">4.4 Дискретное преобразование Фурье</a><input class="toctree-checkbox" id="toctree-checkbox-15" name="toctree-checkbox-15" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-15"><i class="fa-solid fa-chevron-down"></i></label><ul>
302<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem4/1.html">Дискретное преобразование Фурье</a></li>
303<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem4/2.html">Быстрое преобразование Фурье (FFT)</a></li>
304<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem4/3.html">Анализ сезонности во временных рядах (реальный пример)</a></li>
305<li class="toctree-l2"><a class="reference internal" href="../../Block4/Sem4/hw.html">Домашнее задание</a></li>
306</ul>
307</li>
308</ul>
309<p aria-level="2" class="caption" role="heading"><span class="caption-text">V.🥓Дифференциальные уравнения</span></p>
310<ul class="nav bd-sidenav">
311<li class="toctree-l1 has-children">
311<a class="reference internal" href="../../Block5/Sem1/intro.html">5.1 ОДУ. Задача Коши</a><input class="toctree-checkbox" id="toctree-checkbox-16" name="toctree-checkbox-16" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-16"><i class="fa-solid fa-chevron-down"></i></label><ul>
312<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/1.html">Дискретизация Задачи Коши. Частный случай, общий подход</a></li>
313<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/2.html">Дискретизация Задачи Коши. Общая теория дискретизации ОДУ.</a></li>
314<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/3.html">Исследование схем на устойчивость</a></li>
315<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/4.html">Жесткие системы</a></li>
316<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/5.html">Одношаговые методы Рунге-Кутта</a></li>
317<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/6.html">Многошаговые методы</a></li>
318<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem1/hw.html">Домашнее задание</a></li>
319
320
321
322</ul>
323</li>
324<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block5/Sem2/intro.html">5.2 ОДУ. Краевая задача</a><input class="toctree-checkbox" id="toctree-checkbox-17" name="toctree-checkbox-17" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-17"><i class="fa-solid fa-chevron-down"></i></label><ul>
325<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem2/1.html">Линейная краевая задача</a></li>
326
327
328<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem2/2.html">Нелинейная краевая задача</a></li>
329
330<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem2/3.html">Аппроксимация граничных условий</a></li>
331
332<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem2/hw.html">Домашнее задание</a></li>
333</ul>
334</li>
335<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block5/Sem3/intro.html">5.3 УРЧП. Метод конечных разностей</a><input class="toctree-checkbox" id="toctree-checkbox-18" name="toctree-checkbox-18" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-18"><i class="fa-solid fa-chevron-down"></i></label><ul>
336<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/1.html">Формулировка УРЧП. Классификация</a></li>
337<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/2.html">Параболический тип. Общие принципы метода конечных разностей</a></li>
338
339
340
341
342
343<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/3.html">Эллиптический тип</a></li>
344<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/4.html">Гиперболические уравнения</a></li>
345<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/5.html">Сходимость разностных схем</a></li>
346
347
348<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/6.html">Задание краевых условий на криволинейной границе</a></li>
349<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem3/hw.html">Домашнее задание</a></li>
350</ul>
351</li>
352<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block5/Sem4/intro.html">5.4 УРЧП. Finite Element Method</a><input class="toctree-checkbox" id="toctree-checkbox-19" name="toctree-checkbox-19" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-19"><i class="fa-solid fa-chevron-down"></i></label><ul>
353<li class="toctree-l2">
353<a class="reference internal" href="../../Block5/Sem4/1.html">Теория метода конечных элементов (FEM)</a></li>
354<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/2.html">Библиотека FEniCS</a></li>
355<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/3.html">Пример. Уравнение Пуассона</a></li>
356<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/4.html">Пример. Нелинейное уравнение Пуассона</a></li>
357<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/5.html">Пример. Уравнение теплопроводности</a></li>
358<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/6.html">Пример. Уравнение Навье-Стокса</a></li>
359<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem4/hw.html">Домашнее задание</a></li>
360</ul>
361</li>
362<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block5/Sem5/intro.html">5.5* Нейросетевые методы для решения ДУ</a><input class="toctree-checkbox" id="toctree-checkbox-20" name="toctree-checkbox-20" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-20"><i class="fa-solid fa-chevron-down"></i></label><ul>
363<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem5/1.html">Теоретическое введение</a></li>
364<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem5/2.html">ОДУ первого порядка</a></li>
365<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem5/3.html">ОДУ второго порядка</a></li>
366<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem5/4.html">УРЧП</a></li>
367<li class="toctree-l2"><a class="reference internal" href="../../Block5/Sem5/5.html">Современные подходы и применения</a></li>
368</ul>
369</li>
370</ul>
371<p aria-level="2" class="caption" role="heading"><span class="caption-text">VI.🎲Случайные процессы</span></p>
372<ul class="nav bd-sidenav">
373<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block6/Sem1/intro.html">6.1 Основы метода Монте-Карло</a><input class="toctree-checkbox" id="toctree-checkbox-21" name="toctree-checkbox-21" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-21"><i class="fa-solid fa-chevron-down"></i></label><ul>
374<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem1/1.html">«Школьный» пример. Вычисление числа <span class="math notranslate nohighlight">\(\pi\)</span></a></li>
375<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem1/2.html">Интегрирование методом Монте-Карло</a></li>
376
377
378<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem1/3.html">Монте-Карло для генерации точек из распределений (сэмплирование)</a></li>
379
380
381<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem1/4.html">Нахождение физических величин с помощью Монте-Карло. Модель Изинга</a></li>
382<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem1/hw.html">Домашнее задание</a></li>
383</ul>
384</li>
385<li class="toctree-l1 has-children"><a class="reference internal" href="../../Block6/Sem2/intro.html">6.2* Renforcement Learning</a><input class="toctree-checkbox" id="toctree-checkbox-22" name="toctree-checkbox-22" type="checkbox"/><label class="toctree-toggle" for="toctree-checkbox-22"><i class="fa-solid fa-chevron-down"></i></label><ul>
386<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem2/1.html">Мотивация</a></li>
387<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem2/2.html">Основные определения. Value iteration</a></li>
388
389<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem2/3.html">Q-Learning</a></li>
390<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem2/4.html">Approximate Q-Learning</a></li>
391<li class="toctree-l2"><a class="reference internal" href="../../Block6/Sem2/hw.html">Домашнее задание</a></li>
392</ul>
393</li>
394</ul>
395
396    </div>
397</nav></div>
398    </div>
399  
400  
401  <div class="sidebar-primary-items__end sidebar-primary__section">
402  </div>
403  
404  <div id="rtd-footer-container"></div>
405
406
407      </div>
408      
409      <main id="main-content" class="bd-main">
410        
411        
412
413<div class="sbt-scroll-pixel-helper"></div>
414
415          <div class="bd-content">
416            <div class="bd-article-container">
417              
418              <div class="bd-header-article">
419<div class="header-article-items header-article__inner">
420  
421    <div class="header-article-items__start">
422      
423        <div class="header-article-item"><label class="sidebar-toggle primary-toggle btn btn-sm" for="__primary" title="Toggle primary sidebar" data-bs-placement="bottom" data-bs-toggle="tooltip">
424  <span class="fa-solid fa-bars"></span>
425</label></div>
426      
427    </div>
428  
429  
430    <div class="header-article-items__end">
431      
432        <div class="header-article-item">
433
434<div class="article-header-buttons">
435
436
437
438
439
440<div class="dropdown dropdown-download-buttons">
441  <button class="btn dropdown-toggle" type="button" data-bs-toggle="dropdown" aria-expanded="false" aria-label="Загрузите эту страницу">
442    <i class="fas fa-download"></i>
443  </button>
444  <ul class="dropdown-menu">
445      
446      
447      
448      <li><a href="../../_sources/" target="_blank"
449   class="btn btn-sm btn-download-source-button dropdown-item"
450   title="Скачать исходный файл"
451   data-bs-placement="left" data-bs-toggle="tooltip"
452>
453  
454
455<span class="btn__icon-container">
456  <i class="fas fa-file"></i>
457  </span>
458<span class="btn__text-container">.md</span>
459</a>
460</li>
461      
462      
463      
464      
465      <li>
466<button onclick="window.print()"
467  class="btn btn-sm btn-download-pdf-button dropdown-item"
468  title="Распечатать в PDF"
469  data-bs-placement="left" data-bs-toggle="tooltip"
470>
471  
472
473<span class="btn__icon-container">
474  <i class="fas fa-file-pdf"></i>
475  </span>
476<span class="btn__text-container">.pdf</span>
477</button>
478</li>
479      
480  </ul>
481</div>
482
483
484
485
486<button onclick="toggleFullScreen()"
487  class="btn btn-sm btn-fullscreen-button"
488  title="Полноэкранный режим"
489  data-bs-placement="bottom" data-bs-toggle="tooltip"
490>
491  
492
493<span class="btn__icon-container">
494  <i class="fas fa-expand"></i>
495  </span>
496
497</button>
498
499
500
501<script>
502document.write(`
503  <button class="btn btn-sm navbar-btn theme-switch-button" title="светлая/темная" aria-label="светлая/темная" data-bs-placement="bottom" data-bs-toggle="tooltip">
504    <span class="theme-switch nav-link" data-mode="light"><i class="fa-solid fa-sun fa-lg"></i></span>
505    <span class="theme-switch nav-link" data-mode="dark"><i class="fa-solid fa-moon fa-lg"></i></span>
506    <span class="theme-switch nav-link" data-mode="auto"><i class="fa-solid fa-circle-half-stroke fa-lg"></i></span>
507  </button>
508`);
509</script>
509
510
511
512<script>
513document.write(`
514  <button class="btn btn-sm navbar-btn search-button search-button__button" title="Поиск" aria-label="Поиск" data-bs-placement="bottom" data-bs-toggle="tooltip">
515    <i class="fa-solid fa-magnifying-glass fa-lg"></i>
516  </button>
517`);
518</script>
518
519
520</div></div>
521      
522    </div>
523  
524</div>
525</div>
526              
527              
528
529<div id="jb-print-docs-body" class="onlyprint">
530    <h1>1.3 Линейная регрессия. PCA</h1>
531    <!-- Table of contents -->
532    <div id="print-main-content">
533        <div id="jb-print-toc">
534            
535        </div>
536    </div>
537</div>
538
539              
540                
541<div id="searchbox"></div>
542                <article class="bd-article">
543                  
544  <section class="tex2jax_ignore mathjax_ignore" id="pca">
545<h1>1.3 Линейная регрессия. PCA<a class="headerlink" href="#pca" title="Link to this heading">#</a></h1>
546<p>Содержание семинара:</p>
547<ul class="simple">
548<li><p><strong>Задача регрессии (аппроксимации)</strong></p>
549<ul>
550<li><p>Формулировка</p></li>
551<li><p>Семейства функций (модели)</p>
552<ul>
553<li><p>Примеры</p></li>
554</ul>
555</li>
556</ul>
557</li>
558<li><p><strong>Функция потерь (Loss)</strong></p>
559<ul>
560<li><p>MSE, RMSE, log-loss</p></li>
561</ul>
562</li>
563<li><p><strong>Матрица объекты-признаки</strong></p></li>
564<li><p><strong>Линейная регрессия</strong></p>
565<ul>
566<li><p>Матрица объекты-признаки</p></li>
567<li><p><strong>Точное решение для MSE</strong></p></li>
568<li><p>Пример с независимыми признаками</p></li>
569<li><p>Пример с многочленами</p></li>
570</ul>
571</li>
572<li><p><strong>Переобучение - общая проблема регрессии</strong></p></li>
573<li><p><strong>Метод главных компонент (PCA)</strong></p>
574<ul>
575<li><p>Ковариационная матрица</p></li>
576<li><p>PCA как метод борьбы с переобучением</p></li>
577<li><p>Пример с обрезкой лишних признаков</p></li>
578<li><p>Пример с сжатием изображения</p></li>
579</ul>
580</li>
581<li><p><strong>Домашнее задание</strong></p></li>
582</ul>
583<div class="toctree-wrapper compound">
584</div>
585</section>
586
587    
587<script type="text/x-thebe-config">
588    {
589        requestKernel: true,
590        binderOptions: {
591            repo: "executablebooks/jupyter-book",
592            ref: "master",
593        },
594        codeMirrorConfig: {
595            theme: "abcdef",
596            mode: "python"
597        },
598        kernelOptions: {
599            name: "python3",
600            path: "./Block1/Sem3"
601        },
602        predefinedOutput: true
603    }
604    </script>
604
605    
605<script>kernelName = 'python3'</script>
605
606
607                </article>
608              
609
610              
611              
612              
613              
614                <footer class="prev-next-footer">
615                  
616<div class="prev-next-area">
617    <a class="left-prev"
618       href="../Sem2/hw.html"
619       title="предыдущая страница">
620      <i class="fa-solid fa-angle-left"></i>
621      <div class="prev-next-info">
622        <p class="prev-next-subtitle">назад</p>
623        <p class="prev-next-title">Домашнее задание</p>
624      </div>
625    </a>
626    <a class="right-next"
627       href="1.html"
628       title="следующая страница">
629      <div class="prev-next-info">
630        <p class="prev-next-subtitle">вперёд</p>
631        <p class="prev-next-title">Задача регрессии (аппроксимации)</p>
632      </div>
633      <i class="fa-solid fa-angle-right"></i>
634    </a>
635</div>
636                </footer>
637              
638            </div>
639            
640            
641              
642                <div class="bd-sidebar-secondary bd-toc"></div>
643              
644            
645          </div>
646          <footer class="bd-footer-content">
647            
648<div class="bd-footer-content__inner container">
649  
650  <div class="footer-item">
651    
652<p class="component-author">
653По The Jupyter Book community
654</p>
655
656  </div>
657  
658  <div class="footer-item">
659    
660
661  <p class="copyright">
662    
663      © Копирайт 2023.
664      <br/>
665    
666  </p>
667
668  </div>
669  
670  <div class="footer-item">
671    
672  </div>
673  
674  <div class="footer-item">
675    
676  </div>
677  
678</div>
679          </footer>
680        
681
682      </main>
683    </div>
684  </div>
685  
686  <!-- Scripts loaded after <body> so the DOM is not blocked -->
687  
687<script src="../../_static/scripts/bootstrap.js?digest=8d27b9dea8ad943066ae"></script>
vendor: 1 bytes, line 687
687
688<script src="../../_static/scripts/pydata-sphinx-theme.js?digest=8d27b9dea8ad943066ae"></script>
688
689
690  <footer class="bd-footer">
691  </footer>
692  </body>
693</html>

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.