arXiv subjects

Yury Belousov

Publications and source records attributed to Yury Belousov.

23 records · Page 2Linked to original sources

arXiv2022

Authentication of Copy Detection Patterns under Machine Learning Attacks: A Supervised Approach

Copy detection patterns (CDP) are an attractive technology that allows manufacturers to defend their products against counterfeiting. The main assumption behind the protection mechanism of CDP is that these codes printed with the smallest symbol size (1x1) on an industrial printer cannot be copied or cloned with sufficient accuracy due to data processing inequality. However, previous works have shown that Machine Learning (ML) based attacks can produce high-quality fakes, resulting in decreased accuracy of authentication based on traditional feature-based authentication systems. While Deep Learning (DL) can be used as a part of the authentication system, to the best of our knowledge, none of the previous works has studied the performance of a DL-based authentication system against ML-based attacks on CDP with 1x1 symbol size. In this work, we study such a performance assuming a supervised learning (SL) setting.

cs.CR↗

arXiv2022

MineRL Diamond 2021 Competition: Overview, Results, and Lessons Learned

Reinforcement learning competitions advance the field by providing appropriate scope and support to develop solutions toward a specific problem. To promote the development of more broadly applicable methods, organizers need to enforce the use of general techniques, the use of sample-efficient methods, and the reproducibility of the results. While beneficial for the research community, these restrictions come at a cost -- increased difficulty. If the barrier for entry is too high, many potential participants are demoralized. With this in mind, we hosted the third edition of the MineRL ObtainDiamond competition, MineRL Diamond 2021, with a separate track in which we permitted any solution to promote the participation of newcomers. With this track and more extensive tutorials and support, we saw an increased number of submissions. The participants of this easier track were able to obtain a diamond, and the participants of the harder track progressed the generalizable solutions in the same task.

cs.LG↗

arXiv2021

Solving Black-Box Optimization Challenge via Learning Search Space Partition for Local Bayesian Optimization

Black-box optimization is one of the vital tasks in machine learning, since it approximates real-world conditions, in that we do not always know all the properties of a given system, up to knowing almost nothing but the results. This paper describes our approach to solving the black-box optimization challenge at NeurIPS 2020 through learning search space partition for local Bayesian optimization. We describe the task of the challenge as well as our algorithm for low budget optimization that we named \texttt{SPBOpt}. We optimize the hyper-parameters of our algorithm for the competition finals using multi-task Bayesian optimization on results from the first two evaluation settings. Our approach has ranked third in the competition finals.

cs.LG↗

arXiv2019

Hyperbolic knots are not generic

We show that the proportion of hyperbolic knots among all of the prime knots of $n$ or fewer crossings does not converge to $1$ as $n$ approaches infinity. Moreover, we show that if $K$ is a nontrivial knot then the proportion of satellites of $K$ among all of the prime knots of $n$ or fewer crossings does not converge to $0$ as $n$ approaches infinity.

math.GT↗

arXiv2018

Meander diagrams of knots and spatial graphs: proofs of generalized Jablan--Radović conjectures

We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there exists a plane diagram $D$ of $G$ such that (i) each edge of $G$ is represented by a simple arc of $D$ and (ii) each vertex of $G$ is represented by a point on the boundary of the convex hull of $D$. This generalizes the conjecture of S. Jablan and L. Radović stating that each knot has a meander diagram, i. e., a diagram composed of two simple arcs whose common endpoints lie on the boundary of the convex hull of the diagram. Also, we prove another conjecture of Jablan and Radović stating that each 2-bridge knot has a semi-meander minimal diagram, i. e., a minimal diagram composed of two simple arcs.

math.GT↗