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.

169,051 papers · 148 categories

Trend · papers per month

2.5%5.0%7.5%10.0% · Jan 199519922001200920182026
48 results for biological context

Extracts biological context from biomedical texts to associate with events.

problem Identifying biological context and associating it with biochemical events in texts.
method Analyzed an annotated corpus and developed classifiers using syntactic, distance, and frequency features.
result Developed and evaluated classifiers for context-event association.

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.

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.

Hexnet framework enhances image processing with hexagonal structures.

problem Improve image processing systems with biological-inspired hexagonal structures.
method Develops a hexagonal deep learning framework (Hexnet) for image processing.
result Hexnet surpasses current hexagonal image processing systems and artificial neural networks.

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.

Automated tests detect interactions in unstructured data.

problem Detecting interactions between latent variables in low-dimensional systems.
method Derive two interaction tests based on pairwise interventions and integrate them into an active learning pipeline.
result Tests can identify more known biological interactions than random search and standard active learning baselines.

engGNN combines external and generated graphs to improve disease classification and biomarker discovery.

problem Challenges in integrating omics data due to high dimensionality and small sample sizes.
method Dual-graph framework that integrates external biological networks with data-driven generated graphs.
result engGNN outperforms state-of-the-art methods in disease classification and biomarker discovery.

Proposes CCCVAE for better single-cell clustering with cell-cell communication.

problem Improving single-cell RNA sequencing clustering by incorporating cell-cell communication.
method Integrates cell-cell communication into a variational autoencoder framework.
result Empirical results show CCCVAE outperforms standard VAEs in clustering performance.

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.

A neural network learns word-referent associations across various contexts.

problem Learning word-referent associations in different contexts.
method A biologically inspired multi-layered architecture that takes images and phonemes as input, builds representations, and adjusts prototypes based on current context.
result The model achieves up to 78% accuracy in ambiguous situations and mimics human learning patterns.

PepCVAE designs novel antimicrobial peptides using a semi-supervised VAE.

problem Designing novel antimicrobial peptides for next-generation antimicrobial resistance solutions.
method Semi-supervised variational autoencoder (VAE) model that learns latent and antimicrobial attribute spaces from unlabeled and labeled data.
result PepCVAE generates novel AMPs with higher long-range diversity and closer to biological peptide distribution.

Study adapts AI research methods to analyze image augmentation impacts on neural network operations.

problem Understanding how image augmentation affects neural network performance and sensitivity.
method Adapted treatment-control paradigm, uses variance decomposition, Sobol indices, and Shapley values for sensitivity analysis.
result Visualizes and quantifies sensitivity to different image augmentation parameters.

New methods learn causal networks from high-dimensional time series data.

problem Understanding complex dynamic systems with limited data and knowledge.
method Combination of Gaussian processes and abstract network modeling.
result Learn causal relations and synthesize causal networks from high-dimensional time series data.

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.

Skip connections improve biologically-inspired learning rules.

problem Biologically-inspired learning rules often underperform compared to backpropagation.
method Introduced skip connections between intermediate layers in biologically-motivated learning rules.
result Skip connections can match the performance of backpropagation and are robust to hyper-parameters.

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.

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.

New neural network learns adaptive behaviors inspired by neuromodulation.

problem Current AI lacks the ability to adapt to changing environments.
method Inspired by cellular neuromodulation, a new deep neural network architecture is designed.
result Neuromodulation-based networks improve adaptation in meta-reinforcement learning tasks.

NESS improves neighbor embedding for smooth cell-state transitions in single-cell data.

problem Challenges in extracting smooth, low-dimensional representations from noisy single-cell data.
method Builds on PCS framework to develop NESS, a stable machine learning approach.
result NESS consistently yields useful biological insights across diverse single-cell datasets.

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.

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.

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.

Study identifies cancer genes through graph anomaly analysis of protein interactions.

problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.

TransST improves spatial transcriptomics data analysis by identifying cell clusters and biomarkers.

problem Low resolution and insufficient sequencing depth in spatial transcriptomics data.
method Transfer learning framework to adaptively leverage external cell-labeled information.
result TransST successfully identifies five biologically meaningful cell clusters and separates adipose tissues from connective issues.

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.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

Probabilistic graphical models (PGMs) have become a popular tool for computational analysis of biological data in a variety of domains. But, what exactly are they and how do they work? How can we use PGMs to discover patterns that are biologically relevant? And to what extent can PGMs help us formulate new hypotheses t…

2007-06-14abs ↗pdf ↗

METCC learns distances to control confounders in high-dimensional data.

problem Technical and biological confounders in high-dimensional biological data.
method Contrastive metric learning using a non-linear triplet network.
result METCC outperforms linear methods in classifying biological samples.

Improves prediction performance on biological data by controlling confounding factors.

problem Challenges in statistical learning due to confounding variables in biological data.
method ONION for removing confounding covariates and DANN for penalizing confounder information.
result Significant improvements in generalization performance on simulated and empirical patient data.

New learning rules for wide neural networks without backpropagation.

problem Training wide neural networks efficiently and without backpropagation.
method Input-weight alignment driven by gradient descent in the NTK regime.
result Biologically-motivated learning rules equivalent to backpropagation in wide networks.