Fetching the paper…
Reading the bibliography…
Obtaining sharp Lipschitz constants for feed-forward neural networks is essential to assess their robustness in the face of perturbations of their inputs.
G. Hardy, J. E. Littlewood, and G. Pólya, Inequalities,
1952
Earlier work this paper cites.
F. Rosenblatt, The perceptron: A probabilistic model for information storage and organization in the brain, Psychological Rev
1958
Earlier work this paper cites.
J.-B. Baillon, R. E. Bruck, and S. Reich, On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces, Houston J. Math
1978
Earlier work this paper cites.
S. Geman and D. E. McClure, Bayesian image analysis: An application to single photon emission tomography, Proc. Statist. Comput. Section Amer. Stat. Assoc
1985
Earlier work this paper cites.
E. Zeidler, Nonlinear Functional Analysis and Its Applications
1990
Earlier work this paper cites.
H. N. Mhaskar and C. A. Micchelli, How to choose an activation function, Adv. Neural Inform. Process. Syst
1994
Earlier work this paper cites.
M. Nakagawa, An artificial neuron model with a periodic activation function, J. Phys. Soc. Japan,
1995
Earlier work this paper cites.
F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems
2003
Earlier work this paper cites.
P. L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization,
2004
Earlier work this paper cites.
P. L. Combettes and V. R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul
2005
Earlier work this paper cites.
P. L. Combettes and J.-C. Pesquet. Proximal thresholding algorithm for minimization over orthonormal bases, SIAM J. Optim. , vol. 18, pp. 1351–1376, 2007
2007
Earlier work this paper cites.
Y.-L. Boureau, J. Ponce, and Y. LeCun, A theoretical analysis of feature pooling in visual recognition, Intl. Conf. Machine Learn
2010
Earlier work this paper cites.
A. Krizhevsky, Convolutional deep belief networks on CIFAR-10, technical report, University of Toronto, 2010. https://www.cs.toronto.edu/~kriz/conv-cifar10-aug2010.pdf
2010
Earlier work this paper cites.
X. Glorot, A. Bordes, and Y. Bengio, Deep sparse rectifier neural networks, Proc. 14th Int. Conf. Artificial Intell. Stat
2011
Earlier work this paper cites.
L. M. Briceño-Arias and P. L. Combettes, Monotone operator methods for Nash equilibria in non-potential games, in Computational and Analytical Mathematics, (D. Bailey et. al
2013
Earlier work this paper cites.
J. Bruna and S. Mallat, Invariant scattering convolution networks, IEEE Trans. Pattern Anal. Mach. Intell
2013
Earlier work this paper cites.
L. Condat, A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms, J. Optim. Theory Appl
2013
Earlier work this paper cites.
I. J. Goodfellow, D. Warde-Farley, M. Mirza, A. Courville, and Y. Bengio, Maxout networks, Proc. 30th Intl. Conf. Machine Learn
2013
Earlier work this paper cites.
A. L. Maas, A. Y. Hannun, and A. Y. Ng, Rectifier nonlinearities improve neural network acoustic models, Proc. 30th Int. Conf. Machine Learn. , 2013
2013
Earlier work this paper cites.
2013
Cited alongside, same era.
C. H. Aladag, E. Egrioglu, and U. Yolcu, Robust multilayer neural network based on median neuron model, Neural Comput. Appl
2014
Cited alongside, same era.
2014
Cited alongside, same era.
J. Chorowski and J. M. Zurad, Learning understandable neural networks, with nonnegative weight constraints, IEEE Trans. Neural Netw. Learn. Syst
2015
Cited alongside, same era.
M. Yamagishi and I. Yamada, Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization, Inverse Problems,
2017
Later among the works it cites.
N. Akhtar and A. Mian, Threat of adversarial attacks on deep learning in computer vision: A survey, IEEE Access , vol. 6, pp. 14410–14430, 2018
2018
Later among the works it cites.
A. Athalye, N. Carlini, and D. Wagner, Obfuscated gradients give a false sense of security: Circumventing defenses to adversarial examples, Proc. Intl. Conf. Machine Learn
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Bravo and R. Cominetti, Sharp convergence rates for averaged nonexpansive maps, Israel J. Math
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
I. Bayram, On the convergence of the iterative shrinkage/thresholding algorithm with a weakly convex penalty, IEEE Trans. Signal Process
2016
Cited alongside, same era.
C.-Y. Lee, P. W. Gallagher, and Z. Tu, Generalizing pooling functions in convolutional neural networks: Mixed, gated, and tree, Proc. Machine Learn. Res
2016
Cited alongside, same era.
N. Papernot, P. McDaniel, X. Wu, S. Jha, and A. Swami, Distillation as a defense to adversarial perturbations against deep neural networks, Proc. IEEE Symp. Security Privacy , pp. 582–597, 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Cited alongside, same era.
P. L. Bartlett, D. J. Foster, and M. J. Telgarsky, Spectrally-normalized margin bounds for neural networks, Adv. Neural Inform. Process. Syst
2017
Cited alongside, same era.
J. M. Borwein, G. Li, and M. K. Tam, Convergence rate analysis for averaged fixed point iterations in common fixed point problems, SIAM J. Optim
2017
Cited alongside, same era.
2018
Later among the works it cites.
F. Kreuk, Y. Adi, M. Cisse, and J. Keshet, Fooling end-to-end speaker verification with adversarial examples, Proc. IEEE Intl. Conf. Acoustic, Speech Signal Process
2018
Later among the works it cites.
W. M. Moorsi, The forward-backward algorithm and the normal problem, J. Optim. Theory Appl
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
W. Ruan, X. Huang, and M. Kwiatkowska, Reachability analysis of deep neural networks with provable guarantees, Proc. 27th Intl. Joint Conf. Artificial Intell
2018
Later among the works it cites.
K. Scaman and A. Virmaux, Lipschitz regularity of deep neural networks: Analysis and efficient estimation, Adv. Neural Inform. Process. Syst
2018
Later among the works it cites.
Y. Tsuzuku, I. Sato, and M. Sugiyama, Lipschitz-margin training: Scalable certification of perturbation invariance for deep neural networks, Adv. Neural Inform. Process. Syst
2018
Later among the works it cites.
E. Wong and J. Z. Kolter, Provable defenses against adversarial examples via the convex outer adversarial polytope, Proc. 35th Int. Conf. Machine Learn. , vol. 80, pp. 5286–5295, 2018
2018
Later among the works it cites.
H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces,
2019
Closest in time.
H. Bölcskei, P. Grohs, G. Kutyniok, and P. Petersen, Optimal approximation with sparsely connected deep neural networks, SIAM J. Math. Data Sci
2019
Closest in time.
Y. Sun, B. Wohlberg, and U. S. Kamilov, An online plug-and-play algorithm for regularized image reconstruction, IEEE Trans. Comput. Imaging,
2019
Closest in time.
P. Yi and L. Pavel, Distributed generalized Nash equilibria computation of monotone games via double-layer preconditioned proximal-point algorithms, IEEE Trans. Control Network Syst
2019
Closest in time.
C. Bertocchi, E. Chouzenoux, M.-C. Corbineau, J.-C. Pesquet, and M. Prato, Deep unfolding of a proximal interior point method for image restoration, Inverse Problems
2020
Closest in time.
P. L. Combettes and J.-C. Pesquet, Deep neural network structures solving variational inequalities, Set-Valued Var. Anal
2020
Closest in time.