Vasil S. Denchev

Totally Corrective Boosting with Cardinality Penalization

2015 · arXiv (Cornell University)

We propose a totally corrective boosting algorithm with explicit cardinality regularization. The resulting combinatorial optimization problems are not known to be efficiently solvable with existing classical methods, but emerging quantum optimization technology gives hope for …