A Minimum Variance Path Principle for Accurate and Stable Score-Based Density Ratio Estimation
Score-based methods are powerful across machine learning, but they face a paradox: theoretically path-independent, yet practically path-dependent. We resolve this by proving that practical training objectives differ from the ideal, ground-truth objective by a crucial, overlooked term: the path variance of the score function. We propose the MVP (Mimum Variance Path) Principle to minimize this path variance. Our key contribution is deriving a closed-form expression for the variance, making optimization tractable. By parameterizing the path with a flexible Kumaraswamy Mixture Model, our method learns data-adaptive, low-variance paths without heuristic manual selection. This principled optimization of the complete objective yields more accurate and stable estimators, establishing new state-of-the-art results on challenging benchmarks and providing a general framework for optimizing score-based interpolation. Our code can be found in https://github.com/Hoemr/OpenDRE.git.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Unified Invariant Learning Framework for Graph Classification
Invariant learning demonstrates substantial potential for enhancing the generalization of graph neural networks (GNNs) with out-of-distribution (OOD) data. It aims to recognize stable features in graph data for classific…
ClassificationGraph ClassificationGraph LearningMalliavin Calculus as Stochastic Backpropogation
We establish a rigorous connection between pathwise (reparameterization) and score-function (Malliavin) gradient estimators by showing that both arise from the Malliavin integration-by-parts identity. Building on this eq…
StringNET: Neural Network based Variational Method for Transition Pathways
Rare transition events in meta-stable systems under noisy fluctuations are crucial for many non-equilibrium physical and chemical processes. In these processes, the primary contributions to reactive flux are predominantl…
ARCComputational chemistryA Fully Analog Pipeline for Portfolio Optimization
Portfolio optimization is a ubiquitous problem in financial mathematics that relies on accurate estimates of covariance matrices for asset returns. However, estimates of pairwise covariance could be better and calculatin…
Portfolio OptimizationA Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection
Portfolio optimization involves selecting asset weights to minimize a risk-reward objective, such as the portfolio variance in the classical minimum-variance framework. Sparse portfolio selection extends this by imposing…
Portfolio Optimization