7.2k citations · 24.9k across the 107 of their papers we have counts for
Showing 2015 · cs.LGShow all
2 papers · 2 filters
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.LG2015★ 6 cited
Probabilistic Label Relation Graphs with Ising Models
Nan Ding, Jia Deng, Kevin Murphy +1
We consider classification problems in which the label space has structure. A common example is hierarchical label spaces, corresponding to the case where one label subsumes anothe…