Searcharxiv⌕ Search

arXiv subjects

Baris Coskunuzer

Publications and source records attributed to Baris Coskunuzer.

At least 37 records · Page 2Linked to original sources

ToDD: Topological Compound Fingerprinting in Computer-Aided Drug Discovery

In computer-aided drug discovery (CADD), virtual screening (VS) is used for identifying the drug candidates that are most likely to bind to a molecular target in a large library of compounds. Most VS methods to date have focused on using canonical compound representations (e.g., SMILES strings, Morgan fingerprints) or generating alternative fingerprints of the compounds by training progressively more complex variational autoencoders (VAEs) and graph neural networks (GNNs). Although VAEs and GNNs led to significant improvements in VS performance, these methods suffer from reduced performance when scaling to large virtual compound datasets. The performance of these methods has shown only incremental improvements in the past few years. To address this problem, we developed a novel method using multiparameter persistence (MP) homology that produces topological fingerprints of the compounds as multidimensional vectors. Our primary contribution is framing the VS process as a new topology-based graph ranking problem by partitioning a compound into chemical substructures informed by the periodic properties of its atoms and extracting their persistent homology features at multiple resolution levels. We show that the margin loss fine-tuning of pretrained Triplet networks attains highly competitive results in differentiating between compounds in the embedding space and ranking their likelihood of becoming effective drug candidates. We further establish theoretical guarantees for the stability properties of our proposed MP signatures, and demonstrate that our models, enhanced by the MP signatures, outperform state-of-the-art methods on benchmark datasets by a wide and highly statistically significant margin (e.g., 93% gain for Cleves-Jain and 54% gain for DUD-E Diverse dataset).

cs.LG↗

Geometric Approaches on Persistent Homology

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, we analyze the power filtration on unweighted graphs, and provide explicit bounds for the life spans of homology classes in persistence diagrams in all dimensions.

math.AT↗

Topological Relational Learning on Graphs

Graph neural networks (GNNs) have emerged as a powerful tool for graph classification and representation learning. However, GNNs tend to suffer from over-smoothing problems and are vulnerable to graph perturbations. To address these challenges, we propose a novel topological neural framework of topological relational inference (TRI) which allows for integrating higher-order graph information to GNNs and for systematically learning a local graph structure. The key idea is to rewire the original graph by using the persistent homology of the small neighborhoods of nodes and then to incorporate the extracted topological summaries as the side information into the local algorithm. As a result, the new framework enables us to harness both the conventional information on the graph structure and information on the graph higher order topological properties. We derive theoretical stability guarantees for the new local topological representation and discuss their implications on the graph algebraic connectivity. The experimental results on node classification tasks demonstrate that the new TRI-GNN outperforms all 14 state-of-the-art baselines on 6 out 7 graphs and exhibit higher robustness to perturbations, yielding up to 10\% better performance under noisy scenarios.

cs.LG↗

Smart Vectorizations for Single and Multiparameter Persistence

The machinery of topological data analysis becomes increasingly popular in a broad range of machine learning tasks, ranging from anomaly detection and manifold learning to graph classification. Persistent homology is one of the key approaches here, allowing us to systematically assess the evolution of various hidden patterns in the data as we vary a scale parameter. The extracted patterns, or homological features, along with information on how long such features persist throughout the considered filtration of a scale parameter, convey a critical insight into salient data characteristics and data organization. In this work, we introduce two new and easily interpretable topological summaries for single and multi-parameter persistence, namely, saw functions and multi-persistence grid functions, respectively. Compared to the existing topological summaries which tend to assess the numbers of topological features and/or their lifespans at a given filtration step, our proposed saw and multi-persistence grid functions allow us to explicitly account for essential complementary information such as the numbers of births and deaths at each filtration step. These new topological summaries can be regarded as the complexity measures of the evolving subspaces determined by the filtration and are of particular utility for applications of persistent homology on graphs. We derive theoretical guarantees on the stability of the new saw and multi-persistence grid functions and illustrate their applicability for graph classification tasks.

cs.LG↗

Minimal Surfaces in H^2xR

We give a fairly complete solution to the asymptotic Plateau Problem for minimal surfaces in H^2xR. In particular, we identify the collection of finite Jordan curves in the asymptotic cylinder which bounds a minimal surface in H^2xR.

math.DG↗

Asymptotic Plateau Problem in H2xR

We give a fairly complete solution to the asymptotic Plateau Problem for area minimizing surfaces in H2xR. In particular, we identify the collection of Jordan curves in the asymptotic boundary of H2xR, which bounds an area minimizing surface in H2xR. Furthermore, we study the similar problem for minimal surfaces, and show that the situation is highly different.

math.DG↗

Embedded $H$-Planes in Hyperbolic 3-Space

We show that for any C^0 Jordan curve C in the sphere at infinity of H^3, there exists an embedded $H$-plane P_H in H^3 with asymptotic boundary C for any H in (-1,1). As a corollary, we proved that any quasi-Fuchsian hyperbolic 3-manifold M=SxR contains an H-surface S_H in the homotopy class of the core surface S for any H in (-1,1). We also proved that for any C^1 Jordan curve J in the sphere at infinity, there exists a unique minimizing H-plane P_H with asymptotic boundary J for a generic H in (-1,1).

math.DG↗

Embeddedness of the solutions to the H-Plateau Problem

We generalize Meeks and Yau's embeddedness result on the solutions of the Plateau problem to the constant mean curvature disks. We show that any minimizing H-disk in an H_0-convex domain is embedded for any H in [0,H_0). In particular, for the unit ball B in R^3, this implies that for any H in [0,1], any Jordan curve in the unit sphere bounds an embedded H-disk in B.

math.DG↗

$H$-Surfaces with Arbitrary Topology in Hyperbolic 3-Space

In this paper, we show that any open orientable surface S can be properly embedded in H^3 as a minimizing H-surface for any 0<=H<1. We obtained this result by proving a version of the bridge principle at infinity for H-surfaces. We also show that any open orientable surface S can be nonproperly embedded in H^3 as a minimal surface, too.

math.DG↗