Zobrazeno 1 - 10
of 184
pro vyhledávání: '"Patrick L. Combettes"'
Autor:
Patrick L. Combettes, Minh Bui
Publikováno v:
Mathematics of Operations Research. 47:1082-1109
We propose a novel approach to monotone operator splitting based on the notion of a saddle operator. Under investigation is a highly structured multivariate monotone inclusion problem involving a mix of set-valued, cocoercive, and Lipschitzian monoto
Neural networks have become ubiquitous tools for solving signal and image processing problems, and they often outperform standard approaches. Nevertheless, training neural networks is a challenging task in many applications. The prevalent training pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c0f368ff157351e177c2961e5b76e87
http://arxiv.org/abs/2210.15064
http://arxiv.org/abs/2210.15064
Publikováno v:
Advances in Nonlinear Analysis, Vol 10, Iss 1, Pp 1154-1177 (2021)
Various strategies are available to construct iteratively a common fixed point of nonexpansive operators by activating only a block of operators at each iteration. In the more challenging class of composite fixed point problems involving operators th
Autor:
Patrick L. Combettes, Zev C. Woodstock
Publikováno v:
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
Publikováno v:
SIAM Journal on Mathematics of Data Science
SIAM Journal on Mathematics of Data Science, 2020, ⟨10.1137/19M1272780⟩
SIAM Journal on Mathematics of Data Science, Society for Industrial and Applied Mathematics, 2020, ⟨10.1137/19M1272780⟩
SIAM Journal on Mathematics of Data Science, 2020, ⟨10.1137/19M1272780⟩
SIAM Journal on Mathematics of Data Science, Society for Industrial and Applied Mathematics, 2020, ⟨10.1137/19M1272780⟩
International audience; Obtaining sharp Lipschitz constants for feed-forward neural networks is essential to assess their robust-ness in the face of perturbations of their inputs. We derive such constants in the context of a general layered network m
Under consideration are multicomponent minimization problems involving a separable nonsmooth convex function penalizing the components individually, and nonsmooth convex coupling terms penalizing linear mixtures of the components. We investigate bloc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a21d0999a5e1eae639ed80a04c0c92a
Autor:
Zev C. Woodstock, Patrick L. Combettes
Under investigation is the problem of finding the best approximation of a function in a Hilbert space subject to convex constraints and prescribed nonlinear transformations. We show that in many instances these prescriptions can be represented using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54e56f6a5eaa27c5554fabb50ed33f6f
A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations
Autor:
Patrick L. Combettes, Zev C. Woodstock
Building up on classical linear formulations, we posit that a broad class of problems in signal synthesis and in signal recovery are reducible to the basic task of finding a point in a closed convex subset of a Hilbert space that satisfies a number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01eaa8c44b048b0ed9289210b8d586f3
Publikováno v:
Set-Valued and Variational Analysis
Set-Valued and Variational Analysis, Springer, In press, ⟨10.1007/s11228-019-00526-z⟩
Set-Valued and Variational Analysis, In press, ⟨10.1007/s11228-019-00526-z⟩
Set-Valued and Variational Analysis, Springer, In press, ⟨10.1007/s11228-019-00526-z⟩
Set-Valued and Variational Analysis, In press, ⟨10.1007/s11228-019-00526-z⟩
International audience; Motivated by structures that appear in deep neural networks, we investigate nonlinear composite models alternating proximity and affine operators defined on different spaces. We first show that a wide range of activation opera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6581a1df515cdb8ba7794e9d5bb894e9
https://hal.archives-ouvertes.fr/hal-02425025/document
https://hal.archives-ouvertes.fr/hal-02425025/document
We introduce c-lasso, a Python package that enables sparse and robust linear regression and classification with linear equality constraints. The underlying statistical forward model is assumed to be of the following form: \[ y = X \beta + \sigma \eps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::070e333a417485102fc784183c655f5c