Difference between revisions of "Week 4"
From Research management course
Line 41: | Line 41: | ||
* [https://youtu.be/8viZLYFfBsM Video for week 4]. | * [https://youtu.be/8viZLYFfBsM Video for week 4]. | ||
* See examples of the reports. | * See examples of the reports. | ||
− | * Бахтеев О.Ю. Системы и средства глубокого обучения, [http://strijov.com/papers/Bakhteev2016AWS.pdf статья] | + | *# Бахтеев О.Ю. Системы и средства глубокого обучения, [http://strijov.com/papers/Bakhteev2016AWS.pdf статья] |
− | * Мотренко А.П. Повышение качества классификации, [http://strijov.com/papers/MolybogMotrenko2017DimRed.pdf статья] | + | *# Мотренко А.П. Повышение качества классификации, [http://strijov.com/papers/MolybogMotrenko2017DimRed.pdf статья] |
− | * Исаченко Р.В. Снижение размерности в задаче декодирования, [https://github.com/Intelligent-Systems-Phystech/2017-Isachenko-PLS/raw/master/doc/Isachenko2017PLS.pdf статья] | + | *# Исаченко Р.В. Снижение размерности в задаче декодирования, [https://github.com/Intelligent-Systems-Phystech/2017-Isachenko-PLS/raw/master/doc/Isachenko2017PLS.pdf статья] |
− | * The goals of computational experiments [http://svn.code.sf.net/p/mlalgorithms/code/Group574/Grabovoy2018OptimalBrainDamage/doc/slides/Grabovoy2018OptimalBrainDamage.pdf А. Грабовой], [http://svn.code.sf.net/p/mlalgorithms/code/Group474/Alekseev2017IntraTextCoherence/doc/Alekseev2017Presentation.pdf В. Алексеев], [http://svn.code.sf.net/p/mlalgorithms/code/Group574/Rogozina2018StructurePredictionRNA/doc/slides/Rogozina2018RNAPredictionsSlides.pdf А. Рогозина], [https://github.com/Intelligent-Systems-Phystech/Group594/raw/master/Igashov2018ProteinLigandComplexes/presentation/presentation.pdf И. Игашов], [http://svn.code.sf.net/p/mlalgorithms/code/Group474/Uvarov2017DynamicGraphicalModels/slides/Uvarov2017DynamicGraphicalModels.pdf Н. Уваров] | + | *# The goals of computational experiments [http://svn.code.sf.net/p/mlalgorithms/code/Group574/Grabovoy2018OptimalBrainDamage/doc/slides/Grabovoy2018OptimalBrainDamage.pdf А. Грабовой], [http://svn.code.sf.net/p/mlalgorithms/code/Group474/Alekseev2017IntraTextCoherence/doc/Alekseev2017Presentation.pdf В. Алексеев], [http://svn.code.sf.net/p/mlalgorithms/code/Group574/Rogozina2018StructurePredictionRNA/doc/slides/Rogozina2018RNAPredictionsSlides.pdf А. Рогозина], [https://github.com/Intelligent-Systems-Phystech/Group594/raw/master/Igashov2018ProteinLigandComplexes/presentation/presentation.pdf И. Игашов], [http://svn.code.sf.net/p/mlalgorithms/code/Group474/Uvarov2017DynamicGraphicalModels/slides/Uvarov2017DynamicGraphicalModels.pdf Н. Уваров] |
− | * Example of the measurement description, [http://www.machinelearning.ru/wiki/images/3/35/Old_Faithful_dataset_description.pdf Bishop C.P. Pattern recognition and machine learning, 2006. Pp. 677-683.]] | + | *# Example of the measurement description, [http://www.machinelearning.ru/wiki/images/3/35/Old_Faithful_dataset_description.pdf Bishop C.P. Pattern recognition and machine learning, 2006. Pp. 677-683.]] |
<!-- * Построение выборки в задачах прогнозирования, [http://svn.code.sf.net/p/mvr/code/lectures/DataFest/Strijov2016Tutorial.pdf слайды]. EXTRACT The feature generation part--> | <!-- * Построение выборки в задачах прогнозирования, [http://svn.code.sf.net/p/mvr/code/lectures/DataFest/Strijov2016Tutorial.pdf слайды]. EXTRACT The feature generation part--> | ||
<!-- * Постановка задачи прогнозирования дефолтов по картам на год вперед, [[Media:Strijov2018ProbStCardScoring.pdf|слайды]] --> | <!-- * Постановка задачи прогнозирования дефолтов по картам на год вперед, [[Media:Strijov2018ProbStCardScoring.pdf|слайды]] --> |
Revision as of 17:21, 1 March 2023
The goal is to get the simplest possible solution to your problem: it is models and its parameters. So make the model fit data with the minimum of your efforts.
Contents
X: Experiment planning
Plan your computational experiment.
- Discuss the experiment goal with your adviser and team.
- Put this goal in the section Computational experiment
- Describe your basic data set, a synthetic, or a simple real one:
- put in the text the title, source and set up of measurements (it is the technical description, the theoretical one is in the problem statement section),
- write down the number of objects, features, describe general statistics,
- for a synthetic data set describe the generation model, its parameters (for example, uniform random independent sampling some given interval).
- Describe the configuration of algorithm run.
- Plan the whole experimental part.
- List expected tables and figures:
- make short and long list, for each
- describe axes,
- make a draft with a pencil.
R: Preliminary report
- Make sure that the obtained results are in not logical (sic!) contradiction with the goals of the computational experiment.
- Illustrate the obtained results with the preliminary plot see the format. Optimally this plot is hand-made. Just draw it with a pencil on a piece of paper. See an example.
- Write a mini-report on the results with
- a short description of the figure: what the reader could see, what are the consequences,
- the results in numbers and comments on it,
- put the report to the section computational experiment.
B: Run basic code
Select the basic algorithm and run it using a simple data set.
- Run your basic algorithm:
- select a simplest algorithm (with your adviser) to (partially) solve the problem you set.
- Collect a synthetic data set or download a simple real-word data set of small size.
- Upload your data to the repository (in case the data size exceed 5MB or the data set consists of numerous files, please discuss with your adviser and team).
- Run the basic algorithm on the synthetic data set, estimate the error.
- Describe the basic algorithm, analyst its features, list competitive models.
- Описание - указание на название черного ящика. Желательно указывать на источник, где содержимое черного ящика описывается подробно. Указывать структурные параметры черного ящика.
- Описание модели как отображения из пространства описания объектов в пространство целевых переменных. При этом можно указать на алгоритм оптимизации параметров модели в виде черного ящика.
- Описание модели и алгоритма оптимизации его параметров в виде псевдокода.
Resources
- Slides for week 4. Slides 2022.
- Video for week 4.
- See examples of the reports.
- Бахтеев О.Ю. Системы и средства глубокого обучения, статья
- Мотренко А.П. Повышение качества классификации, статья
- Исаченко Р.В. Снижение размерности в задаче декодирования, статья
- The goals of computational experiments А. Грабовой, В. Алексеев, А. Рогозина, И. Игашов, Н. Уваров
- Example of the measurement description, Bishop C.P. Pattern recognition and machine learning, 2006. Pp. 677-683.]