Underlying Connections Between Algorithms For Nongreedy LDA-L1.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 29994509.
- Also identified by DOI 10.1109/TIP.2018.2803305.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
To solve the essential objective of LDA-L1, NLDA-L1 proposes a nongreedy algorithm by constructing an auxiliary function. In this correspondence, we show that essentially, this algorithm directly solves the objective using a gradient ascending procedure, meaning that the auxiliary function may be not necessary. Then, we further show that NLDA-L1 is a special case of ILDA-L1, which applies the same iterative procedure of ILDA-L1.