Provable fast greedy compressive summarization with any monotone submodular function

Jun 1, 2018·

Shinsaku Sakaue

,

Tsutomu Hirao

,

Masaaki Nishino

,

Masaaki Nagata

· 0 min read

Type

Conference paper

Publication

North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL)

Last updated on Jun 1, 2018

← Greedy and IHT algorithms for non-convex optimization with monotone costs of non-zeros Apr 16, 2019

Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams Apr 9, 2018 →