Friday, 15:15 - 15:40 h, Room: MA 376


Stefanie Jegelka
On fast approximate submodular minimization and related problems

Coauthors: Jeff A. Bilmes, Hui Lin


Machine learning problems often involve very large data sets. To test algorithms quickly, we aim to extract a suitable subset of a large training corpus. This is a submodular minimization problem, but the size of the data renders current exact methods very impractical. Graph cuts can be an alternative, but may not be able to efficiently represent any submodular function. We therefore approximate the objective function by a sequence of graph-representable functions. This leads to an efficient approximate minimization algorithm. It turns out that the underlying model not only helps represent submodular functions, it also enhances applications of graph cuts in computer vision, representing non-submodular energy functions that improve image segmentation results.


Talk 1 of the invited session Fri.3.MA 376
"Methods from discrete mathematics in systems biology" [...]
Cluster 12
"Life sciences & healthcare" [...]


  Payday Loans Wisconsin. Since its introduction in the market buying Buy Generic Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.