Searcharxiv⌕ Search

arXiv subjects

Zakhar Shumaylov

Publications and source records attributed to Zakhar Shumaylov.

21 records · Page 2Linked to original sources

Primordial power spectra from $k$-inflation with curvature

We investigate the primordial power spectra for general kinetic inflation models that support a period of kinetic dominance in the case of curved universes. We present derivations of the Mukhanov-Sasaki equations with a nonstandard scalar kinetic Lagrangian which manifests itself through the inflationary sound speed $c_s^2$. We extend the analytical approximations exploited in Contaldi et al [1] and Thavanesan et al [2] to general kinetic Lagrangians and show the effect of $k$-inflation on the primordial power spectra for models with curvature. In particular, the interplay between sound speed and curvature results in a natural low wavenumber cutoff for the power spectra in the case of closed universes. Using the analytical approximation, we further show that a change in the inflationary sound speed between different epochs of inflation results in non-decaying oscillations in the resultant power spectra for the comoving curvature perturbation.

astro-ph.CO↗

Manipulating SGD with Data Ordering Attacks

Machine learning is vulnerable to a wide variety of attacks. It is now well understood that by changing the underlying data distribution, an adversary can poison the model trained with it or introduce backdoors. In this paper we present a novel class of training-time attacks that require no changes to the underlying dataset or model architecture, but instead only change the order in which data are supplied to the model. In particular, we find that the attacker can either prevent the model from learning, or poison it to learn behaviours specified by the attacker. Furthermore, we find that even a single adversarially-ordered epoch can be enough to slow down model learning, or even to reset all of the learning progress. Indeed, the attacks presented here are not specific to the model or dataset, but rather target the stochastic nature of modern learning procedures. We extensively evaluate our attacks on computer vision and natural language benchmarks to find that the adversary can disrupt model training and even introduce backdoors.

cs.LG↗

Learned convex regularizers for inverse problems

We consider the variational reconstruction framework for inverse problems and propose to learn a data-adaptive input-convex neural network (ICNN) as the regularization functional. The ICNN-based convex regularizer is trained adversarially to discern ground-truth images from unregularized reconstructions. Convexity of the regularizer is desirable since (i) one can establish analytical convergence guarantees for the corresponding variational reconstruction problem and (ii) devise efficient and provable algorithms for reconstruction. In particular, we show that the optimal solution to the variational problem converges to the ground-truth if the penalty parameter decays sub-linearly with respect to the norm of the noise. Further, we prove the existence of a sub-gradient-based algorithm that leads to a monotonically decreasing error in the parameter space with iterations. To demonstrate the performance of our approach for solving inverse problems, we consider the tasks of deblurring natural images and reconstructing images in computed tomography (CT), and show that the proposed convex regularizer is at least competitive with and sometimes superior to state-of-the-art data-driven techniques for inverse problems.

cs.LG↗