arXiv research

Improved online Lasso reduces regret in sparse linear contextual bandits.

SAMS-VAE models cellular perturbations using sparse additive mechanisms.

New method identifies latent variables with sparse perturbations.

LSDAT reduces query efficiency for decision-based adversarial attacks.

New method GSAT improves robustness against structured perturbations.

Sparse perturbations improve convergence in SZO methods for faster training.

Improved perturbation reduces matrix condition number to O(n) with minimal storage.

Sparse-RS framework efficiently attacks models with sparse perturbations.

Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between low-rank CP decomposition through gradient ascent (a variant of the tensor power method), and hard thresholding of the resid…

Accelerates optimization in asynchronous systems with sparse updates.

Study privacy and accuracy in high-dimensional LASSO with perturbation mechanisms.

Stochastic zeroth-order (SZO), or gradient-free, optimization allows to optimize arbitrary functions by relying only on function evaluations under parameter perturbations, however, the iteration complexity of SZO methods suffers a factor proportional to the dimensionality of the perturbed function. We show that in scen…

New technique crafts imperceivable sparse adversarial attacks.

Reconstructing the causal network in a complex dynamical system plays a crucial role in many applications, from sub-cellular biology to economic systems. Here we focus on inferring gene regulation networks (GRNs) from perturbation or gene deletion experiments. Despite their scientific merit, such perturbation experimen…

This letter proposes a low-computational Bayesian algorithm for noisy sparse recovery in the context of one bit compressed sensing with sensing matrix perturbation. The proposed algorithm which is called BHT-MLE comprises a sparse support detector and an amplitude estimator. The support detector utilizes Bayesian hypot…

We introduce and analyze stochastic optimization methods where the input to each gradient update is perturbed by bounded noise. We show that this framework forms the basis of a unified approach to analyze asynchronous implementations of stochastic optimization algorithms.In this framework, asynchronous stochastic optim…

New method certifies robustness to sparse adversarial attacks.

Study robust estimation of principal components under adversarial perturbations.

Paper uses Stochastic Mirror Descent for large-scale sparse recovery problems.

New method improves matrix completion accuracy, especially in noisy data.

Classical matrix perturbation results, such as Weyl's theorem for eigenvalues and the Davis-Kahan theorem for eigenvectors, are general purpose. These classical bounds are tight in the worst case, but in many settings sub-optimal in the typical case. In this paper, we present perturbation bounds which consider the natu…

A new approach to maximum likelihood learning of discrete graphical models and RBM in particular is introduced. Our method, Perturb and Descend (PD) is inspired by two ideas (I) perturb and MAP method for sampling (II) learning by Contrastive Divergence minimization. In contrast to perturb and MAP, PD leverages trainin…

Sparse PCA algorithm improves upon existing methods with better guarantees.

The paper provides entrywise bounds for Sparse PCA, improving upon previous results.

In presence of sparse noise we propose kernel regression for predicting output vectors which are smooth over a given graph. Sparse noise models the training outputs being corrupted either with missing samples or large perturbations. The presence of sparse noise is handled using appropriate use of $\ell_1$-norm along-wi…

Novel 'strong neuron' improves deep learning efficiency and robustness.

Proposes a text perturbation method using a Mahalanobis metric to balance privacy and utility.

This paper aims at achieving a "good" estimator for the gradient of a function on a high-dimensional space. Often such functions are not sensitive in all coordinates and the gradient of the function is almost sparse. We propose a method for gradient estimation that combines ideas from Spall's Simultaneous Perturbation …

New defense method reduces adversarial attacks on neural networks.

New regularization techniques improve stability of deep neural networks.

New metrics improve scRNA-seq perturbation modeling by reducing mode collapse.

New CSC model extracts EEG signals with low noise sensitivity.

The effectiveness of Graph Convolutional Networks (GCNs) has been demonstrated in a wide range of graph-based machine learning tasks. However, the update of parameters in GCNs is only from labeled nodes, lacking the utilization of unlabeled data. In this paper, we apply Virtual Adversarial Training (VAT), an adversaria…

Noise in SGD affects overparameterized models, favoring sparse solutions.

Paper develops a robust classifier for Gaussian mixture models under sparse adversarial perturbations.

Proposes a probabilistic digital twin for dynamical systems using sparse Bayesian learning.

Paper proves noise-tolerant SSC using greedy methods under coherence conditions.

Many algorithms have been proposed for fitting network models with communities, but most of them do not scale well to large networks, and often fail on sparse networks. Here we propose a new fast pseudo-likelihood method for fitting the stochastic block model for networks, as well as a variant that allows for an arbitr…

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike …

This paper studies least-square regression penalized with partly smooth convex regularizers. This class of functions is very large and versatile allowing to promote solutions conforming to some notion of low-complexity. Indeed, they force solutions of variational problems to belong to a low-dimensional manifold (the so…

The goal of predictive sparse coding is to learn a representation of examples as sparse linear combinations of elements from a dictionary, such that a learned hypothesis linear in the new representation performs well on a predictive task. Predictive sparse coding algorithms recently have demonstrated impressive perform…

Randomly biased data makes complex models as easy to learn as simple ones.

New methods tackle robust reinforcement learning in sparse, corrupted data.

AdvPCA uses robust optimization to achieve sparse PCA without tuning.

Proposes differentiable and sparse top-k operators for neural networks.

Generating high-quality and interpretable adversarial examples in the text domain is a much more daunting task than it is in the image domain. This is due partly to the discrete nature of text, partly to the problem of ensuring that the adversarial examples are still probable and interpretable, and partly to the proble…

This work improves PCA for robustness against adversarial perturbations.

Despite their impressive performance, deep convolutional neural networks (CNNs) have been shown to be sensitive to small adversarial perturbations. These nuisances, which one can barely notice, are powerful enough to fool sophisticated and well performing classifiers, leading to ridiculous misclassification results. In…