A Limitation of V-Matrix based Methods

TL;DR

This paper identifies a fundamental limitation of V-matrix based methods for estimating conditional probabilities, showing that their constrained quadratic programming formulation can lack consistent solutions.

Contribution

It demonstrates that the V-matrix approach may fail to produce consistent solutions due to inherent inequality constraint issues.

Findings

V-matrix constrained quadratic problems can be inconsistent.

The method may not always yield valid conditional probability estimates.

Highlights a critical limitation in existing V-matrix based techniques.

Abstract

To estimate the conditional probability functions based on the direct problem setting, V-matrix based method was proposed. We construct V-matrix based constrained quadratic programming problems for which the inequality constraints are inconsistent. In particular, we would like to present that the constrained quadratic optimization problem for conditional probability estimation using V-matrix method may not have a consistent solution always.