Georgii Bychkov

Mr. Georgii Bychkov

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 September 2026 in Big Data and Cognitive Computing
Verified
Journal Article
Open access
PDF file
ADAndrey Dolgolenko
Andrey Dolgolenko
GBGeorgii Bychkov
Georgii Bychkov
Dmitriy VatolinDmitriy Vatolin
Dmitriy Vatolin
No-reference image quality assessment (NR-IQA) metrics are widely used to evaluate and train image and video processing algorithms, but the growing reliance on deep neural networks makes these metrics vulnerable to adversarial attacks. Among such attacks, transferable black-box methods are particularly relevant in real-world scenarios where the attacker cannot interact with the target metric to generate adversarial examples and must rely on a substitute white-box model. In this paper, we examine adversarial transferability across modern NR-IQA metrics and introduce two complementary techniques, Consensus-Guided Distillation (CGD) and Local Perceptual Attack (LPA), which together form a two-stage transferable attack pipeline. CGD distills an ensemble of NR-IQA metrics into a single white-box substitute, excluding training samples for which the teacher metrics show high disagreement, thereby improving transferability and reducing the computational cost of both training and attack generation. LPA optimizes adversarial examples over random multi-scale image partitions, encouraging perturbations to exploit local distortion-sensitive features shared across NR-IQA metrics. Experiments using 15 NR-IQA metrics and four datasets show that distillation substantially improves black-box transferability, while LPA consistently outperforms existing transferable attacks against NR-IQA metrics, both in increasing predicted quality scores and in reducing correlations with subjective quality scores. We also find that attack transferability depends strongly on the type of distortions present in the image, indicating that adversarial perturbations can conceal certain visual degradations from NR-IQA metrics.

30 April 2025 in Multimedia Systems
Verified
Journal Article
Closed access
PDF file
SLSergey Lavrushkin
Sergey Lavrushkin
MKMaxim Khrebtov
Maxim Khrebtov
AAAnastasia Antsiferova
Anastasia Antsiferova
GBGeorgii Bychkov
Georgii Bychkov
ASAlexey Soloviev
Alexey Soloviev
Dmitriy VatolinDmitriy Vatolin
Dmitriy Vatolin

21 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
GBGeorgii Bychkov
Georgii Bychkov
DDDarina Dvinskikh
Darina Dvinskikh
AAAnastasia Antsiferova
Anastasia Antsiferova
AGAlexander Gasnikov
Alexander Gasnikov
APAndrei Panteleev
Andrei Panteleev
We present a novel gradient-free algorithm to solve a convex stochastic optimization problem, such as those encountered in medicine, physics, and machine learning (e.g., adversarial multi-armed bandit problem), where the objective function can only be computed through numerical simulation, either as the result of a real experiment or as feedback given by the function evaluations from an adversary. Thus we suppose that only a black-box access to the function values of the objective is available, possibly corrupted by adversarial noise: deterministic or stochastic. The noisy setup can arise naturally from modeling randomness within a simulation or by computer discretization, or when exact values of function are forbidden due to privacy issues, or when solving non-convex problems as convex ones with an inexact function oracle. By exploiting higher-order smoothness, fulfilled, e.g., in logistic regression, we improve the performance of zero-order methods developed under the assumption of classical smoothness (or having a Lipschitz gradient). The proposed algorithm enjoys optimal oracle complexity and is designed under an overparameterization setup, i.e., when the number of model parameters is much larger than the size of the training dataset. Overparametrized models fit to the training data perfectly while also having good generalization and outperforming underparameterized models on unseen data. We provide convergence guarantees for the proposed algorithm under both types of noise. Moreover, we estimate the maximum permissible adversarial noise level that maintains the desired accuracy in the Euclidean setup, and then we extend our results to a non-Euclidean setup. Our theoretical results are verified on the logistic regression problem.