8137716344

Committed 22 Jan 2024 10:53PM UTC coverage: 98.47%. Remained the same

Build # 8137716344

Build Type

push

github

Committed by

web-flow

Commit Message

Bump pillow from 10.1.0 to 10.2.0 in /tests (#718)

Bumps [pillow](https://github.com/python-pillow/Pillow) from 10.1.0 to 10.2.0.
- [Release notes](https://github.com/python-pillow/Pillow/releases)
- [Changelog](https://github.com/python-pillow/Pillow/blob/main/CHANGES.rst)
- [Commits](https://github.com/python-pillow/Pillow/compare/10.1.0...10.2.0)

---
updated-dependencies:
- dependency-name: pillow
  dependency-type: direct:production
...

Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>

Run Details

3475 of 3529 relevant lines covered (98.47%)

7.22 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

99.07

/foolbox/attacks/gen_attack.py

from typing import Optional, Any, Tuple, Union
import numpy as np
import eagerpy as ep

from ..devutils import atleast_kd

from ..models import Model

from ..criteria import TargetedMisclassification

from ..distances import linf

from .base import FixedEpsilonAttack
from .base import T
from .base import get_channel_axis
from .base import raise_if_kwargs
from .base import verify_input_bounds
import math

from .gen_attack_utils import rescale_images


class GenAttack(FixedEpsilonAttack):
    """A black-box algorithm for L-infinity adversarials. [#Alz18]_

    This attack is performs a genetic search in order to find an adversarial
    perturbation in a black-box scenario in as few queries as possible.

    References:
        .. [#Alz18] Moustafa Alzantot, Yash Sharma, Supriyo Chakraborty, Huan Zhang,
           Cho-Jui Hsieh, Mani Srivastava,
           "GenAttack: Practical Black-box Attacks with Gradient-Free
           Optimization",
           https://arxiv.org/abs/1805.11090

    """

    def __init__(
        self,
        *,
        steps: int = 1000,
        population: int = 10,
        mutation_probability: float = 0.10,
        mutation_range: float = 0.15,
        sampling_temperature: float = 0.3,
        channel_axis: Optional[int] = None,
        reduced_dims: Optional[Tuple[int, int]] = None,
    ):
        self.steps = steps
        self.population = population
        self.min_mutation_probability = mutation_probability
        self.min_mutation_range = mutation_range
        self.sampling_temperature = sampling_temperature
        self.channel_axis = channel_axis
        self.reduced_dims = reduced_dims

    distance = linf

    def apply_noise(
        self,
        x: ep.TensorType,
        noise: ep.TensorType,
        epsilon: float,
        channel_axis: Optional[int],
    ) -> ep.TensorType:
        if noise.shape != x.shape and channel_axis is not None:
            # upscale noise

            noise = rescale_images(noise, x.shape, channel_axis)

        # clip noise to valid linf bounds
        noise = ep.clip(noise, -epsilon, +epsilon)

        # clip to image bounds
        return ep.clip(x + noise, 0.0, 1.0)

    def choice(
        self, a: int, size: Union[int, ep.TensorType], replace: bool, p: ep.TensorType
    ) -> Any:
        p_np: np.ndarray = p.numpy()
        x = np.random.choice(a, size, replace, p_np)  # type: ignore
        return x

    def run(
        self,
        model: Model,
        inputs: T,
        criterion: TargetedMisclassification,
        *,
        epsilon: float,
        **kwargs: Any,
    ) -> T:
        raise_if_kwargs(kwargs)
        x, restore_type = ep.astensor_(inputs)
        del inputs, kwargs

        verify_input_bounds(x, model)

        N = len(x)

        if isinstance(criterion, TargetedMisclassification):
            classes = criterion.target_classes
        else:
            raise ValueError("unsupported criterion")

        if classes.shape != (N,):
            raise ValueError(
                f"expected target_classes to have shape ({N},), got {classes.shape}"
            )

        noise_shape: Union[Tuple[int, int, int, int], Tuple[int, ...]]
        channel_axis: Optional[int] = None
        if self.reduced_dims is not None:
            if x.ndim != 4:
                raise NotImplementedError(
                    "only implemented for inputs with two spatial dimensions"
                    " (and one channel and one batch dimension)"
                )

            if self.channel_axis is None:
                maybe_axis = get_channel_axis(model, x.ndim)
                if maybe_axis is None:
                    raise ValueError(
                        "cannot infer the data_format from the model, please"
                        " specify channel_axis when initializing the attack"
                    )
                else:
                    channel_axis = maybe_axis
            else:
                channel_axis = self.channel_axis % x.ndim

            if channel_axis == 1:
                noise_shape = (x.shape[1], *self.reduced_dims)
            elif channel_axis == 3:
                noise_shape = (*self.reduced_dims, x.shape[3])
            else:
                raise ValueError(
                    "expected 'channel_axis' to be 1 or 3, got {channel_axis}"
                )
        else:
            noise_shape = x.shape[1:]  # pragma: no cover

        def is_adversarial(logits: ep.TensorType) -> ep.TensorType:
            return ep.argmax(logits, 1) == classes

        num_plateaus = ep.zeros(x, len(x))
        mutation_probability = (
            ep.ones_like(num_plateaus) * self.min_mutation_probability
        )
        mutation_range = ep.ones_like(num_plateaus) * self.min_mutation_range

        noise_pops = ep.uniform(
            x, (N, self.population, *noise_shape), -epsilon, epsilon
        )

        def calculate_fitness(logits: ep.TensorType) -> ep.TensorType:
            first = logits[range(N), classes]
            second = ep.log(ep.exp(logits).sum(1) - first)

            return first - second

        n_its_wo_change = ep.zeros(x, (N,))
        for step in range(self.steps):
            fitness_l, is_adv_l = [], []

            for i in range(self.population):
                it = self.apply_noise(x, noise_pops[:, i], epsilon, channel_axis)
                logits = model(it)
                f = calculate_fitness(logits)
                a = is_adversarial(logits)
                fitness_l.append(f)
                is_adv_l.append(a)

            fitness = ep.stack(fitness_l)
            is_adv = ep.stack(is_adv_l, 1)
            elite_idxs = ep.argmax(fitness, 0)

            elite_noise = noise_pops[range(N), elite_idxs]
            is_adv = is_adv[range(N), elite_idxs]

            # early stopping
            if is_adv.all():
                return restore_type(  # pragma: no cover
                    self.apply_noise(x, elite_noise, epsilon, channel_axis)
                )

            probs = ep.softmax(fitness / self.sampling_temperature, 0)
            parents_idxs = np.stack(
                [
                    self.choice(
                        self.population,
                        2 * self.population - 2,
                        replace=True,
                        p=probs[:, i],
                    )
                    for i in range(N)
                ],
                1,
            )

            new_noise_pops = [elite_noise]
            for i in range(self.population - 1):
                parents_1 = noise_pops[range(N), parents_idxs[2 * i]]
                parents_2 = noise_pops[range(N), parents_idxs[2 * i + 1]]

                # calculate crossover
                p = probs[parents_idxs[2 * i], range(N)] / (
                    probs[parents_idxs[2 * i], range(N)]
                    + probs[parents_idxs[2 * i + 1], range(N)]
                )
                p = atleast_kd(p, x.ndim)
                p = ep.tile(p, (1, *noise_shape))

                crossover_mask = ep.uniform(p, p.shape, 0, 1) < p
                children = ep.where(crossover_mask, parents_1, parents_2)

                # calculate mutation
                mutations = ep.stack(
                    [
                        ep.uniform(
                            x,
                            noise_shape,
                            -mutation_range[i].item() * epsilon,
                            mutation_range[i].item() * epsilon,
                        )
                        for i in range(N)
                    ],
                    0,
                )

                mutation_mask = ep.uniform(children, children.shape)
                mutation_mask = mutation_mask <= atleast_kd(
                    mutation_probability, children.ndim
                )
                children = ep.where(mutation_mask, children + mutations, children)

                # project back to epsilon range
                children = ep.clip(children, -epsilon, epsilon)

                new_noise_pops.append(children)

            noise_pops = ep.stack(new_noise_pops, 1)

            # increase num_plateaus if fitness does not improve
            # for 100 consecutive steps
            n_its_wo_change = ep.where(
                elite_idxs == 0, n_its_wo_change + 1, ep.zeros_like(n_its_wo_change)
            )
            num_plateaus = ep.where(
                n_its_wo_change >= 100, num_plateaus + 1, num_plateaus
            )
            n_its_wo_change = ep.where(
                n_its_wo_change >= 100, ep.zeros_like(n_its_wo_change), n_its_wo_change
            )

            mutation_probability = ep.maximum(
                self.min_mutation_probability,
                0.5 * ep.exp(math.log(0.9) * ep.ones_like(num_plateaus) * num_plateaus),
            )
            mutation_range = ep.maximum(
                self.min_mutation_range,
                0.4 * ep.exp(math.log(0.9) * ep.ones_like(num_plateaus) * num_plateaus),
            )

        return restore_type(self.apply_noise(x, elite_noise, epsilon, channel_axis))

1	from typing import Optional, Any, Tuple, Union	10✔
2	import numpy as np	10✔
3	import eagerpy as ep	10✔
4
5	from ..devutils import atleast_kd	10✔
6
7	from ..models import Model	10✔
8
9	from ..criteria import TargetedMisclassification	10✔
10
11	from ..distances import linf	10✔
12
13	from .base import FixedEpsilonAttack	10✔
14	from .base import T	10✔
15	from .base import get_channel_axis	10✔
16	from .base import raise_if_kwargs	10✔
17	from .base import verify_input_bounds	10✔
18	import math	10✔
19
20	from .gen_attack_utils import rescale_images	10✔
21
22
23	class GenAttack(FixedEpsilonAttack):	10✔
24	"""A black-box algorithm for L-infinity adversarials. [#Alz18]_
25
26	This attack is performs a genetic search in order to find an adversarial
27	perturbation in a black-box scenario in as few queries as possible.
28
29	References:
30	.. [#Alz18] Moustafa Alzantot, Yash Sharma, Supriyo Chakraborty, Huan Zhang,
31	Cho-Jui Hsieh, Mani Srivastava,
32	"GenAttack: Practical Black-box Attacks with Gradient-Free
33	Optimization",
34	https://arxiv.org/abs/1805.11090
35
36	"""
37
38	def __init__(	10✔
39	self,
40	*,
41	steps: int = 1000,
42	population: int = 10,
43	mutation_probability: float = 0.10,
44	mutation_range: float = 0.15,
45	sampling_temperature: float = 0.3,
46	channel_axis: Optional[int] = None,
47	reduced_dims: Optional[Tuple[int, int]] = None,
48	):
49	self.steps = steps	10✔
50	self.population = population	10✔
51	self.min_mutation_probability = mutation_probability	10✔
52	self.min_mutation_range = mutation_range	10✔
53	self.sampling_temperature = sampling_temperature	10✔
54	self.channel_axis = channel_axis	10✔
55	self.reduced_dims = reduced_dims	10✔
56
57	distance = linf	10✔
58
59	def apply_noise(	10✔
60	self,
61	x: ep.TensorType,
62	noise: ep.TensorType,
63	epsilon: float,
64	channel_axis: Optional[int],
65	) -> ep.TensorType:
66	if noise.shape != x.shape and channel_axis is not None:	2✔
67	# upscale noise
68
69	noise = rescale_images(noise, x.shape, channel_axis)	2✔
70
71	# clip noise to valid linf bounds
72	noise = ep.clip(noise, -epsilon, +epsilon)	2✔
73
74	# clip to image bounds
75	return ep.clip(x + noise, 0.0, 1.0)	2✔
76
77	def choice(	10✔
78	self, a: int, size: Union[int, ep.TensorType], replace: bool, p: ep.TensorType
79	) -> Any:
80	p_np: np.ndarray = p.numpy()	2✔
81	x = np.random.choice(a, size, replace, p_np) # type: ignore	2✔
82	return x	2✔
83
84	def run(	10✔
85	self,
86	model: Model,
87	inputs: T,
88	criterion: TargetedMisclassification,
89	*,
90	epsilon: float,
91	**kwargs: Any,
92	) -> T:
93	raise_if_kwargs(kwargs)	10✔
94	x, restore_type = ep.astensor_(inputs)	10✔
95	del inputs, kwargs	10✔
96
97	verify_input_bounds(x, model)	10✔
98
99	N = len(x)	10✔
100
101	if isinstance(criterion, TargetedMisclassification):	10✔
102	classes = criterion.target_classes	10✔
103	else:
104	raise ValueError("unsupported criterion")	8✔
105
106	if classes.shape != (N,):	10✔
107	raise ValueError(	8✔
108	f"expected target_classes to have shape ({N},), got {classes.shape}"
109	)
110
111	noise_shape: Union[Tuple[int, int, int, int], Tuple[int, ...]]
112	channel_axis: Optional[int] = None	10✔
113	if self.reduced_dims is not None:	10✔
114	if x.ndim != 4:	10✔
115	raise NotImplementedError(
116	"only implemented for inputs with two spatial dimensions"
117	" (and one channel and one batch dimension)"
118	)
119
120	if self.channel_axis is None:	10✔
121	maybe_axis = get_channel_axis(model, x.ndim)	10✔
122	if maybe_axis is None:	10✔
123	raise ValueError(	10✔
124	"cannot infer the data_format from the model, please"
125	" specify channel_axis when initializing the attack"
126	)
127	else:
128	channel_axis = maybe_axis	2✔
129	else:
130	channel_axis = self.channel_axis % x.ndim	10✔
131
132	if channel_axis == 1:	10✔
133	noise_shape = (x.shape[1], *self.reduced_dims)	2✔
134	elif channel_axis == 3:	10✔
135	noise_shape = (*self.reduced_dims, x.shape[3])	×
136	else:
137	raise ValueError(	10✔
138	"expected 'channel_axis' to be 1 or 3, got {channel_axis}"
139	)
140	else:
141	noise_shape = x.shape[1:] # pragma: no cover
142
143	def is_adversarial(logits: ep.TensorType) -> ep.TensorType:	2✔
144	return ep.argmax(logits, 1) == classes	2✔
145
146	num_plateaus = ep.zeros(x, len(x))	2✔
147	mutation_probability = (	2✔
148	ep.ones_like(num_plateaus) * self.min_mutation_probability
149	)
150	mutation_range = ep.ones_like(num_plateaus) * self.min_mutation_range	2✔
151
152	noise_pops = ep.uniform(	2✔
153	x, (N, self.population, *noise_shape), -epsilon, epsilon
154	)
155
156	def calculate_fitness(logits: ep.TensorType) -> ep.TensorType:	2✔
157	first = logits[range(N), classes]	2✔
158	second = ep.log(ep.exp(logits).sum(1) - first)	2✔
159
160	return first - second	2✔
161
162	n_its_wo_change = ep.zeros(x, (N,))	2✔
163	for step in range(self.steps):	2✔
164	fitness_l, is_adv_l = [], []	2✔
165
166	for i in range(self.population):	2✔
167	it = self.apply_noise(x, noise_pops[:, i], epsilon, channel_axis)	2✔
168	logits = model(it)	2✔
169	f = calculate_fitness(logits)	2✔
170	a = is_adversarial(logits)	2✔
171	fitness_l.append(f)	2✔
172	is_adv_l.append(a)	2✔
173
174	fitness = ep.stack(fitness_l)	2✔
175	is_adv = ep.stack(is_adv_l, 1)	2✔
176	elite_idxs = ep.argmax(fitness, 0)	2✔
177
178	elite_noise = noise_pops[range(N), elite_idxs]	2✔
179	is_adv = is_adv[range(N), elite_idxs]	2✔
180
181	# early stopping
182	if is_adv.all():	2✔
183	return restore_type( # pragma: no cover
184	self.apply_noise(x, elite_noise, epsilon, channel_axis)
185	)
186
187	probs = ep.softmax(fitness / self.sampling_temperature, 0)	2✔
188	parents_idxs = np.stack(	2✔
189	[
190	self.choice(
191	self.population,
192	2 * self.population - 2,
193	replace=True,
194	p=probs[:, i],
195	)
196	for i in range(N)
197	],
198	1,
199	)
200
201	new_noise_pops = [elite_noise]	2✔
202	for i in range(self.population - 1):	2✔
203	parents_1 = noise_pops[range(N), parents_idxs[2 * i]]	2✔
204	parents_2 = noise_pops[range(N), parents_idxs[2 * i + 1]]	2✔
205
206	# calculate crossover
207	p = probs[parents_idxs[2 * i], range(N)] / (	2✔
208	probs[parents_idxs[2 * i], range(N)]
209	+ probs[parents_idxs[2 * i + 1], range(N)]
210	)
211	p = atleast_kd(p, x.ndim)	2✔
212	p = ep.tile(p, (1, *noise_shape))	2✔
213
214	crossover_mask = ep.uniform(p, p.shape, 0, 1) < p	2✔
215	children = ep.where(crossover_mask, parents_1, parents_2)	2✔
216
217	# calculate mutation
218	mutations = ep.stack(	2✔
219	[
220	ep.uniform(
221	x,
222	noise_shape,
223	-mutation_range[i].item() * epsilon,
224	mutation_range[i].item() * epsilon,
225	)
226	for i in range(N)
227	],
228	0,
229	)
230
231	mutation_mask = ep.uniform(children, children.shape)	2✔
232	mutation_mask = mutation_mask <= atleast_kd(	2✔
233	mutation_probability, children.ndim
234	)
235	children = ep.where(mutation_mask, children + mutations, children)	2✔
236
237	# project back to epsilon range
238	children = ep.clip(children, -epsilon, epsilon)	2✔
239
240	new_noise_pops.append(children)	2✔
241
242	noise_pops = ep.stack(new_noise_pops, 1)	2✔
243
244	# increase num_plateaus if fitness does not improve
245	# for 100 consecutive steps
246	n_its_wo_change = ep.where(	2✔
247	elite_idxs == 0, n_its_wo_change + 1, ep.zeros_like(n_its_wo_change)
248	)
249	num_plateaus = ep.where(	2✔
250	n_its_wo_change >= 100, num_plateaus + 1, num_plateaus
251	)
252	n_its_wo_change = ep.where(	2✔
253	n_its_wo_change >= 100, ep.zeros_like(n_its_wo_change), n_its_wo_change
254	)
255
256	mutation_probability = ep.maximum(	2✔
257	self.min_mutation_probability,
258	0.5 * ep.exp(math.log(0.9) * ep.ones_like(num_plateaus) * num_plateaus),
259	)
260	mutation_range = ep.maximum(	2✔
261	self.min_mutation_range,
262	0.4 * ep.exp(math.log(0.9) * ep.ones_like(num_plateaus) * num_plateaus),
263	)
264
265	return restore_type(self.apply_noise(x, elite_noise, epsilon, channel_axis))	2✔

bethgelab / foolbox / 8137716344

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous