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

Trend · papers per month

4080120160 · May 202619922001200920172026
48 results for Docking Scores

DOCKSTRING simplifies docking simulations for better drug design benchmarks.

problem Lack of meaningful benchmarks for ligand design.
method Open-source Python package for docking scores, extensive dataset, and pharmaceutically-relevant tasks.
result Docking scores are more appropriate benchmarks than simple physicochemical properties.

This study analyzes how weather impacts bike sharing usage in Washington D.C.

problem Understanding how weather affects bike sharing usage patterns.
method Gathered bike usage and weather data, used k-means clustering algorithm to identify clusters.
result Weather significantly impacts bike usage, with temperature and precipitation being the most influential factors.

Improves drug properties using a novel LLM and reinforcement learning.

problem Optimizing drug properties while retaining chemical stability.
method Structured Policy Optimization (SPO) for fine-tuning a large language model.
result Enhanced drug properties across multiple target objectives.

This tutorial reviews RL-based methods for optimizing diffusion models to maximize specific metrics.

problem Optimizing diffusion models to generate samples that maximize specific metrics in practical applications.
method Various RL algorithms including PPO, differentiable optimization, reward-weighted MLE, value-weighted sampling, and path consistency learning.
result Exploration of strengths and limitations of RL-based fine-tuning algorithms and their benefits compared to non-RL-based approaches.

New model uses pretrained biochemical language models to generate drug compounds.

problem Developing novel compounds targeting specific proteins.
method Exploits pretrained language models to initialize and fine-tune targeted molecule generation models.
result Warm-started models outperform baseline models, with one-stage strategy showing better generalization.

Learning to optimize has emerged as a powerful framework for various optimization and machine learning tasks. Current such "meta-optimizers" often learn in the space of continuous optimization algorithms that are point-based and uncertainty-unaware. To overcome the limitations, we propose a meta-optimizer that learns i…

2019-11-09abs ↗pdf ↗

SDG uses optimal control to improve classifier guidance in low-density regions.

problem Inefficient guidance in low-density regions of posterior distributions.
method Integrates stochastic optimal control with Stein variational inference to compute the steepest descent direction.
result SDG improves guidance in low-density regions, outperforming standard methods.

In urban environments, supply resources have to be constantly matched to the "right" locations (where customer demand is present) so as to improve quality of life. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in EMS (Emergency Management Sy…

2018-12-03abs ↗pdf ↗

This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.

problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.

A new method improves data generation quality by correcting score mismatches.

problem Score mismatch issue in conditional score-based data generation methods.
method Denoising Likelihood Score Matching (DLSM) loss for classifier training.
result The proposed method outperforms previous methods on Cifar-10 and Cifar-100 benchmarks.

New scoring rules improve probabilistic classification model evaluation.

problem Traditional scoring rules misalign with the preference for correct classifications.
method Introduces Penalized Brier Score (PBS) and Penalized Logarithmic Loss (PLL) to modify proper scoring rules.
result PBS and PLL better identify optimal checkpoints and early stopping points, leading to superior F1 scores.

Classifies intrinsically linked tournaments by their score sequences.

problem Classifying intrinsically linked tournaments using their score sequences.
method Examining the score sequences of tournaments and identifying linkless sequences.
result The vast majority of score sequences for 8-vertex tournaments are linkless.

Improved score matching methods for estimating score functions and Hessians without high dimensionality.

problem Estimating score functions and Hessians efficiently in high-dimensional data.
method Implicit score matching and denoising score matching, leveraging Gagliardo-Nirenberg inequalities.
result Achieves convergence rates similar to denoising score matching and estimates Hessians without dimensionality issues.

The statistical leverage scores of a complex matrix ACn×dA\in\mathbb{C}^{n\times d} record the degree of alignment between col(A)(A) and the coordinate axes in Cn\mathbb{C}^n. These score are used in random sampling algorithms for solving certain numerical linear algebra problems. In this paper we present a max-plus algebr…

2016-09-29abs ↗pdf ↗

Forecasts of multivariate probability distributions are required for a variety of applications. Scoring rules enable the evaluation of forecast accuracy, and comparison between forecasting methods. We propose a theoretical framework for scoring rules for multivariate distributions, which encompasses the existing quadra…

2020-02-21abs ↗pdf ↗

Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been completely resolved for score matching. First, we provide a formal link between maxim…

2012-05-09abs ↗pdf ↗

The paper establishes bounds for score-matching in causal discovery and generative modeling.

problem Estimating causal relationships from data.
method Training a deep neural network to estimate the score function and applying it to causal discovery.
result Bounds on the error rate of causal discovery methods using score-matching.

This paper proposes a two-stage scoring approach to help lenders decide their fund allocations in the peer-to-peer (P2P) lending market. The existing scoring approaches focus on only either probability of default (PD) prediction, known as credit scoring, or profitability prediction, known as profit scoring, to identify…

2018-10-05abs ↗pdf ↗