Usually, in data processing, to find the parameters of the models that best fits the data, people use the Least Squares method. One of the advantages of this method is that for linear models, it leads to an easy-to-solve system of linear equations. A limitation of this method is that even a single outlier can ruin the corresponding estimates; thus, more robust methods are needed. In particular, in software engineering, often, a more robust pred(25) method is used, in which we maximize the number of cases in which the model\u27s prediction is within the 25% range of the observations. In this paper, we show that even for linear models, pred(25) parameter estimation is NP-hard
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
In this paper, we consider an optimization approach for model selection using Akaike's Information C...
For a variety of regularized optimization problems in machine learning, algorithms computing the ent...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
We consider the problem of learning the canonical parameters specifying an undirected graphical mode...
The choice of a parametric model structure in empirical and semi-empirical non-linear modeling is us...
Latent variable models have been playing a central role in psychometrics and related fields. In many...
It is sometimes desired to update solutions to systems of equations or other problems as new infor...
The regression coecient estimates from ordinary least squares (OLS) have a low probability...
The performances of penalized least squares approaches profoundly depend on the selection of the tun...
DoctoralThis is a one hour class on the basics of numerical optimization for scientists who tune mod...
A common problem in applied regression analysis is to select the variables that enter a linear regre...
Data-driven decision making has become a necessary commodity in virtually every domain of human ende...
The performance of linear solvers is very dependent on their parameters and finding an optimal setti...
Research Doctorate - Doctor of Philosophy (PhD)This thesis addresses two issues that arise in restri...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
In this paper, we consider an optimization approach for model selection using Akaike's Information C...
For a variety of regularized optimization problems in machine learning, algorithms computing the ent...
We consider the problem of finding an −optimal solution of a standard linear pro-gram with real data...
We consider the problem of learning the canonical parameters specifying an undirected graphical mode...
The choice of a parametric model structure in empirical and semi-empirical non-linear modeling is us...
Latent variable models have been playing a central role in psychometrics and related fields. In many...
It is sometimes desired to update solutions to systems of equations or other problems as new infor...
The regression coecient estimates from ordinary least squares (OLS) have a low probability...
The performances of penalized least squares approaches profoundly depend on the selection of the tun...
DoctoralThis is a one hour class on the basics of numerical optimization for scientists who tune mod...
A common problem in applied regression analysis is to select the variables that enter a linear regre...
Data-driven decision making has become a necessary commodity in virtually every domain of human ende...
The performance of linear solvers is very dependent on their parameters and finding an optimal setti...
Research Doctorate - Doctor of Philosophy (PhD)This thesis addresses two issues that arise in restri...
We consider the problem of finding an ε{lunate}-optimal solution of a standard linear program with ...
In this paper, we consider an optimization approach for model selection using Akaike's Information C...
For a variety of regularized optimization problems in machine learning, algorithms computing the ent...