Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques

• URL: http://arxiv.org/abs/2208.08910v1
• Date: Thu, 18 Aug 2022 15:22:42 GMT
• Title: Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques
• Abstract summary: The authors present a lightweight solution for the complex problem of 3D protein structure search. The solution consists of three steps -- (i) transformation of 3D protein structural information into very compact vectors, (ii) use of a probabilistic model to group these vectors and respond to queries by returning a given number of similar objects, and (iii) a final filtering step which applies basic vector distance functions to refine the result.
• Score: 2.239917051803691
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite the constant evolution of similarity searching research, it continues to face the same challenges stemming from the complexity of the data, such as the curse of dimensionality and computationally expensive distance functions. Various machine learning techniques have proven capable of replacing elaborate mathematical models with combinations of simple linear functions, often gaining speed and simplicity at the cost of formal guarantees of accuracy and correctness of querying. The authors explore the potential of this research trend by presenting a lightweight solution for the complex problem of 3D protein structure search. The solution consists of three steps -- (i) transformation of 3D protein structural information into very compact vectors, (ii) use of a probabilistic model to group these vectors and respond to queries by returning a given number of similar objects, and (iii) a final filtering step which applies basic vector distance functions to refine the result.

Related papers

• Novel Algorithms for Smoothly Differentiable and Efficiently Vectorizable Contact Manifold Construction [26.543084981943778]
  Developing methods that make use of first/second order information about the dynamics holds great promise.<n>Main bottleneck in this research direction is the difficulty in obtaining useful gradients and Hessians.<n>This abstract proposes a method that can address the collision detection part of the puzzle in a manner that is smoothly differentiable and massively vectorizable.
  arXiv  Detail & Related papers  (2026-04-19T16:58:09Z)
• Tail-Aware Post-Training Quantization for 3D Geometry Models [58.79500829118265]
  Post-Training Quantization (PTQ) enables efficient inference without retraining.<n>PTQ fails to transfer effectively to 3D models due to intricate feature distributions and prohibitive calibration overhead.<n>We propose TAPTQ, a Tail-Aware Post-Training Quantization pipeline for 3D geometric learning.
  arXiv  Detail & Related papers  (2026-02-02T07:21:15Z)
• SO(3)-invariant PCA with application to molecular data [6.809315864458212]
  A naive approach requires augmenting the dataset with many rotated copies of each sample, incurring prohibitive computational costs.<n>We develop an efficient and principled framework for SO(3)-invariant PCA that implicitly accounts for all rotations without explicit data augmentation.<n>We validate the method on real-world molecular datasets, demonstrating its effectiveness and opening up new possibilities for large-scale, high-dimensional reconstruction problems.
  arXiv  Detail & Related papers  (2025-10-21T17:23:17Z)
• P3P Made Easy [14.46196444719236]
  We present a novel solution to the Perspective-Three-Point (P3P) problem.<n>Our method reformulates the problem into a quartic with coefficients that are analytically simple and computationally efficient.
  arXiv  Detail & Related papers  (2025-08-02T10:58:03Z)
• Transforming Datasets to Requested Complexity with Projection-based Many-Objective Genetic Algorithm [0.0]
  This work aims to increase the availability of datasets encompassing a diverse range of problem complexities.<n>For classification, a set of 10 complexity measures was used, while for regression tasks, 4 measures demonstrating promising optimization capabilities were selected.<n>Experiments confirmed that the proposed genetic algorithm can generate datasets with varying levels of difficulty.
  arXiv  Detail & Related papers  (2025-07-20T21:42:30Z)
• Equivariant amortized inference of poses for cryo-EM [5.141137421503899]
  cryo-EM is a vital technique for determining 3D structure of biological molecules such as proteins and viruses. The cryo-EM reconstruction problem is challenging due to the high noise levels, the missing poses of particles, and the computational demands of processing large datasets. A promising solution to these challenges lies in the use of amortized inference methods, which have shown particular efficacy in pose estimation for large datasets.
  arXiv  Detail & Related papers  (2024-06-01T11:36:29Z)
• ComboStoc: Combinatorial Stochasticity for Diffusion Generative Models [65.82630283336051]
  We show that the space spanned by the combination of dimensions and attributes is insufficiently sampled by existing training scheme of diffusion generative models. We present a simple fix to this problem by constructing processes that fully exploit the structures, hence the name ComboStoc.
  arXiv  Detail & Related papers  (2024-05-22T15:23:10Z)
• Amortized Inference for Causal Structure Learning [72.84105256353801]
  Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test. We train a variational inference model to predict the causal structure from observational/interventional data. Our models exhibit robust generalization capabilities under substantial distribution shift.
  arXiv  Detail & Related papers  (2022-05-25T17:37:08Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• Complexity Measures for Multi-objective Symbolic Regression [2.4087148947930634]
  Multi-objective symbolic regression has the advantage that while the accuracy of the learned models is maximized, the complexity is automatically adapted. We study which complexity measures are most appropriately used in symbolic regression when performing multi- objective optimization with NSGA-II.
  arXiv  Detail & Related papers  (2021-09-01T08:22:41Z)
• Fold2Seq: A Joint Sequence(1D)-Fold(3D) Embedding-based Generative Model for Protein Design [70.27706384570723]
  We propose Fold2Seq, a novel framework for designing protein sequences conditioned on a specific target fold. We show improved or comparable performance of Fold2Seq in terms of speed, coverage, and reliability for sequence design. The unique advantages of fold-based Fold2Seq, in comparison to a structure-based deep model and RosettaDesign, become more evident on three additional real-world challenges.
  arXiv  Detail & Related papers  (2021-06-24T14:34:24Z)
• Analysis of Truncated Orthogonal Iteration for Sparse Eigenvector Problems [78.95866278697777]
  We propose two variants of the Truncated Orthogonal Iteration to compute multiple leading eigenvectors with sparsity constraints simultaneously. We then apply our algorithms to solve the sparse principle component analysis problem for a wide range of test datasets.
  arXiv  Detail & Related papers  (2021-03-24T23:11:32Z)
• Isometric Multi-Shape Matching [50.86135294068138]
  Finding correspondences between shapes is a fundamental problem in computer vision and graphics. While isometries are often studied in shape correspondence problems, they have not been considered explicitly in the multi-matching setting. We present a suitable optimisation algorithm for solving our formulation and provide a convergence and complexity analysis.
  arXiv  Detail & Related papers  (2020-12-04T15:58:34Z)

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.