This work demonstrates for the first time that mode connectivity between independently trained DDPM and NanoCLIP modes is discovered, and provides a novel perspective for understanding the geometric properties of the loss landscapes in modern generative and contrastive models.
Abstract
The loss landscape of Deep Neural Networks (DNNs) exhibits highly complex and non-convex properties. Recent studies have revealed the phenomenon of mode connectivity, demonstrating that independently trained network modes can be connected via a continuous low-loss path. However, existing mode connectivity research is predominantly confined to classifier-based models, leaving it an open question whether similar geometric properties exist in modern complex models. In this paper, we extend the boundaries of mode connectivity to generative and contrastive domains (specifically DDPM and NanoCLIP). Addressing the unique architecture of DDPM and CLIP, we propose an architecture-aware connection building algorithm. Extensive empirical results demonstrate for the first time that we successfully discover mode connectivity between independently trained DDPM and NanoCLIP modes. Our work provides a novel perspective for understanding the geometric properties of the loss landscapes in modern generative and contrastive models.
An AI-for-science approach to linking neural connectivity to computation is suggested and a conditional generative latent framework is proposed that encodes connectome graphs into a compact structural space while using available node-level conditions to guide reconstruction and generation.
Zhuo-Lin Yu, Xing-Yu Liu, Yuan-Hao Jia et al.· 0 citations
CNMTDL is introduced, a MTDL framework that integrates Hodge decomposition with a combinatorial attention mechanism, enabling enhanced higher-order message passing between 0-cells and 2-cells through attention-based blocks.
A. Wachira, Xiang Liu, Zhe Su et al.· arXiv.org· 0 citations
Neuroscientific learning theories propose that the brain acquires knowledge by constructing internal world models. Supervised learning, the dominant approach in deep neural networks (DNN), relies on external category labels, making it difficult to reconcile with biological learning. There is an increasing trend towards...
Dirk Gütlin, Denise Kittelmann, Ryszard Auksztulewicz· bioRxiv· 0 citations
This work introduces a method that maintains near-baseline accuracy, induces usage-based modularity by sparsely routing inputs to neuron groups, and encourages specialization of these modules, such that their activations are correlated with input classes.
Recently, deep neural networks on manifold-valued representations have garnered significant attention across various machine learning applications. One recent focus is the generalization of Euclidean fully connected (FC) and convolutional layers to non-Euclidean geometries. However, previous approaches typically focus...
A new iterative pruning algorithm is proposed, Iterative Flow-Aware Pruning (IFAP), that leverages these measures to identify and eliminate non-essential parameters while preserving critical information pathways in deep neural networks.
A. Samarin, Artem A. Nazarenko, E. Kotenko et al.· Machine Learning and Knowled...· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 6, 2026
A machine-learning approach called CheMeleon provides a practical way to develop new drugs or other molecules with much less detailed, expensive experimentation.
Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.
Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.