2020
DOI: 10.1109/tsipn.2019.2957717
|View full text |Cite
|
Sign up to set email alerts
|

Vector-Valued Graph Trend Filtering With Non-Convex Penalties

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(19 citation statements)
references
References 53 publications
0
17
0
Order By: Relevance
“…In the literature of graph total variation and graph trend filtering, the normalization step is often overlooked and the graph difference operator is directly used as in GTF (Wang et al, 2016;Varma et al, 2019). To achieve better numerical stability and handle diverse node degrees in real-world graphs, we propose to normalize each column of the incident matrix by the square root of node degrees for the 1 -based graph smoothing as follows 1 :…”
Section: Elastic Graph Signal Estimatormentioning
confidence: 99%
See 3 more Smart Citations
“…In the literature of graph total variation and graph trend filtering, the normalization step is often overlooked and the graph difference operator is directly used as in GTF (Wang et al, 2016;Varma et al, 2019). To achieve better numerical stability and handle diverse node degrees in real-world graphs, we propose to normalize each column of the incident matrix by the square root of node degrees for the 1 -based graph smoothing as follows 1 :…”
Section: Elastic Graph Signal Estimatormentioning
confidence: 99%
“…However, computing the estimators defined by ( 7) and ( 8) is much more challenging because of the nonsmoothness, and the two components, i.e., f (F) and g( ∆F), are non-separable as they are coupled by the graph difference operator ∆. In the literature, researchers have developed optimization algorithms for the graph trend filtering problem (4) such as Alternating Direction Method of Multipliers (ADMM) and Newton type algorithms (Wang et al, 2016;Varma et al, 2019). However, these algorithms require to solve the minimization of a nontrivial sub-problem in each single iteration, which incurs high computation complexity.…”
Section: Elastic Message Passingmentioning
confidence: 99%
See 2 more Smart Citations
“…Recently, trend filtering has also been extended to many other contexts keeping the property that for a growing penalty parameter linear functions in the appropriate setting are selected; e.g. graphs [15], vector-valued graphs [13] and additive models [10].…”
Section: Introductionmentioning
confidence: 99%