Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

123245368490 · May 202619922001200920172026
48 results for biological structures

DeepSIBA predicts biological effects of chemical structures using graph neural networks.

problem Predicting biological effects of chemical structures for drug discovery.
method Siamese Graph Convolutional Neural Networks for structure-biological effect mapping.
result Highly accurate predictions of biological effects for structurally dissimilar compounds.

PGEL learns embeddings to diversify protein motifs while maintaining biological function.

problem Generating diverse protein structures while preserving biological function.
method Embedding learning framework that enhances motif diversity in a diffusion model's frozen denoiser.
result PGEL achieves greater structural diversity, better designability, and improved self-consistency compared to partial diffusion.

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

problem Challenges in applying machine learning to biological sequences, including unreliable methods.
method Theoretical analysis and development of modified kernels to ensure reliability and accuracy.
result Developed kernels that are universal, characteristic, and metrize the space of distributions for biological sequences.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

Researchers create exact minimal surfaces with helical motifs in biological structures.

problem Analyzing helical motifs in minimal surfaces of biological structures.
method Developed a method to construct exact minimal surfaces with arbitrary helical motifs.
result Exact minimal surfaces with helical motifs can be created and analyzed.

Proposes a novel network-based neighborhood regression for biological systems.

problem Lack of comprehensive analysis on biological modules using both global and local network data.
method Develops a community-wise least square optimization approach to analyze gene modules and their regulatory strength.
result Achieves exact minimax optimality and linear consistency in identifying gene module associations.

Recent years have witnessed a trend that advanced mathematical tools, such as algebraic topology, differential geometry, graph theory, and partial differential equations, have been developed for describing biological macromolecules. These tools have considerably strengthened our ability to understand the molecular mech…

2019-08-01abs ↗pdf ↗

While neural networks are powerful approximators used to classify or embed data into lower dimensional spaces, they are often regarded as black boxes with uninterpretable features. Here we propose Graph Spectral Regularization for making hidden layers more interpretable without significantly impacting performance on th…

2018-09-30abs ↗pdf ↗

New learning rules from information bottleneck improve deep learning without precise labels.

problem Training deep neural networks with backpropagation is biologically implausible.
method Kernelized information bottleneck principle with 3-factor Hebbian structure.
result The new learning rules perform nearly as well as backpropagation on image classification tasks.

By and large, Backpropagation (BP) is regarded as one of the most important neural computation algorithms at the basis of the progress in machine learning, including the recent advances in deep learning. However, its computational structure has been the source of many debates on its arguable biological plausibility. In…

2018-08-21abs ↗pdf ↗

MIK improves t-SNE's local structure preservation in biological sequence data.

problem Efficiently preserving local structure in high-dimensional biological sequence data.
method Modified Isolation Kernel (MIK) using adaptive density estimation.
result MIK preserves local and global structure better than Gaussian and isolation kernels.

BaGGLS models biological interactions using Bayesian shrinkage for interpretability.

problem Interpreting complex interactions in high-dimensional biological data.
method Bayesian group global-local shrinkage prior with variational approximation.
result BaGGLS outperforms other methods in interaction detection and scalability.

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

Exclusive Group Lasso improves feature selection in correlated biological data.

problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.

In this paper, we propose a novel application of Generative Adversarial Networks (GAN) to the synthesis of cells imaged by fluorescence microscopy. Compared to natural images, cells tend to have a simpler and more geometric global structure that facilitates image generation. However, the correlation between the spatial…

2017-08-15abs ↗pdf ↗

In this publication, we combine two Bayesian non-parametric models: the Gaussian Process (GP) and the Dirichlet Process (DP). Our innovation in the GP model is to introduce a variation on the GP prior which enables us to model structured time-series data, i.e. data containing groups where we wish to model inter- and in…

2014-01-08abs ↗pdf ↗

New learning algorithm mimics biological neural networks.

problem Biologically implausible backpropagation for directed neural networks.
method Introduces new neuronal dynamics and learning rule for arbitrary architectures, sparsity-inducing pruning method, and dynamical-systems characterization.
result Prunes irrelevant connections and improves learning efficiency.

DASH simplifies neural networks for gene regulatory dynamics using domain knowledge.

problem Pruning neural networks for gene regulatory dynamics lacks biologically meaningful structure learning.
method DASH uses domain-specific structural information to guide network pruning, leading to sparser, better interpretable models.
result DASH outperforms general pruning methods in gene regulatory network inference, yielding deeper insights.

Modeling correlated mutations in cancer for personalized treatment.

problem Identifying mutations for personalized cancer therapy in heterogeneous profiles.
method Proposed correlated zero-inflated negative binomial process with mixed beta-Bernoulli and variational inference.
result Identified biologically relevant correlations between somatic mutations.

SENA-discrepancy-VAE interprets latent causal factors in biological pathways.

problem Interpreting latent causal factors in biological pathways.
method SENA-discrepancy-VAE, a model based on discrepancy-VAE, that produces interpretable latent causal factors.
result Sena-discrepancy-VAE achieves comparable predictive performance with non-interpretable counterparts while providing biologically meaningful causal factors.

Profiling cellular phenotypes from microscopic imaging can provide meaningful biological information resulting from various factors affecting the cells. One motivating application is drug development: morphological cell features can be captured from images, from which similarities between different drug compounds appli…

2017-11-02abs ↗pdf ↗

Scalable GPLVM reduces complexity in scRNA-seq data, accounting for technical and biological confounders.

problem Complexity and confounders in scRNA-seq data hamper interpretation.
method Extended Gaussian process latent variable model (GPLVM) to handle large datasets.
result Framework reconstructs latent signatures and captures disease-specific gene expression.

Efficiently models tree-like data with coupled branches using HMMs.

problem Modeling sequential data with coupled branches in biological systems.
method Developed a dynamic programming algorithm for tree-based HMMs with coupled branches.
result Efficiently solves likelihood, decoding, and parameter learning problems for tree-based HMMs with coupled branches.

We develop a latent variable model and an efficient spectral algorithm motivated by the recent emergence of very large data sets of chromatin marks from multiple human cell types. A natural model for chromatin data in one cell type is a Hidden Markov Model (HMM); we model the relationship between multiple cell types by…

2015-06-04abs ↗pdf ↗

Model captures system input variations in latent space for actionable dynamics.

problem Learning dynamical systems from data without prescribing a mathematical model.
method Structured latent ODE model with stochastic factors of variation for each input.
result Improves generation of time-series data and inference of system inputs over baselines.

AR algorithm simplifies backpropagation with improved scalability and biological plausibility.

problem Improving backpropagation algorithms for complex neural networks and biological plausibility.
method Introducing learnable backwards weights and avoiding nonlinear derivative computations; relaxing frozen feedforward pass assumption.
result Simplified AR algorithm maintains performance on complex CNN architectures and challenging datasets.

Bayesian Cox model identifies biomarkers from multi-omics data.

problem Produce interpretable survival prognosis from multi-omics data.
method Penalized semiparametric Bayesian Cox model with graph-structured selection priors.
result Model identifies new biomarkers and improves survival prediction.

We solve a lifecycle model in which the consumer's chronological age does not move in lockstep with calendar time. Instead, biological age increases at a stochastic non-linear rate in time like a broken clock that might occasionally move backwards. In other words, biological age could actually decline. Our paper is ins…

2018-11-25abs ↗pdf ↗

scICML integrates multi-omics data from single cells using co-clustering.

problem High noise and sparsity in multi-omics data from single cells.
method Information-theoretic co-clustering-based multi-view learning.
result Improves clustering performance and provides biological insights.

Algorithm optimizes biological sequences using bootstrapped training with a score-conditioned generator.

problem Optimizing biological sequences for a black-box score function.
method Bootstrapped training of score-conditioned generator (BootGen) algorithm.
result Our method outperforms competitive baselines on biological sequential design tasks.