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

77155232309 · Jun 202019922001200920172026
48 results for antibody design

Bayesian optimization of antibodies learns from immune system evolution.

problem Efficiently optimizing antibody sequences in a large space of possibilities.
method Bayesian optimization guided by a generative model of evolving antibody sequences.
result CloneBO optimizes antibodies more efficiently than previous methods.

AntBO optimizes antibody design using Bayesian optimization for efficient and effective CDRH3 sequence generation.

problem Designing optimal antigen-specific CDRH3 regions in antibody design due to combinatorial sequence space.
method Combinatorial Bayesian optimization framework with trust region for developability.
result AntBO designs CDRH3 regions with diverse biophysical properties and outperforms existing methods.

BOAT optimizes multiple antibody properties efficiently.

problem Balancing multiple drug-like properties in antibody design.
method Bayesian optimization framework coupling surrogate modeling and genetic algorithm.
result Competitive performance with state-of-the-art multi-objective protein optimization methods.

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.

AbDiffuser generates full-atom antibodies with sequence and structure fidelity.

problem Generating high-fidelity antibodies with both structure and sequence information.
method Equivariant and physics-informed diffusion model with novel protein structure representation.
result AbDiffuser generates antibodies with sequence and structural properties matching a reference set.

Antibodies are a critical part of the immune system, having the function of directly neutralising or tagging undesirable objects (the antigens) for future destruction. Being able to predict which amino acids belong to the paratope, the region on the antibody which binds to the antigen, can facilitate antibody design an…

2018-06-12abs ↗pdf ↗

K-Models clusters functional data with ordinal constraints for better interpretability.

problem Challenges in extracting meaningful insights from functional data due to lack of interpretability.
method Integrates ordinal constraints into clustering to improve interpretability and structure identification.
result Enhances interpretability of clustering results while maintaining performance.

Estimates vaccine effectiveness and immune correlates in TND studies with missing data.

problem Confounding and missing data in TND studies of vaccine effectiveness and immune correlates.
method Targeted maximum likelihood estimation using a semiparametric logistic regression model.
result Valid causal inference of vaccine effectiveness and immune correlates in TND studies with missing exposure data.

New method combines regional HIV prevention trial data without sharing individual patient info.

problem Regional differences in HIV prevention efficacy, privacy concerns, and data sharing limitations.
method Federated learning approach that combines site-specific estimators via L1-regularization.
result Improved precision in estimating region-specific survival curves.

Improved GAN performance using higher-order Wasserstein moments.

problem Stabilizing and enhancing GANs for better mode coverage and stability.
method Deriving and training a GAN with a modified Wasserstein distance using higher-order moments.
result Training a GAN with higher-order Wasserstein moments improves performance, even with increased computational cost.

Branching Flows generates sequences of varying lengths using binary trees.

problem Generating sequences of unknown lengths or fixed elements.
method A generative modeling framework that evolves states over binary trees, controlling sequence length.
result Branching Flows can generate sequences of varying lengths and mix different types of state spaces.

Proposes a framework to assess feature importance without algorithm constraints.

problem Lack of a general framework for assessing feature importance across different algorithms.
method Develops a nonparametric framework for algorithm-agnostic variable importance assessment.
result Valid confidence intervals and testing strategies for variable importance.

A framework for faster, better infographic design by non-experts and experts alike.

problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.

The paper proposes a method to reliably select design algorithms for machine learning-guided design tasks.

problem Choosing the right design algorithm for machine learning-guided design tasks.
method Combining designs' predicted property values with held-out labeled data to reliably forecast characteristics of the label distributions produced by different design algorithms.
result The method is guaranteed to return design algorithms that yield successful label distributions.

We propose a new low-cost machine-learning-based methodology which assists designers in reducing the gap between the problem and the solution in the design process. Our work applies reinforcement learning (RL) to find the optimal task-oriented design solution through the construction of the design action for each task.…

2019-03-13abs ↗pdf ↗

MO-PaDGAN generates diverse, high-performance designs with multiple metrics.

problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

PaDGAN generates diverse, high-quality designs with improved performance.

problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.

ANN with GA optimizes flexible disc design for lower mass and stress.

problem Design flexible disc elements for lower mass and stress without compromising torque transmission and misalignment.
method Artificial Neural Network (ANN) coupled with Genetic Algorithm (GA) for design exploration.
result Optimized designs meet specified criteria with minimum mass and stress.

New method for mixed-variable GSA improves material design efficiency.

problem Designing materials with both quantitative and qualitative variables.
method Integrates LVGP with Sobol' analysis for mixed-variable GSA.
result Accelerates exploration of novel MOF candidates in combinatorial design spaces.

Efficient deep learning computing requires algorithm and hardware co-design to enable specialization: we usually need to change the algorithm to reduce memory footprint and improve energy efficiency. However, the extra degree of freedom from the algorithm makes the design space much larger: it's not only about designin…

2019-04-24abs ↗pdf ↗

DAD learns to design experiments quickly, outperforming traditional methods.

problem Real-time decision-making in sequential Bayesian experimental design.
method Amortized design network trained with contrastive information bounds.
result DAD outperforms alternative strategies on various problems.

Enhances scenario approach for certifying design properties post-design.

problem Certifying additional useful properties in designs not considered during the design phase.
method Two-level framework of appropriateness: baseline and post-design. Distribution-free upper bounds on risk derived.
result Distribution-free upper bounds on the risk of failing to meet post-design appropriateness.

MO-PaDGAN improves multi-objective optimization by generating diverse and high-performing designs.

problem Challenges in parameterizing engineering designs for multi-objective optimization.
method MO-PaDGAN uses a generative adversarial network with a Determinantal Point Processes loss function to address these challenges.
result MO-PaDGAN generates designs with improved performance and coverage, even surpassing training data.

Generative thermal design learns optimal shapes using multi-agent reinforcement learning.

problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.

Paper proposes NASAIC framework for co-designing neural architectures and heterogeneous ASICs.

problem Designing efficient neural architectures and ASICs for multiple tasks.
method Build ASIC templates and propose NASAIC framework for simultaneous design of architectures and ASICs.
result NASAIC ensures design specifications and maximizes accuracy with minimal performance loss.

Adaptive designs achieve strong Neyman regret guarantees for ATE estimation.

problem Estimating unbiased average treatment effect in sequential experiments.
method Proposed adaptive designs with O~(logT)\widetilde{O}(\log T) Neyman regret under boundedness assumptions and O~(T)\widetilde{O}(\sqrt{T}) multigroup Neyman regret in covariate-based settings.
result Adaptive designs outperform non-adaptive designs in terms of Neyman regret, especially in covariate-based settings.

iDAD uses neural networks to quickly adapt experiments without likelihoods.

problem Performing adaptive experiments in real-time with implicit models.
method iDAD learns a design policy network upfront to make quick design decisions.
result iDAD can make design decisions in milliseconds, unlike traditional BOED approaches.

Unified framework for combinatorial and rounding algorithms in experimental design.

problem Designing and analyzing combinatorial and rounding algorithms for experimental design problems.
method Local search framework for combinatorial algorithms and regret minimization framework for rounding algorithms.
result Unified approach to match and improve all known results in D/A/E-design and obtain new results in unknown settings.

A new method achieves optimal uniformity in designs with minimal flexibility.

problem Achieving optimal uniformity in designs with minimal flexibility.
method Derive a lower bound on the uniformity constant and use a greedy construction to achieve this bound, then extend the scheme for more flexibility.
result A simple greedy construction achieves the optimal uniformity constant.

RID-Noise improves robust design under noisy conditions using neural networks.

problem Design robustness under noisy environments.
method Robust Inverse Design under Noise (RID-Noise) using conditional invertible neural networks (cINNs).
result RID-Noise achieves more effective robust design compared to state-of-the-art methods.

Dataset of 4500 bicycle designs aids in design analysis and synthesis.

problem Identify gaps in bicycle market and design space, classify bicycles, synthesize new designs.
method Processed dataset, unsupervised dimensionality reduction, supervised classification, machine learning synthesis.
result Identified design parameters and factors influencing bicycle classification.

Layout design with complex constraints is a challenging problem to solve due to the non-uniqueness of the solution and the difficulties in incorporating the constraints into the conventional optimization-based methods. In this paper, we propose a design method based on the recently developed machine learning technique,…

2018-06-07abs ↗pdf ↗