Improving the reliability of deep neural networks in NLP: A review
Deep learning models have achieved great success in solving a variety of natural language
processing (NLP) problems. An ever-growing body of research, however, illustrates the …
processing (NLP) problems. An ever-growing body of research, however, illustrates the …
Review and big data perspectives on robust data mining approaches for industrial process modeling with outliers and missing data
Industrial process data are usually mixed with missing data and outliers which can greatly
affect the statistical explanation abilities for traditional data-driven modeling methods. In this …
affect the statistical explanation abilities for traditional data-driven modeling methods. In this …
Robust subspace learning: Robust PCA, robust subspace tracking, and robust subspace recovery
Principal component analysis (PCA) is one of the most widely used dimension reduction
techniques. A related easier problem is termed subspace learning or subspace estimation …
techniques. A related easier problem is termed subspace learning or subspace estimation …
From symmetry to geometry: Tractable nonconvex problems
As science and engineering have become increasingly data-driven, the role of optimization
has expanded to touch almost every stage of the data analysis pipeline, from signal and …
has expanded to touch almost every stage of the data analysis pipeline, from signal and …
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods
We consider a class of nonsmooth optimization problems over the Stiefel manifold, in which
the objective function is weakly convex in the ambient Euclidean space. Such problems are …
the objective function is weakly convex in the ambient Euclidean space. Such problems are …
Static and dynamic robust PCA and matrix completion: A review
Principal component analysis (PCA) is one of the most widely used dimension reduction
techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be …
techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be …
Dual principal component pursuit
MC Tsakiris, R Vidal - Journal of Machine Learning Research, 2018 - jmlr.org
We consider the problem of learning a linear subspace from data corrupted by outliers.
Classical approaches are typically designed for the case in which the subspace dimension …
Classical approaches are typically designed for the case in which the subspace dimension …
Efficient deterministic search with robust loss functions for geometric model fitting
Geometric model fitting is a fundamental task in computer vision, which serves as the pre-
requisite of many downstream applications. While the problem has a simple intrinsic …
requisite of many downstream applications. While the problem has a simple intrinsic …
Parseval proximal neural networks
The 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 …
operator with an affine operator is again a proximity operator on a suitable Hilbert space …
TDOA-based localization with NLOS mitigation via robust model transformation and neurodynamic optimization
This paper revisits the problem of locating a signal-emitting source from time-difference-of-
arrival (TDOA) measurements under non-line-of-sight (NLOS) propagation. Many currently …
arrival (TDOA) measurements under non-line-of-sight (NLOS) propagation. Many currently …