LibreTimes

Search results for “ядра”

20 results

Machine Learning 1. Lecture 5. The Support Vector Machine

2026LectureКонстантин Вячеславович Воронцов

The optimal separating hyperplane and the width of the separating strip; the hinge loss and L2 regularization; the Karush–Kuhn–Tucker conditions, the dual problem and the types of objects; kernels, rectifying spaces and the constructive building of kernels; SVM as a two-layer neural network; choosing the constant C; SVM regression; L1 regularization, Elastic Net SVM, SFM and RVM.
0
190

Machine Learning 1. Lecture 4. Metric Methods of Classification and Regression

2026LectureКонстантин Вячеславович Воронцов

The continuity and compactness hypotheses; the Minkowski metric and feature-free distances; the generalized metric classifier, the k nearest neighbours method, the Parzen window and the method of potential functions as a linear classifier; complete cross-validation, the compactness profile and the exact CCV formula for the nearest neighbour method; prototype selection; Nadaraya–Watson kernel smoothing, the choice of kernel and bandwidth.
0
150

Machine Learning 1. Lecture 12. Density Estimation and Bayesian Classification

2026LectureКонстантин Вячеславович Воронцов

Estimating a probability density from a sample: the maximum likelihood principle, the multivariate Gaussian density and its geometric meaning, multicollinearity and regularisation of the covariance matrix; separating a mixture of distributions, the EM algorithm as a method of simple iterations, the Gaussian mixture (GMM); the nonparametric Parzen–Rosenblatt estimate, the choice of kernel and window width; Bayesian classification theory: the generative and discriminative approaches, the optimal Bayes classifier, the Parzen window method, the quadratic discriminant, Fisher's linear discriminant, the radial basis function network and its training by the EM algorithm.
0
160

Algebra 1. Lecture 2

2026LectureАртём Авилов

The order of an element and of a group, the order of a permutation as the lcm of its cycle lengths; generators and cyclic groups; homomorphisms and isomorphisms of groups, the classification of cyclic groups; examples — the sign of a permutation, inversion in an abelian group, the exponential, the determinant, S3S_3 and D3D_3; subgroups, kernel and image, the injectivity criterion; left and right cosets and the partition into them; normal subgroups and conjugation, the index, Lagrange's theorem, subgroups of index 2; the quotient group; the homomorphism theorem with examples; conjugate elements, the centre, a group action on a set.

0
150

Algebra 1. Seminar 2

2026Problem sheetАртём Авилов

Problems for seminar 2 of the course "Algebra 1" (A. A. Avilov, Independent University of Moscow, autumn 2026), 14 September 2026 — group homomorphisms, the homomorphism theorem, conjugate elements, group actions. The group Hom⁡(A,B)\operatorname{Hom}(A, B) of abelian groups; multiplicativity of the index; the third isomorphism theorem; isomorphic subgroups with non-isomorphic quotients; conjugacy in SnS_n and cycle type; conjugacy classes of A5A_5; Aut⁡(Sn)=Sn\operatorname{Aut}(S_n) = S_n for n≠6n \ne 6; the rotation and symmetry groups of the cube; a homomorphism S4→S3S_4 \to S_3; the symmetry group of the icosahedron; the automorphism group of the Petersen graph.

0
180

Topology 2. Problem sheet 1

2026Problem sheetФёдор Вылегжанин

Problems for the course "Topology 2" (F. E. Vylegzhanin, Independent University of Moscow, autumn 2026), sheet 1 of 9 September 2026 — simplicial homology and chain complexes. Zeroth homology and connected components; homology of a disjoint union and of a wedge; triangulations of the circle, the sphere and the Möbius band; the join and the product of simplicial complexes; the Euler characteristic and the Morse inequalities; the number of vertices of a triangulated surface; operations on chain complexes; exact sequences; the Smith normal form and the splitting of a complex.
1
450

Machine Learning 1. Lecture 14. Anomaly Detection and Robust Methods

2026LectureКонстантин Вячеславович Воронцов

Anomaly and novelty detection; heuristic anomaly scores: local density, isolation forest, a mixture with a background component, robust principal component analysis; outlier removal in nonparametric regression, the LOWESS algorithm; anomaly as the value of the loss function; the theory of robust learning: slowly growing functions, iterative reweighting of objects with IRS and IRLS, robust loss functions, the median, the quantile and the censored mean, robust aggregation functions and their smoothing, the IR-ERM algorithm; one-class SVM, learning from positive and unlabeled objects (PU-learning), problems with new and unknown classes.
0
480

Machine Learning 2. Lecture 2. Neural Networks for Unsupervised Learning

2026LectureКонстантин Вячеславович Воронцов

Kohonen networks: clustering as a two-layer neural network, the hard (WTA) and soft (WTM) competition rules, self-organising Kohonen maps and their interpretation; autoencoders: the formulation of the problem, the linear autoencoder and the principal component method, sparse, denoising, contractive, relational and variational autoencoders, reparametrisation, autoencoders for supervised learning, multilayer autoencoders; joint training of several models: pre-training and transfer learning, multi-task learning and few-shot learning, self-supervised learning, distillation and surrogate modelling, learning using privileged information (LUPI), generative adversarial networks (GAN).
0
210

Topology 2. Lecture 1

2026LectureФёдор Вылегжанин

Why homology is needed — the fundamental group as a functor, homotopy groups, bordism and its combinatorial approximation; chain complexes and their homology; abstract simplicial complexes, geometric realisation and triangulations; the complex of simplicial chains, the proof of d2=0d^2 = 0, the simplicial homology of a segment, of two points and of the boundary of a triangle; reduced homology.

1
470

Topology 2. Lecture 3

2026LectureФёдор Вылегжанин

Singular homology — standard simplices and the inclusions of facets, singular simplices and chains, the differential; zeroth homology and path components, the homology of a point, reduced homology; chain maps and maps of homology, functoriality, the chain map induced by a continuous map; chain homotopies and the prism; the homotopy invariance theorem with a full proof via the prism operator; subcomplexes, quotient complexes and the homology of a pair.
1
550

Machine Learning 2. Lecture 12. Interpretability and Explainability

2026LectureКонстантин Вячеславович Воронцов

Interpretability and explainability of machine learning models: goals, tasks and basic notions, who needs explanations and why; interpretable models; feature importance in linear regression: the t-statistic, net effects, contributions and situational importance; partial dependence plots (PDP) and individual conditional expectation plots (ICE); permutation feature importance; the Shapley value from cooperative game theory, its axioms and Monte Carlo estimation, its use in linear regression; surrogate modelling in the neighbourhood of an object, the LIME, Anchors, SHAP, Shapley Kernel and SAGE methods; the Shapley value for training objects, Data Shapley and Gradient Shapley; counterfactual explanations.
0
230

Machine Learning 1. Lecture 1. Basic Concepts and Examples of Applied Problems

2026LectureКонстантин Вячеславович Воронцов

Objects, features and answers; the types of supervised learning problems; parametric models and the learning method; loss functions and empirical risk minimization; the Runge example and overfitting; hold-out, leave-one-out and cross-validation; applied problems from medical diagnosis to sales forecasting; the CRISP-DM standard.
0
210