We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation
This paper presents a Chance-constraint Programming approach for constructing maximum-margin classif...
The robust portfolio selection problems have recently been studied by several re-searchers (e.g., se...
We present a geometrical approach for designing robust minimum variance (RMV) beamformers against st...
We propose a novel second order cone programming formulation for designing robust classifiers which ...
We propose a novel second order cone programming formulation for designing robust classifiers which ...
We propose a novel second order cone programming formulation for designing robust classifiers which...
Assuming an ellipsoidal model of uncertainty a robust formulation for classifying noisy data is pres...
This paper addresses the issue of feature selection for linear classifiers given the moments of the ...
This paper studies the problem of constructing robust classifiers when the training is plagued with ...
Abstract This paper studies the problem of constructing robust classifiers when the training is plag...
This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown th...
The central theme of the thesis is to study linear and non linear SVM formulations in the presence o...
In this paper we study robust convex quadratically constrained programs, a subset of the class of ro...
This paper studies a problem of robust rule-based classification, i.e. making predictions in the pre...
We propose a robust probability classifier model to address classification problems with data uncert...
This paper presents a Chance-constraint Programming approach for constructing maximum-margin classif...
The robust portfolio selection problems have recently been studied by several re-searchers (e.g., se...
We present a geometrical approach for designing robust minimum variance (RMV) beamformers against st...
We propose a novel second order cone programming formulation for designing robust classifiers which ...
We propose a novel second order cone programming formulation for designing robust classifiers which ...
We propose a novel second order cone programming formulation for designing robust classifiers which...
Assuming an ellipsoidal model of uncertainty a robust formulation for classifying noisy data is pres...
This paper addresses the issue of feature selection for linear classifiers given the moments of the ...
This paper studies the problem of constructing robust classifiers when the training is plagued with ...
Abstract This paper studies the problem of constructing robust classifiers when the training is plag...
This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown th...
The central theme of the thesis is to study linear and non linear SVM formulations in the presence o...
In this paper we study robust convex quadratically constrained programs, a subset of the class of ro...
This paper studies a problem of robust rule-based classification, i.e. making predictions in the pre...
We propose a robust probability classifier model to address classification problems with data uncert...
This paper presents a Chance-constraint Programming approach for constructing maximum-margin classif...
The robust portfolio selection problems have recently been studied by several re-searchers (e.g., se...
We present a geometrical approach for designing robust minimum variance (RMV) beamformers against st...