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

Trend · papers per month

4693139185 · Jun 202019922001200920172026
48 results for pre-trained protein embedding

GEFA predicts drug-target affinity using graph neural networks.

problem Accurate prediction of drug-target interactions for rapid drug repurposing.
method GEFA (Graph Early Fusion Affinity) is a novel graph-in-graph neural network with attention mechanism.
result GEFA effectively models drug-target interactions, demonstrating the effectiveness of pre-trained protein embedding and nested graph representation.

Paper improves Tm prediction of protein fragments using sparsity and probabilistic models.

problem Improving accuracy of melting temperature prediction for protein fragments.
method Promoting sparsity in pre-trained transformer models and adopting probabilistic frameworks.
result Mean absolute error of 0.23C for predicting melting temperature.

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.

Inferring the structural properties of a protein from its amino acid sequence is a challenging yet important problem in biology. Structures are not known for the vast majority of protein sequences, but structure is critical for understanding function. Existing approaches for detecting structural similarity between prot…

2019-02-22abs ↗pdf ↗

Protein Thoughts interprets protein interactions with clear reasoning, improving prediction accuracy.

problem Lack of mechanistic justification in protein-protein interaction predictions.
method Interpretable search problem reformulation, hypothesis-guided entropy-regularized Tree-of-Thoughts search, embedding-space flow matching.
result Improves mean best-binder rank from 47.7 to 11.2 on SHS148k benchmark.

ProtTrans models predict protein features without evolutionary info.

problem Predicting protein features from amino acid sequences.
method Self-supervised deep learning on large protein datasets.
result ProtT5 embeddings outperform state-of-the-art for per-residue predictions.

Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches …

2017-06-07abs ↗pdf ↗

Automated protein structure prediction from cryo-EM data.

problem Challenging to build atomic models from cryo-EM densities without prior structure.
method Uses GCN and LSTM to automate model building from amino acid identities and candidate locations.
result Automated approach reduces time and eliminates human intervention for protein structure determination.

Many applications of machine learning require a model to make accurate pre-dictions on test examples that are distributionally different from training ones, while task-specific labels are scarce during training. An effective approach to this challenge is to pre-train a model on related tasks where data is abundant, and…

2019-05-29abs ↗pdf ↗

New Performer model tackles long-sequence protein modeling.

problem Challenges of training complex Transformer models for long sequences.
method Linearly scalable long-context Transformer architecture, Performer.
result Performer provides strong theoretical guarantees and is effective for protein sequence modeling.

Paper provides conditions for reliable use of pre-trained embeddings in econometrics.

problem Uncertainty in using pre-trained embeddings for econometric tasks.
method Derives sufficient conditions and convergence rates for machine learning models with pre-trained embeddings.
result Establishes theoretical foundations for reliable use of pre-trained embeddings in econometrics.

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that 97% of proteins are, however, classified as unknots when intra-chain interaction…

2019-12-19abs ↗pdf ↗

Persistent homology provides a new, efficient molecular descriptor for protein dynamics.

problem Designing effective molecular descriptors for high-dimensional MD trajectories.
method Introduced masked Flood complex, a protein-tailored modification of simplicial complexes, for persistent homology.
result Persistent homology-based descriptors are competitive across protein dynamics tasks, including frame-level observable regression and MSM estimation.

Unified model learns from proteins and ligands for drug design.

problem Disjoint data sources and modeling assumptions limit joint use of structure- and ligand-based drug design.
method Contrastive Geometric Learning for Unified Computational Drug Design (ConGLUDe)
result Unified model achieves competitive zero-shot virtual screening performance and state-of-the-art ligand-conditioned pocket selection.

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 ↗

We consider the large-scale query-document retrieval problem: given a query (e.g., a question), return the set of relevant documents (e.g., paragraphs containing the answer) from a large document corpus. This problem is often solved in two steps. The retrieval phase first reduces the solution space, returning a subset …

2020-02-10abs ↗pdf ↗

In this work, we propose data augmentation methods for embeddings from pre-trained deep learning models that take a weighted combination of a pair of input embeddings, as inspired by Mixup, and combine such augmentation with extra label softening. These methods are shown to significantly increase classification accurac…

2019-11-28abs ↗pdf ↗

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

Motivation: Understanding functions of proteins in specific human tissues is essential for insights into disease diagnostics and therapeutics, yet prediction of tissue-specific cellular function remains a critical challenge for biomedicine. Results: Here we present OhmNet, a hierarchy-aware unsupervised node feature le…

2017-07-14abs ↗pdf ↗

Variational auto-encoder frameworks have demonstrated success in reducing complex nonlinear dynamics in molecular simulation to a single non-linear embedding. In this work, we illustrate how this non-linear latent embedding can be used as a collective variable for enhanced sampling, and present a simple modification th…

2018-01-02abs ↗pdf ↗

Pre-trained word embeddings encode general word semantics and lexical regularities of natural language, and have proven useful across many NLP tasks, including word sense disambiguation, machine translation, and sentiment analysis, to name a few. In supervised tasks such as multiclass text classification (the focus of …

2019-11-26abs ↗pdf ↗

Proposes a thermodynamic work minimization framework for guiding generative models.

problem Guiding generative models in sparse-data regimes with limited target samples or constraints.
method Regularization framework inspired by thermodynamic work, introducing Path Guidance and Observable Guidance.
result Improves sample efficiency and reduces bias in molecular simulations.

Simplified image clustering achieves competitive results without text-based embeddings.

problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.

Topic models are frequently used in machine learning owing to their high interpretability and modular structure. However, extending a topic model to include a supervisory signal, to incorporate pre-trained word embedding vectors and to include a nonlinear output function is not an easy task because one has to resort to…

2018-02-22abs ↗pdf ↗

Researchers develop method to protect against 'weight poisoning' attacks on pre-trained models.

problem The security threat of downloading untrusted pre-trained weights that can be manipulated after fine-tuning.
method RIPPLe regularization method and Embedding Surgery initialization procedure.
result Demonstrated that weight poisoning attacks are possible even with limited knowledge of the dataset and fine-tuning procedure.

New method uses diffusion models for Bayesian inverse problems.

problem Solving Bayesian inverse problems with linear-Gaussian models.
method Decoupled Diffusion Sequential Monte Carlo (DDSMC) method.
result Asymptotically exact solution demonstrated on various data types.

Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…

2018-06-05abs ↗pdf ↗

Mathematical pipeline identifies structural homology of knotted proteins.

problem Quantification and classification of protein structures, especially knotted proteins, require noise-free and complete data.
method Developed a geometric framework using persistent homology to analyze protein structures.
result Persistent homology accurately represents structural homology of knotted proteins and identifies geometric features of protein entanglement.

Protein interaction networks are a promising type of data for studying complex biological systems. However, despite the rich information embedded in these networks, they face important data quality challenges of noise and incompleteness that adversely affect the results obtained from their analysis. Here, we explore th…

2012-10-25abs ↗pdf ↗

Capturing sentence semantics plays a vital role in a range of text mining applications. Despite continuous efforts on the development of related datasets and models in the general domain, both datasets and models are limited in biomedical and clinical domains. The BioCreative/OHNLP organizers have made the first attemp…

2019-09-06abs ↗pdf ↗