Michal Černý, Miroslav Rada, Jaromír Antoch, and Milan Hladík. A class of optimization problems motivated by rank estimators in robust regression. Optim., 71(8):2241–2271, 2022.
[PDF] [gzipped postscript] [postscript] [HTML]
A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We distinguish two classes of functions: a class with a continuous and convex objective function (CCC), which covers the class of rank estimators known from statistics, and also another class (GEN), which is far more general. We propose efficient algorithms for both classes. For GEN we propose an enumerative algorithm that works in polynomial time as long as the number of regressors is O(1). The proposed algorithm utilizes the special structure of arrangements of hyperplanes that occur in our problem and is superior to other known algorithms in this area. For the continuous and convex case, we propose an unconditionally polynomial algorithm finding the exact minimizer, unlike the heuristic or approximate methods implemented in statistical packages.
@article{CerRad2022a,
author = "Michal {\v{C}}ern\'{y} and Miroslav Rada and Jarom\'{\i}r Antoch and Milan Hlad\'{\i}k",
title = "A class of optimization problems motivated by rank estimators in robust regression",
journal = "Optim.",
fjournal = "Optimization",
volume = "71",
number = "8",
pages = "2241-2271",
year = "2022",
doi = "10.1080/02331934.2020.1812604",
issn = "0233-1934",
url = "https://www.tandfonline.com/doi/full/10.1080/02331934.2020.1812604",
bib2html_dl_html = "https://doi.org/10.1080/02331934.2020.1812604",
bib2html_dl_pdf = "https://www.tandfonline.com/doi/epub/10.1080/02331934.2020.1812604?needAccess=true",
abstract = "A rank estimator in robust regression is a minimizer of a function which depends (in addition to other factors) on the ordering of residuals but not on their values. Here we focus on the optimization aspects of rank estimators. We distinguish two classes of functions: a class with a continuous and convex objective function (CCC), which covers the class of rank estimators known from statistics, and also another class (GEN), which is far more general. We propose efficient algorithms for both classes. For GEN we propose an enumerative algorithm that works in polynomial time as long as the number of regressors is O(1). The proposed algorithm utilizes the special structure of arrangements of hyperplanes that occur in our problem and is superior to other known algorithms in this area. For the continuous and convex case, we propose an unconditionally polynomial algorithm finding the exact minimizer, unlike the heuristic or approximate methods implemented in statistical packages.",
keywords = "Discrete optimization; Arrangement of hyperplanes; Continuous optimization; Ellipsoid methodrank estimators",
}
Generated by bib2html.pl (written by Patrick Riley ) on Mon Apr 15, 2024 08:26:42