267 citations · 705 across the 11 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2015★ 5 cited
Totally Corrective Boosting with Cardinality Penalization
Vasil S. Denchev, Nan Ding, Shin Matsushima +2
We propose a totally corrective boosting algorithm with explicit cardinality regularization. The resulting combinatorial optimization problems are not known to be efficiently solva…
cs.LG2014★ 7 cited
Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing
Ryan Babbush, Vasil Denchev, Nan Ding +2
Quantum annealing is a heuristic quantum algorithm which exploits quantum resources to minimize an objective function embedded as the energy levels of a programmable physical syste…