GENEOnet: A new machine learning paradigm based on Group Equivariant
Non-Expansive Operators. An application to protein pocket detection
- URL: http://arxiv.org/abs/2202.00451v1
- Date: Mon, 31 Jan 2022 11:14:51 GMT
- Title: GENEOnet: A new machine learning paradigm based on Group Equivariant
Non-Expansive Operators. An application to protein pocket detection
- Authors: Giovanni Bocchi, Patrizio Frosini, Alessandra Micheletti, Alessandro
Pedretti, Carmen Gratteri, Filippo Lunghini, Andrea Rosario Beccari, Carmine
Talarico
- Abstract summary: We introduce a new computational paradigm based on Group Equivariant Non-Expansive Operators.
We test our method, called GENEOnet, on a key problem in drug design: detecting pockets on the surface of proteins that can host.
- Score: 97.5153823429076
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Nowadays there is a big spotlight cast on the development of techniques of
explainable machine learning. Here we introduce a new computational paradigm
based on Group Equivariant Non-Expansive Operators, that can be regarded as the
product of a rising mathematical theory of information-processing observers.
This approach, that can be adjusted to different situations, may have many
advantages over other common tools, like Neural Networks, such as: knowledge
injection and information engineering, selection of relevant features, small
number of parameters and higher transparency. We chose to test our method,
called GENEOnet, on a key problem in drug design: detecting pockets on the
surface of proteins that can host ligands. Experimental results confirmed that
our method works well even with a quite small training set, providing thus a
great computational advantage, while the final comparison with other
state-of-the-art methods shows that GENEOnet provides better or comparable
results in terms of accuracy.
Related papers
- A novel approach to graph distinction through GENEOs and permutants [0.0]
This paper explores the use of GENEOs for distinguishing $r$-regular graphs up to isomorphisms.
Our experiments show that GENEOs offer a good compromise between efficiency and computational cost in comparing $r$-regular graphs.
GENEOs could be a general-purpose approach to discriminative problems in Machine Learning.
arXiv Detail & Related papers (2024-06-12T09:53:14Z) - Inducing Gaussian Process Networks [80.40892394020797]
We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points.
The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains.
We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
arXiv Detail & Related papers (2022-04-21T05:27:09Z) - Using Genetic Programming to Predict and Optimize Protein Function [65.25258357832584]
We propose POET, a computational Genetic Programming tool based on evolutionary methods to enhance screening and mutagenesis in Directed Evolution.
As a proof-of-concept we use peptides that generate MRI contrast detected by the Chemical Exchange Saturation Transfer mechanism.
Our results indicate that a computational modelling tool like POET can help to find peptides with 400% better functionality than used before.
arXiv Detail & Related papers (2022-02-08T18:08:08Z) - Group invariant machine learning by fundamental domain projections [0.5156484100374058]
We approach the well-studied problem of supervised group invariant and equivariant machine learning from the point of view of geometric topology.
We propose a novel approach using a pre-processing step, which involves projecting the input data into a geometric space.
This new data can then be the input for an arbitrary machine learning model.
arXiv Detail & Related papers (2022-02-04T14:45:57Z) - Combinatorial optimization and reasoning with graph neural networks [7.8107109904672365]
Combinatorial optimization is a well-established area in operations research and computer science.
Recent years have seen a surge of interest in using machine learning, especially graph neural networks (GNNs) as a key building block for tasks.
arXiv Detail & Related papers (2021-02-18T18:47:20Z) - Learning outside the Black-Box: The pursuit of interpretable models [78.32475359554395]
This paper proposes an algorithm that produces a continuous global interpretation of any given continuous black-box function.
Our interpretation represents a leap forward from the previous state of the art.
arXiv Detail & Related papers (2020-11-17T12:39:44Z) - Malicious Network Traffic Detection via Deep Learning: An Information
Theoretic View [0.0]
We study how homeomorphism affects learned representation of a malware traffic dataset.
Our results suggest that although the details of learned representations and the specific coordinate system defined over the manifold of all parameters differ slightly, the functional approximations are the same.
arXiv Detail & Related papers (2020-09-16T15:37:44Z) - A Trainable Optimal Transport Embedding for Feature Aggregation and its
Relationship to Attention [96.77554122595578]
We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference.
Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
arXiv Detail & Related papers (2020-06-22T08:35:58Z) - Stochastic Flows and Geometric Optimization on the Orthogonal Group [52.50121190744979]
We present a new class of geometrically-driven optimization algorithms on the orthogonal group $O(d)$.
We show that our methods can be applied in various fields of machine learning including deep, convolutional and recurrent neural networks, reinforcement learning, flows and metric learning.
arXiv Detail & Related papers (2020-03-30T15:37:50Z)
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.