Niharika Gauraha, Akshay Chaturvedi
Published 2018-08-27Version 1
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.
On the Limitation of Kernel Dependence Maximization for Feature Selection
Estimating shared subspace with AJIVE: the power and limitation of multiple data matrices
One-bit Submission for Locally Private Quasi-MLE: Its Asymptotic Normality and Limitation
![QR code for arXiv:1809.01706 [stat.ML]](http://oss.arxitics.com/images/favicon.svg)