Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Journal of Fourier A...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Journal of Fourier Analysis and Applications
Article . 2020 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 2020
Data sources: zbMATH Open
https://dx.doi.org/10.14279/de...
Article . 2020
License: CC BY
Data sources: Datacite
https://dx.doi.org/10.48550/ar...
Article . 2019
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
https://dx.doi.org/10.14279/de...
Article . 2020
License: CC BY
Data sources: Datacite
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
DepositOnce
Article . 2023
License: CC BY
Data sources: DepositOnce
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
DepositOnce
Article . 2023
License: CC BY
Data sources: DepositOnce
versions View all 10 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Parseval Proximal Neural Networks

Parseval proximal neural networks
Authors: Hasannasab, Marzieh; Hertrich, Johannes; Neumayer, Sebastian; Plonka, Gerlind; Setzer, Simon; Steidl, Gabriele; Hasannasab, Marzieh; Institute of Mathematics, TU Berlin, Berlin, Germany; +5 Authors

Parseval Proximal Neural Networks

Abstract

AbstractThe aim of this paper is twofold. First, we show that a certain concatenation of a proximity operator with an affine operator is again a proximity operator on a suitable Hilbert space. Second, we use our findings to establish so-called proximal neural networks (PNNs) and stable tight frame proximal neural networks. Let$$\mathcal {H}$$Hand$$\mathcal {K}$$Kbe real Hilbert spaces,$$b \in \mathcal {K}$$b∈Kand$$T \in \mathcal {B} (\mathcal {H},\mathcal {K})$$T∈B(H,K)a linear operator with closed range and Moore–Penrose inverse$$T^\dagger $$T†. Based on the well-known characterization of proximity operators by Moreau, we prove that for any proximity operator$$\mathrm {Prox}:\mathcal {K}\rightarrow \mathcal {K}$$Prox:K→Kthe operator$$T^\dagger \, \mathrm {Prox}( T \cdot + b)$$T†Prox(T·+b)is a proximity operator on$$\mathcal {H}$$Hequipped with a suitable norm. In particular, it follows for the frequently applied soft shrinkage operator$$\mathrm {Prox}= S_{\lambda }:\ell _2 \rightarrow \ell _2$$Prox=Sλ:ℓ2→ℓ2and any frame analysis operator$$T:\mathcal {H}\rightarrow \ell _2$$T:H→ℓ2that the frame shrinkage operator$$T^\dagger \, S_\lambda \, T$$T†SλTis a proximity operator on a suitable Hilbert space. The concatenation of proximity operators on$$\mathbb R^d$$Rdequipped with different norms establishes a PNN. If the network arises from tight frame analysis or synthesis operators, then it forms an averaged operator. In particular, it has Lipschitz constant 1 and belongs to the class of so-called Lipschitz networks, which were recently applied to defend against adversarial attacks. Moreover, due to its averaging property, PNNs can be used within so-called Plug-and-Play algorithms with convergence guarantee. In case of Parseval frames, we call the networks Parseval proximal neural networks (PPNNs). Then, the involved linear operators are in a Stiefel manifold and corresponding minimization methods can be applied for training of such networks. Finally, some proof-of-the concept examples demonstrate the performance of PPNNs.

Country
Germany
Keywords

500 Naturwissenschaften und Mathematik::510 Mathematik::519 Wahrscheinlichkeiten, angewandte Mathematik, adverserial robustness, Learning and adaptive systems in artificial intelligence, 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik, frame shrinkage, optimization on Stiefel manifolds, Numerical Analysis (math.NA), Nonconvex programming, global optimization, Lipschitz neural networks, proximal operators, FOS: Mathematics, Mathematics - Numerical Analysis, averaged operators

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    39
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
39
Top 10%
Top 10%
Top 10%
Green
hybrid