English
Related papers

Related papers: Robust blind methods using $\ell_p$ quasi norms

200 papers

This paper presents a robust approach for learning from noisy pairwise comparisons. We propose sufficient conditions on the loss function under which the risk minimization framework becomes robust to noise in the pairwise similar dissimilar…

Machine Learning · Computer Science 2023-03-07 Samartha S Maheshwara , Naresh Manwani

We demonstrate that the choice of optimizer, neural network architecture, and regularizer significantly affect the adversarial robustness of linear neural networks, providing guarantees without the need for adversarial training. To this…

Machine Learning · Computer Science 2021-06-08 Fartash Faghri , Sven Gowal , Cristina Vasconcelos , David J. Fleet , Fabian Pedregosa , Nicolas Le Roux

We provide fast algorithms for overconstrained $\ell_p$ regression and related problems: for an $n\times d$ input matrix $A$ and vector $b\in\mathbb{R}^n$, in $O(nd\log n)$ time we reduce the problem $\min_{x\in\mathbb{R}^d} \|Ax-b\|_p$ to…

Data Structures and Algorithms · Computer Science 2014-04-08 Kenneth L. Clarkson , Petros Drineas , Malik Magdon-Ismail , Michael W. Mahoney , Xiangrui Meng , David P. Woodruff

Deep neural network-based classifiers trained with the categorical cross-entropy (CCE) loss are sensitive to label noise in the training data. One common type of method that can mitigate the impact of label noise can be viewed as supervised…

Computer Vision and Pattern Recognition · Computer Science 2021-04-20 Aritra Ghosh , Andrew Lan

The problem of robust mean estimation in high dimensions is studied, in which a certain fraction (less than half) of the datapoints can be arbitrarily corrupted. Motivated by compressive sensing, the robust mean estimation problem is…

Applications · Statistics 2022-12-08 Aditya Deshmukh , Jing Liu , Venugopal V. Veeravalli

We construct for each $0<p\le 1$ an infinite collection of subspaces of $\ell_p$ that extend the example from [J. Lindenstrauss, On a certain subspace of $\ell_{1}$, Bull. Acad. Polon. Sci. S\'er. Sci. Math. Astronom. Phys. 12 (1964),…

Functional Analysis · Mathematics 2019-12-19 Fernando Albiac , José L. Ansorena , Przemysław Wojtaszczyk

Despite their many appealing properties, kernel methods are heavily affected by the curse of dimensionality. For instance, in the case of inner product kernels in $\mathbb{R}^d$, the Reproducing Kernel Hilbert Space (RKHS) norm is often…

Machine Learning · Computer Science 2021-11-09 Michael Celentano , Theodor Misiakiewicz , Andrea Montanari

We investigate channel equalization for Rayleigh fading channels under bounded channel uncertainties. We analyze three robust methods to estimate an unknown signal transmitted through a Rayleigh fading channel, where we avoid directly…

Information Theory · Computer Science 2012-10-01 Mehmet A. Donmez , Huseyin A. Inan , Suleyman S. Kozat

Vendor interoperability is one of the desired future characteristics of optical networks. This means that the transmission system needs to support a variety of hardware with different components, leading to system uncertainties throughout…

Signal Processing · Electrical Eng. & Systems 2022-06-08 Ognjen Jovanovic , Metodi P. Yankov , Francesco Da Ros , Darko Zibar

Impulsive noise (IN) commonly generated by power devices can severely degrade the performance of high sensitivity wireless receivers. Accurate channel state information (CSI) knowledge is essential for designing optimal maximum a posteriori…

Signal Processing · Electrical Eng. & Systems 2025-10-03 Chin-Hung Chen , Ivana Nikoloska , Wim van Houtum , Yan Wu , Boris Karanov , Alex Alvarado

As a certified defensive technique, randomized smoothing has received considerable attention due to its scalability to large datasets and neural networks. However, several important questions remain unanswered, such as (i) whether the…

Machine Learning · Computer Science 2020-06-09 Tianhang Zheng , Di Wang , Baochun Li , Jinhui Xu

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $\Pi$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_{\Pi}[\textrm{for all }x, \ \|Ax\|_p \leq \|\Pi Ax\|_p \leq \kappa \|Ax\|_p] \geq 9/10,$$…

Data Structures and Algorithms · Computer Science 2018-04-10 Ruosong Wang , David P. Woodruff

Implicit neural networks, a.k.a., deep equilibrium networks, are a class of implicit-depth learning models where function evaluation is performed by solving a fixed point equation. They generalize classic feedforward models and are…

Machine Learning · Computer Science 2022-01-27 Saber Jafarpour , Alexander Davydov , Anton V. Proskurnikov , Francesco Bullo

Verifying robustness of neural networks given a specified threat model is a fundamental yet challenging task. While current verification methods mainly focus on the $\ell_p$-norm threat model of the input instances, robustness verification…

Machine Learning · Computer Science 2020-06-16 Jeet Mohapatra , Tsui-Wei , Weng , Pin-Yu Chen , Sijia Liu , Luca Daniel

Adversarial examples are malicious inputs crafted to cause a model to misclassify them. Their most common instantiation, "perturbation-based" adversarial examples introduce changes to the input that leave its true label unchanged, yet…

Machine Learning · Computer Science 2019-03-26 Jörn-Henrik Jacobsen , Jens Behrmannn , Nicholas Carlini , Florian Tramèr , Nicolas Papernot

In this paper, a robust and blind watermarking method is proposed, which is highly resistant to the common image watermarking attacks, such as noises, compression, and image quality enhancement processing. In this method, Arnold Cat map is…

Multimedia · Computer Science 2018-05-01 Seyyed Hossein Soleymani , Amir Hossein Taherinia , Amir Hossein Mohajerzadeh

This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\ell^1$ setting and perform…

Numerical Analysis · Mathematics 2016-08-03 Kristian Bredies , Barbara Kaltenbacher , Elena Resmerita

We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to…

Computer Vision and Pattern Recognition · Computer Science 2018-03-23 Sathya N. Ravi , Ronak Mehta , Vikas Singh

We give a formal verification procedure that decides whether a classifier ensemble is robust against arbitrary randomized attacks. Such attacks consist of a set of deterministic attacks and a distribution over this set. The…

Machine Learning · Computer Science 2020-07-10 Dennis Gross , Nils Jansen , Guillermo A. Pérez , Stephan Raaijmakers

We study the $\ell_p$ regression problem, which requires finding $\mathbf{x}\in\mathbb R^{d}$ that minimizes $\|\mathbf{A}\mathbf{x}-\mathbf{b}\|_p$ for a matrix $\mathbf{A}\in\mathbb R^{n \times d}$ and response vector…

Data Structures and Algorithms · Computer Science 2022-03-16 Raphael A. Meyer , Cameron Musco , Christopher Musco , David P. Woodruff , Samson Zhou