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

265278104 · Jun 202019922001200920172026
48 results for shared biology

DECAT framework evaluates multimodal models for shared biology, detecting confounders and false positives.

problem Determining if multimodal models learn shared biology or just confounders.
method DECAT framework classifies multimodal representations into four diagnostic scenarios using null-referenced metrics.
result DECAT detects confounders and false positives in multimodal models, improving with larger cohorts and stronger representations.

New model captures complex relationships from experimental data.

problem Capturing intricate feature interactions in empirical data.
method Shape Arithmetic Expressions (SHAREs) combining GAMs and mathematical expressions.
result SHAREs model captures complex feature interactions.

Paper presents a method to align unpaired samples across different modalities.

problem Challenges in collecting paired samples for multimodal representation learning.
method Uses propensity score alignment based on Rubin's framework to estimate a common space for unpaired samples.
result Optimal transport matching significantly improves alignment in real-world data.

Motivated by an application in computational biology, we consider low-rank matrix factorization with {0,1}\{0,1\}-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared with other matrix factorization schemes, our problem is further complicated by a c…

2014-01-23abs ↗pdf ↗

Two simulation-based methods improve optimal sampling design in systems biology.

problem Optimal selection of sampling points for accurate parameter estimation in dynamical systems.
method E-optimal-ranking (EOR) and LSTM neural network-based methods.
result Simulation studies show the proposed methods outperform random selection and classical E-optimal design.

A scalable Bayesian inference method for mixed-effects models in systems biology.

problem Scalable Bayesian inference for complex hierarchical mixed-effects models in systems biology.
method Constructing amortized approximations of likelihood and posterior distributions, refined for each individual dataset.
result Our method is both fast and competitive in statistical accuracy compared to exact pseudomarginal Bayesian inference.

In the era of big data, analysts usually explore various statistical models or machine learning methods for observed data in order to facilitate scientific discoveries or gain predictive power. Whatever data and fitting procedures are employed, a crucial step is to select the most appropriate model or method from a set…

2018-10-22abs ↗pdf ↗

MNIST-Nd offers synthetic datasets to benchmark clustering across dimensions.

problem Clustering performance degrades with high-dimensional data.
method Training mixture variational autoencoders on MNIST to create synthetic datasets with varying latent dimensions.
result Leiden clustering algorithm is most robust as dimensionality grows.

hyperSBINN improves drug cardiosafety assessment by efficiently modeling cardiac action potentials.

problem Complexity and limited data in modeling cardiac effects of drugs.
method Combining meta-learning with SBINNs to solve parameterized cardiac action potential models.
result hyperSBINN outperforms traditional solvers in speed and accuracy for predicting APD90 values.

Bayesian network structure learning algorithms with limited data are being used in domains such as systems biology and neuroscience to gain insight into the underlying processes that produce observed data. Learning reliable networks from limited data is difficult, therefore transfer learning can improve the robustness …

2013-07-09abs ↗pdf ↗

BioBO optimizes gene perturbation design using Bayesian optimization with biological priors.

problem Efficient design of genomic perturbation experiments in drug discovery.
method Integrates Bayesian optimization with multimodal gene embeddings and enrichment analysis.
result Improves labeling efficiency by 25-40% and identifies top-performing perturbations more effectively.

Exploratory cancer drug studies test multiple tumor cell lines against multiple candidate drugs. The goal in each paired (cell line, drug) experiment is to map out the dose-response curve of the cell line as the dose level of the drug increases. We propose Bayesian Tensor Filtering (BTF), a hierarchical Bayesian model …

2019-06-10abs ↗pdf ↗

New algorithm optimizes matrix reordering for noisy disordered matrices.

problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.

COMRECGC finds common recourse for global counterfactual explanations in GNNs.

problem Finding common recourse for global counterfactual explanations in GNNs.
method Formalized the common recourse explanation problem and designed COMRECGC algorithm.
result COMRECGC outperforms strong baselines on four real-world graph datasets.

Understanding functional organization of genetic information is a major challenge in modern biology. Following the initial publication of the human genome sequence in 2001, advances in high-throughput measurement technologies and efficient sharing of research material through community databases have opened up new view…

2011-02-27abs ↗pdf ↗

Graphical modelling has a long history in statistics as a tool for the analysis of multivariate data, starting from Wright's path analysis and Gibbs' applications to statistical physics at the beginning of the last century. In its modern form, it was pioneered by Lauritzen and Wermuth and Pearl in the 1980s, and has si…

2012-10-14abs ↗pdf ↗

New method learns cell trajectories and network interactions from single-cell data.

problem Network inference in systems biology from steady-state data.
method Min-entropy estimation for stochastic dynamics, leveraging both temporal and perturbational data.
result Jointly learns cellular trajectories and network interactions.

DHRL learns interpretable features from visual data.

problem Limited use of deep learning in basic research for interpretable features.
method Generative model chaining, ladder network architecture, latent space regularization.
result DHRL generates disentangled hierarchical features from small datasets.

In this paper, we show how simple logistic growth that was studied intensively during the last 200 years in many domains of science could be extended in a rather simple way and with these extensions is capable to produce a collection of behaviors widely observed in an enormous number of real-life systems in Economics, …

2008-02-24abs ↗pdf ↗