Диссертации, представленные на защиту и подготовленные в НИУ ВШЭ
Сортировка:по дате защитыпо имени научного руководителяпо имени соискателя
Показаны работы: 1 - 2 из 2
Методы геометрии и топологии для исследования моделей глубокого обученияКандидатская диссертацияУченая степень НИУ ВШЭ
Соискатель:
Магай Герман Игоревич
Руководитель:
Айзенберг Антон Андреевич
Дисс. совет:
Совет по компьютерным наукам
Дата защиты:
24.09.2025
This dissertation is devoted to the development and application of geometric and topological methods for analyzing, interpreting, evaluating, and improving deep learning models. The work investigates geometric and topological properties of internal data representations (embeddings) in various Deep Neural Network (DNN) architectures, including convolutional DNNs and Transformers under different training modes (e.g. supervised, self-supervised learning etc). A method for evaluating model performance based on geometric properties of intermediate representations is proposed. The research develops an approach for improving model performance through integration of domain-specific topological data information into embeddings and proposes a modification of the RNN architecture called TonnetzNet, demonstrating performance enhancement. The work also investigates the applicability of the fractal intrinsic dimension of Transformer embedding data manifold for robust detection of content generated by large language models (LLMs) and presents a method for synthetic image recognition. Finally, the capabilities and limitations of various language models are evaluated in tasks of modeling symbolic sequences representing elements from normal closures in free groups. The dissertation provides both theoretical insights and empirical validation of the developed methods. The research results contribute to the fields of AI safety, mechanistic interpretability, and explainable AI. Overall, the work emphasizes the promise and importance of geometric and topological methods not only as analytical tools, but also as a foundation for developing approaches to interpretation, evaluation, application, and improvement of DNNs.
Ключевые слова:
Диссертация [*.pdf, 56.47 Мб] (дата размещения 22.07.2025)
Резюме [*.pdf, 7.21 Мб] (дата размещения 22.07.2025)
Summary [*.pdf, 7.16 Мб] (дата размещения 22.07.2025)
Рекомендательные системы, основанные на графах, с использованием непрерывных представлений сетейКандидатская диссертацияУченая степень НИУ ВШЭ
Соискатель:
Киселёв Дмитрий Андреевич
Руководитель:
Дисс. совет:
Совет по компьютерным наукам
Дата защиты:
23.03.2023
Nowadays, recommender systems are essential components of various consumer services, from e-commerce to social media. They help navigate through a large volume of items empowering user experience. Methods vary from classic matrix completion techniques to modern sequence models inspired by natural language processing. One of the prominent approaches is to consider the recommender system as a link prediction problem on a bipartite user-item interaction graph.The dissertation studies the adaptation of network embedding techniques to recommender systems. In the dissertation, we investigated different aspects of graph machine learning techniques, and their effect on downstream link prediction problem. We proposed an efficient strategy to incorporate node and edge features with structural information to solve the link prediction (recommendation) problem. Also, we developed novel models to preserve temporality and enable graph-based exploration for recommender systems. Proposed approaches were compared with the state-of-the-art open-source benchmarks and showed the efficiency of our approach.
Ключевые слова:
intrinsic motivation, cold-start, data distribution shifts, Dynamic networks, exploration, Feedback loops, Geometric deep learning, Graph Embedding, graph neural networks, graph neural networks, information fusion, interactive recommender systems, link prediction, network representation learning, online adaptation, Recommender Systems, Self-supervised learning, Temporal network embedding, temporal networks, Temporal random walks
Диссертация [*.pdf, 16.64 Мб] (дата размещения 6.12.2022)
Резюме [*.pdf, 1011.83 Кб] (дата размещения 6.12.2022)
Summary [*.pdf, 901.09 Кб] (дата размещения 6.12.2022)