Plotting


Antigen-Specific Antibody Design via Direct Energy-based Preference Optimization Xiangxin Zhou 1,2,4, Ruizhe Chen

Neural Information Processing Systems

Antibody design, a crucial task with significant implications across various disciplines such as therapeutics and biology, presents considerable challenges due to its intricate nature. In this paper, we tackle antigen-specific antibody sequencestructure co-design as an optimization problem towards specific preferences, considering both rationality and functionality. Leveraging a pre-trained conditional diffusion model that jointly models sequences and structures of antibodies with equivariant neural networks, we propose direct energy-based preference optimization to guide the generation of antibodies with both rational structures and considerable binding affinities to given antigens. Our method involves fine-tuning the pre-trained diffusion model using a residue-level decomposed energy preference. Additionally, we employ gradient surgery to address conflicts between various types of energy, such as attraction and repulsion. Experiments on RAbD benchmark show that our approach effectively optimizes the energy of generated antibodies and achieves state-of-the-art performance in designing high-quality antibodies with low total energy and high binding affinity simultaneously, demonstrating the superiority of our approach.



SNEkhorn: Dimension Reduction with Symmetric Entropic Affinities

Neural Information Processing Systems

Many approaches in machine learning rely on a weighted graph to encode the similarities between samples in a dataset. Entropic affinities (EAs), which are notably used in the popular Dimensionality Reduction (DR) algorithm t-SNE, are particular instances of such graphs. To ensure robustness to heterogeneous sampling densities, EAs assign a kernel bandwidth parameter to every sample in such a way that the entropy of each row in the affinity matrix is kept constant at a specific value, whose exponential is known as perplexity. EAs are inherently asymmetric and row-wise stochastic, but they are used in DR approaches after undergoing heuristic symmetrization methods that violate both the row-wise constant entropy and stochasticity properties. In this work, we uncover a novel characterization of EA as an optimal transport problem, allowing a natural symmetrization that can be computed efficiently using dual ascent. The corresponding novel affinity matrix derives advantages from symmetric doubly stochastic normalization in terms of clustering performance, while also effectively controlling the entropy of each row thus making it particularly robust to varying noise levels. Following, we present a new DR algorithm, SNEkhorn, that leverages this new affinity matrix. We show its clear superiority to existing approaches with several indicators on both synthetic and real-world datasets.


Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning Pascal Welke 3

Neural Information Processing Systems

We introduce r-loopy Weisfeiler-Leman (r-lWL), a novel hierarchy of graph isomorphism tests and a corresponding GNN framework, r-lMPNN, that can count cycles up to length r+2. Most notably, we show that r-lWL can count homomorphisms of cactus graphs. This extends 1-WL, which can only count homomorphisms of trees and, in fact, we prove that r-lWL is incomparable to k-WL for any fixed k. We empirically validate the expressive and counting power of r-lMPNN on several synthetic datasets and demonstrate the scalability and strong performance on various real-world datasets, particularly on sparse graphs. Our code is available on GitHub.



On Analyzing Generative and Denoising Capabilities of Diffusion-based Deep Generative Models

Neural Information Processing Systems

Their main strength comes from their unique setup in which a model (the backward diffusion process) is trained to reverse the forward diffusion process, which gradually adds noise to the input signal. Although DDGMs are well studied, it is still unclear how the small amount of noise is transformed during the backward diffusion process. Here, we focus on analyzing this problem to gain more insight into the behavior of DDGMs and their denoising and generative capabilities. We observe a fluid transition point that changes the functionality of the backward diffusion process from generating a (corrupted) image from noise to denoising the corrupted image to the final sample. Based on this observation, we postulate to divide a DDGM into two parts: a denoiser and a generator. The denoiser could be parameterized by a denoising auto-encoder, while the generator is a diffusion-based model with its own set of parameters.


AI-powered insights come to Garmin - for a price

ZDNet

In addition to the essential LED flashlight, the other major reason I always have a Garmin watch on one wrist is the comprehensive ecosystem powered by Garmin Connect. Garmin Connect, both via its smartphone app and website, will continue to provide a free, personalized experience. However, Garmin is launching another option for people who want more from their devices. Garmin Connect Plus is an optional subscription service for 6.99 monthly or 69.99 annually. There's a free 30-day trial to test the service and see if it satisfies your needs.