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

114227341454 · Jun 202019922001200920172026
48 results for biological sequence design

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.

P3BO optimizes biological sequence design by combining multiple methods.

problem Variability in performance of black-box optimization methods for biological sequence design.
method Population-Based Black-Box Optimization (P3BO) that samples sequences from an ensemble of methods, weighting by past performance.
result P3BO outperforms individual methods, proposing higher quality and more diverse sequences.

LaMBO optimizes biological sequences using autoencoders and Bayesian optimization.

problem Bayesian optimization for drug design is limited by discrete, high-dimensional decision variables.
method Jointly trains denoising autoencoder with a Gaussian process head for gradient-based optimization in latent space.
result LaMBO outperforms genetic optimizers and requires no large pretraining corpus.

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.

Paper uses transfer learning and Bayesian optimization to reduce DNA sequence design experiments.

problem Designing many similar DNA sequences for specific applications is expensive and time-consuming.
method Combines transfer learning with Bayesian optimization to reduce experiment count.
result Total number of experiments can be significantly reduced by sharing information between tasks.

Unified approach for sequence design combining likelihood-free inference and black-box optimization.

problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.

A faster method for optimizing DNA and protein sequences using machine learning.

problem Designing DNA and protein sequences with improved function.
method Activation maximization with a straight-through approximation and adaptive entropy variable.
result Fast SeqProp achieves up to 100-fold faster convergence and improved fitness optima.

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.

New tools evaluate and optimize conditional sequence models in bioinformatics.

problem Evaluating and optimizing conditional sequence models in bioinformatics.
method Kernel-based discrepancy measure (ACMMD) to estimate model fit and tune hyperparameters.
result Rejects the hypothesis that ProteinMPNN fits its data for various protein families and optimizes model temperature.

We address the problem of synthetic gene design using Bayesian optimization. The main issue when designing a gene is that the design space is defined in terms of long strings of characters of different lengths, which renders the optimization intractable. We propose a three-step approach to deal with this issue. First, …

2015-05-07abs ↗pdf ↗

Protein modeling is an increasingly popular area of machine learning research. Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standardized evaluation tec…

2019-06-19abs ↗pdf ↗

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.

The study compares different scRNA sequencing methods using a high-dimensional dataset.

problem To identify unique characteristics of different scRNA sequencing methods.
method Quantitative comparison through clustering analysis of a high-dimensional dataset.
result Identifies unique characteristics associated with different scRNA sequencing methods.

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.

Study connects Gaussian processes and regularization for sequence-function mappings.

problem Understanding and interpreting sequence-function maps in biology.
method Relates Gaussian process priors, regularization, and gauge fixing in overparameterized weight space.
result Established the relationship between regularized regression and Gaussian processes in function space.

Biological research often involves testing a growing number of null hypotheses as new data is accumulated over time. We study the problem of online control of the familywise error rate (FWER), that is testing an apriori unbounded sequence of hypotheses (p-values) one by one over time without knowing the future, such th…

2019-10-10abs ↗pdf ↗

Robust machine learning models improve DNA regulatory sequence prediction under various shifts.

problem Real-world applications of DNA regulatory sequence prediction involve shifts not captured by standard i.i.d. assumptions.
method Introduces a robustness framework combining simulation benchmarks and real data analysis.
result Models remain accurate and calibrated under mild shifts but show higher error and miscalibration under strong shifts.

BRAID fine-tunes diffusion models to optimize reward models in offline scenarios.

problem Combining generative modeling and model-based optimization in offline scenarios.
method Conservative fine-tuning of diffusion models using RL to optimize reward models.
result BRAID outperforms existing methods in offline data, avoiding invalid designs.

Substring kernels are classical tools for representing biological sequences or text. However, when large amounts of annotated data are available, models that allow end-to-end training such as neural networks are often preferred. Links between recurrent neural networks (RNNs) and substring kernels have recently been dra…

2019-06-07abs ↗pdf ↗

Optimal transport embedding learns feature sets efficiently.

problem Learning on sets of features with long-range dependencies and few labeled data.
method Parametrized fixed-size embedding that aggregates features according to optimal transport plan.
result Achieves state-of-the-art results on protein fold recognition and chromatin profiles.

This study benchmarks transcriptomics models for perturbation analysis, finding scVI and PCA superior.

problem Limited evaluation of transcriptomics foundation models for perturbation analysis.
method Developed a novel evaluation framework using diverse public datasets from different sequencing techniques and cell lines.
result scVI and PCA identified as superior models for understanding biological perturbations.

Optimizes biomanufacturing processes with a new digital twin calibration method.

problem Lack of interpretability and sample efficiency in traditional DoE methods.
method Developed a computational approach to calibrate Bio-SoS digital twin model.
result Guides sample-efficient and interpretable DoEs by quantifying sub-model parameter estimation errors.

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.

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.

Two ML frameworks predict antibody properties using structural data.

problem Predicting antibody properties using sequence and structural data.
method ANTIPASTI and INFUSSE models using graph representations and neural networks.
result ANTIPASTI predicts binding affinity; INFUSSE predicts residue flexibility.

Stem uses diffusion models to infer gene expression from H&E images.

problem Inference of gene expression from H&E stained images is time-consuming and expensive.
method Conditional diffusion generative model to infer gene expression.
result Stem achieves state-of-the-art performance in spatial gene expression prediction.

Given a finite sequence of graphs, e.g., coming from technological, biological, and social networks, the paper proposes a methodology to identify possible changes in stationarity in the stochastic process generating the graphs. In order to cover a large class of applications, we consider the general family of attribute…

2018-05-18abs ↗pdf ↗