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,742 papers · 148 categories

Trend · papers per month

4793140186 · Jun 202019922001200920172026
48 results for synthetic 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.

CHANI learns classification tasks with local transformations inspired by biology.

problem Proving neural networks can learn classification tasks with local transformations.
method CHANI uses spiking neurons modeled by Hawkes processes with expert aggregation for local learning.
result CHANI can learn and encode multiple classes, forming assemblies of neurons.

Active learning selects optimal measurement times for inferring continuous paths from sparse data.

problem Inferring continuous probability paths from sparse snapshots in high-fidelity domains like single-cell biology.
method Extends active experimentation to the space of measures using Linearized Optimal Transport (LOT) for probabilistic surrogate modeling.
result Empirical results show that the proposed strategy outperforms uncertainty-agnostic baselines.

SyNGLER generates synthetic networks efficiently while preserving key structural properties.

problem Efficiently generating realistic synthetic networks with preserved structural properties.
method SyNGLER uses latent space network models to learn and reconstruct node embeddings, then generates synthetic networks.
result SyNGLER produces synthetic networks that better preserve key network characteristics than existing approaches.

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.

When learning a hidden Markov model (HMM), sequen- tial observations can often be complemented by real-valued summary response variables generated from the path of hid- den states. Such settings arise in numerous domains, includ- ing many applications in biology, like motif discovery and genome annotation. In this pape…

2015-12-16abs ↗pdf ↗

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 many applications of finance, biology and sociology, complex systems involve entities interacting with each other. These processes have the peculiarity of evolving over time and of comprising latent factors, which influence the system without being explicitly measured. In this work we present latent variable time-va…

2018-02-12abs ↗pdf ↗

Likelihood-free methods are an established approach for performing approximate Bayesian inference for models with intractable likelihood functions. However, they can be computationally demanding. Bayesian synthetic likelihood (BSL) is a popular such method that approximates the likelihood function of the summary statis…

2019-09-11abs ↗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.

Estimates support in distributions with sampling artifacts and errors.

problem Support estimation in the presence of sampling artifacts and errors.
method Regularized weighted Chebyshev approximations with Touchard polynomials, discretized semi-infinte programming.
result Significant improvements over noiseless support estimation methods.

We study the sample complexity of learning a high-dimensional simplex from a set of points uniformly sampled from its interior. Learning of simplices is a long studied problem in computer science and has applications in computational biology and remote sensing, mostly under the name of `spectral unmixing'. We theoretic…

2018-10-18abs ↗pdf ↗

Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in comparison to SVMs trained on conventional computers. The method is applied to both synth…

2019-06-14abs ↗pdf ↗

Normalizing flow regression approximates posterior distributions without additional sampling.

problem Bayesian inference with computationally expensive likelihood evaluations.
method Normalizing flow regression (NFR) for offline inference.
result NFR yields a tractable posterior approximation through regression on existing log-density evaluations.

The paper presents a new method to represent directed graphs using pseudo-Riemannian manifolds.

problem Representing directed graphs in a compact and meaningful way.
method Combines pseudo-Riemannian metric structure, non-trivial global topology, and a unique likelihood function.
result Low-dimensional cylindrical Minkowski and anti-de Sitter spacetimes produce equal or better graph representations than curved Riemannian manifolds.

We introduce a new method for estimating the support size of an unknown distribution which provably matches the performance bounds of the state-of-the-art techniques in the area and outperforms them in practice. In particular, we present both theoretical and computer simulation results that illustrate the utility and p…

2019-01-22abs ↗pdf ↗

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.

Generative Distribution Embeddings learn multiscale representations of distributions.

problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.

Reconstruction of structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted towards developing universal…

2016-12-15abs ↗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.