AtomSurf : Surface Representation for Learning on Protein Structures

• URL: http://arxiv.org/abs/2309.16519v3
• Date: Thu, 03 Oct 2024 14:55:41 GMT
• Title: AtomSurf : Surface Representation for Learning on Protein Structures
• Authors: Vincent Mallet, Souhaib Attaiki, Yangyang Miao, Bruno Correia, Maks Ovsjanikov,
• Abstract summary: In this work, we adapt a state-of-the-art surface encoder for protein learning tasks. We then perform a comparison of the resulting method against alternative approaches within the Atom3D benchmark. Finally, we propose an integrated approach, which allows learned feature sharing between graphs and surface representations.
• Score: 27.5217378927018
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: While there has been significant progress in evaluating and comparing different representations for learning on protein data, the role of surface-based learning approaches remains not well-understood. In particular, there is a lack of direct and fair benchmark comparison between the best available surface-based learning methods against alternative representations such as graphs. Moreover, the few existing surface-based approaches either use surface information in isolation or, at best, perform global pooling between surface and graph-based architectures. In this work, we fill this gap by first adapting a state-of-the-art surface encoder for protein learning tasks. We then perform a direct and fair comparison of the resulting method against alternative approaches within the Atom3D benchmark, highlighting the limitations of pure surface-based learning. Finally, we propose an integrated approach, which allows learned feature sharing between graphs and surface representations on the level of nodes and vertices $\textit{across all layers}$. We demonstrate that the resulting architecture achieves state-of-the-art results on all tasks in the Atom3D benchmark, while adhering to the strict benchmark protocol, as well as more broadly on binding site identification and binding pocket classification. Furthermore, we use coarsened surfaces and optimize our approach for efficiency, making our tool competitive in training and inference time with existing techniques. Our code and data can be found online: $\texttt{github.com/Vincentx15/atomsurf}$

Related papers

• Flatten Anything: Unsupervised Neural Surface Parameterization [76.4422287292541]
  We introduce the Flatten Anything Model (FAM), an unsupervised neural architecture to achieve global free-boundary surface parameterization. Compared with previous methods, our FAM directly operates on discrete surface points without utilizing connectivity information. Our FAM is fully-automated without the need for pre-cutting and can deal with highly-complex topologies.
  arXiv  Detail & Related papers  (2024-05-23T14:39:52Z)
• GeoMask3D: Geometrically Informed Mask Selection for Self-Supervised Point Cloud Learning in 3D [18.33878596057853]
  We introduce a pioneering approach to self-supervised learning for point clouds. We employ a geometrically informed mask selection strategy called GeoMask3D (GM3D) to boost the efficiency of Masked Autos.
  arXiv  Detail & Related papers  (2024-05-20T23:53:42Z)
• Reviving Life on the Edge: Joint Score-Based Graph Generation of Rich Edge Attributes [14.718204958140888]
  We propose a joint score-based model of nodes and edges for graph generation that considers all graph components. Our approach offers three key novelties: textbf(1) node and edge attributes are combined in an attention module that generates samples based on the two ingredients. We evaluate our method on challenging benchmarks involving real-world and synthetic datasets in which edge features are crucial.
  arXiv  Detail & Related papers  (2024-02-06T14:48:34Z)
• Human as Points: Explicit Point-based 3D Human Reconstruction from Single-view RGB Images [78.56114271538061]
  We introduce an explicit point-based human reconstruction framework called HaP. Our approach is featured by fully-explicit point cloud estimation, manipulation, generation, and refinement in the 3D geometric space. Our results may indicate a paradigm rollback to the fully-explicit and geometry-centric algorithm design.
  arXiv  Detail & Related papers  (2023-11-06T05:52:29Z)
• Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks [18.160610500658183]
  We introduce Biaffine technique to improve the expressiveness of graph convolutional networks with a shallow architecture. Our method is to learn direct dependency on long-distance neighbors for nodes, with which only one-hop message passing is capable of capturing rich information for node representation.
  arXiv  Detail & Related papers  (2023-02-17T06:39:47Z)
• Revisiting Point Cloud Shape Classification with a Simple and Effective Baseline [111.3236030935478]
  We find that auxiliary factors like different evaluation schemes, data augmentation strategies, and loss functions make a large difference in performance. A projection-based method, which we refer to as SimpleView, performs surprisingly well. It achieves on par or better results than sophisticated state-of-the-art methods on ModelNet40 while being half the size of PointNet++.
  arXiv  Detail & Related papers  (2021-06-09T18:01:11Z)
• DiffusionNet: Discretization Agnostic Learning on Surfaces [48.658589779470454]
  We introduce a new approach to deep learning on 3D surfaces, based on the insight that a simple diffusion layer is highly effective for spatial communication. The resulting networks automatically generalize across different samplings and resolutions of a surface. We focus primarily on triangle mesh surfaces, and demonstrate state-of-the-art results for a variety of tasks including surface classification, segmentation, and non-rigid correspondence.
  arXiv  Detail & Related papers  (2020-12-01T23:24:22Z)
• Geography-Aware Self-Supervised Learning [79.4009241781968]
  We show that due to their different characteristics, a non-trivial gap persists between contrastive and supervised learning on standard benchmarks. We propose novel training methods that exploit the spatially aligned structure of remote sensing data. Our experiments show that our proposed method closes the gap between contrastive and supervised learning on image classification, object detection and semantic segmentation for remote sensing.
  arXiv  Detail & Related papers  (2020-11-19T17:29:13Z)
• Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies [65.92826041406802]
  We propose a Proxy-based deep Graph Metric Learning approach from the perspective of graph classification. Multiple global proxies are leveraged to collectively approximate the original data points for each class. We design a novel reverse label propagation algorithm, by which the neighbor relationships are adjusted according to ground-truth labels.
  arXiv  Detail & Related papers  (2020-10-26T14:52:42Z)
• Co-embedding of Nodes and Edges with Graph Neural Networks [13.020745622327894]
  Graph embedding is a way to transform and encode the data structure in high dimensional and non-Euclidean feature space. CensNet is a general graph embedding framework, which embeds both nodes and edges to a latent feature space. Our approach achieves or matches the state-of-the-art performance in four graph learning tasks.
  arXiv  Detail & Related papers  (2020-10-25T22:39:31Z)
• Globally Optimal Segmentation of Mutually Interacting Surfaces using Deep Learning [6.11411524694755]
  Deep learning is emerging as powerful tools for medical image segmentation thanks to its superior feature learning capability. In this work, we propose to parameterize the surface cost functions in the graph model and leverage DL to learn those parameters. The multiple optimal surfaces are then simultaneously detected by minimizing the total surface cost while explicitly enforcing the mutual surface interaction constraints.
  arXiv  Detail & Related papers  (2020-07-02T17:13:35Z)
• Geometrically Principled Connections in Graph Neural Networks [66.51286736506658]
  We argue geometry should remain the primary driving force behind innovation in the emerging field of geometric deep learning. We relate graph neural networks to widely successful computer graphics and data approximation models: radial basis functions (RBFs) We introduce affine skip connections, a novel building block formed by combining a fully connected layer with any graph convolution operator.
  arXiv  Detail & Related papers  (2020-04-06T13:25:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.