Open-world barely-supervised learning via augmented pseudo labels

Zhongnian Li; Yanyan Ding; Meng Wei; Xinzheng Xu; Zhongnian Li; Yanyan Ding; Meng Wei; Xinzheng Xu

doi:10.3934/era.2024268

Electronic Research Archive

2024, Volume 32, Issue 10: 5804-5818. doi: 10.3934/era.2024268

Previous Article Next Article

Research article

Open-world barely-supervised learning via augmented pseudo labels

1.
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221116, China
2.
Mine Digitization Engineering Research Center of the Ministry of Education, China University of Mining and Technology, Xuzhou 221116, China
3.
State Key Lab for Novel Software Technology, Nanjing University, Nanjing 220023, China

Received: 08 September 2024 Revised: 16 October 2024 Accepted: 16 October 2024 Published: 25 October 2024

Open-world semi-supervised learning (OWSSL) has received significant attention since it addresses the issue of unlabeled data containing classes not present in the labeled data. Unfortunately, existing OWSSL methods still rely on a large amount of labeled data from seen classes, overlooking the reality that a substantial amount of labels is difficult to obtain in real scenarios. In this paper, we explored a new setting called open-world barely-supervised learning (OWBSL), where only a single label was provided for each seen class, greatly reducing labeling costs. To tackle the OWBSL task, we proposed a novel framework that leveraged augmented pseudo-labels generated for the unlabeled data. Specifically, we first generated initial pseudo-labels for the unlabeled data using visual-language models. Subsequently, to ensure that the pseudo-labels remained reliable while being updated during model training, we enhanced them using predictions from weak data augmentation. This way, we obtained the augmented pseudo-labels. Additionally, to fully exploit the information from unlabeled data, we incorporated consistency regularization based on strong and weak augmentations into our framework. Our experimental results on multiple benchmark datasets demonstrated the effectiveness of our method.

Keywords:

Citation: Zhongnian Li, Yanyan Ding, Meng Wei, Xinzheng Xu. Open-world barely-supervised learning via augmented pseudo labels[J]. Electronic Research Archive, 2024, 32(10): 5804-5818. doi: 10.3934/era.2024268

Related Papers:

[1]	Yinwan Cheng, Chao Yang, Bing Yao, Yaqin Luo . Neighbor full sum distinguishing total coloring of Halin graphs. AIMS Mathematics, 2022, 7(4): 6959-6970. doi: 10.3934/math.2022386
[2]	Baolin Ma, Chao Yang . Distinguishing colorings of graphs and their subgraphs. AIMS Mathematics, 2023, 8(11): 26561-26573. doi: 10.3934/math.20231357
[3]	Ningge Huang, Lily Chen . AVD edge-colorings of cubic Halin graphs. AIMS Mathematics, 2023, 8(11): 27820-27839. doi: 10.3934/math.20231423
[4]	Huifen Ge, Shumin Zhang, Chengfu Ye, Rongxia Hao . The generalized 4-connectivity of folded Petersen cube networks. AIMS Mathematics, 2022, 7(8): 14718-14737. doi: 10.3934/math.2022809
[5]	Kai An Sim, Kok Bin Wong . On the cooling number of the generalized Petersen graphs. AIMS Mathematics, 2024, 9(12): 36351-36370. doi: 10.3934/math.20241724
[6]	Fugang Chao, Donghan Zhang . Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions. AIMS Mathematics, 2023, 8(6): 13637-13646. doi: 10.3934/math.2023692
[7]	Bana Al Subaiei, Ahlam AlMulhim, Abolape Deborah Akwu . Vertex-edge perfect Roman domination number. AIMS Mathematics, 2023, 8(9): 21472-21483. doi: 10.3934/math.20231094
[8]	Yanyi Li, Lily Chen . Injective edge coloring of generalized Petersen graphs. AIMS Mathematics, 2021, 6(8): 7929-7943. doi: 10.3934/math.2021460
[9]	Ali Raza, Mobeen Munir, Tasawar Abbas, Sayed M Eldin, Ilyas Khan . Spectrum of prism graph and relation with network related quantities. AIMS Mathematics, 2023, 8(2): 2634-2647. doi: 10.3934/math.2023137
[10]	Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850

Abstract

1. Preliminaries

Let $G$ be a simple, non-trivial connected graph with vertex set $V(G)$ . For any two distinct vertices $u$ and $v$ in $G$ , $u$ - $v$ geodesic is a shortest walk between $u$ and $v$ without repetition of vertices. Two vertices are said to be adjacent if there is an edge between them, and they are also called neighbors of each other. The collection of all the neighbors of a vertex $v$ in $G$ is called the (open) neighborhood of $v$ , denoted by $N(v)$ .

A vertex $v$ of $G$ distinguishes a pair $(x, y)$ of distinct vertices of $G$ , if the number of edges in $v$ - $x$ geodesic is different from the number of edge in $v$ - $y$ geodesic. If $(x, y)$ is a pair of neighbors in $G$ , then $v$ is said to be adjacently distinguish the pair $(x, y)$ . Equivalently, a vertex $v$ adjacently distinguishes a pair $(x, y)$ of two neighbors if the difference between the number of edges in $v$ - $x$ geodesic and the number of edges in $v$ - $y$ geodesic is one.

A set $D \subseteq V(G)$ is a distinguishing set (metric generator) for $G$ if the members of $D$ distinguish every pair of distinct vertices in $G$ . The cardinality of a smallest distinguishing set for $G$ is called the metric dimension of $G$ , denoted by $dim(G)$ ^[7,23]. The concept of distinguishing set was introduced, very firstly, by Blumenthal ^[5] in the general context of metric spaces. It was later rediscovered and studied, in the context of graphs, by Slater with the name locating set/reference set ^[23]. Independently, Harary and Melter studied distinguishing set as resolving set (metric generator) ^[7,20]. Applications of this notion to the navigation of robots in networks are discussed in ^[13,21], and applications to pharmaceutical chemistry in ^[10,11]. For more details about the theory and applications of this notion, we refer the readers to the papers cited in ^{[3,5,8,9,12,13,14,15,19,22]} and the references therein.

A set $A \subseteq V(G)$ is a neighbor-distinguishing set (local metric generator) for $G$ if the members of $A$ adjacently distinguish every pair of neighboring (adjacent) vertices in $G$ . The cardinality of a smallest neighbor-distinguishing set for $G$ is called the adjacency (local) metric dimension of $G$ , and we denote it by $dim_a(G)$ .

The problem of distinguishing every two neighbors with the aid of distance (the number of edges in a geodesic) in a connected graph was introduced and studied by Okamoto et al. in 2010 ^[16]. Then, up till now, this notion endlessly received remarkable interest of many researchers working with distance in graphs. In 2015 and 2018, every two neighbors in the corona product of graphs are distinguished ^[6,18], while this problem for strong product and lexicographic product of graphs was solved in 2016 ^[4] and in 2018 ^[2,6], respectively. Using the neighbor-distinguishing problem of primary subgraphs, this problem was solved for the super graphs of these subgraphs in 2015 ^[17]. In 2018, Salman et al. proposed linear programming formulation for this problem and distinguished neighbors in two families of convex polytopes ^[19]. Recently, in 2019, split graphs of complete and complete bipartite graphs have been considered in the context of this problem ^[1]. Due to this noteworthy attention of researchers to this problem, we extend this study towards a very renowned family of generalized Petersen graphs in this article. Next, we state two results, proved by Okamoto et al. ^[16], and Salman et al. ^[19], respectively, which will be used in the sequel.

Theorem 1. ^[16] Let $G$ be a non-trivial connected graph of order $n$ . Then $dim_a(G)$ $= n-1$ if and only if $G$ is a complete graph, and $dim_a(G) = 1$ if and only if $G$ is a bipartite graph.

Proposition 2. ^[19] A subset $A$ of vertices in a connected graph $G$ is a neighbor-distinguishing set for $G$ if and only if for every $u\in V(G)$ and for each $v\in N(u)$ , the pair $(u, v)$ adjacently distinguished by some element of $A$ .

Watkins, in $1969$ ^[24], generalized the eminent Petersen graph, and proposed the notation $P(n, m)$ to this generalized family, where $n \geq 3$ and $1 \leq m \leq \lfloor \frac{n-1}{2} \rfloor$ . $P(n, m)$ is a cubic graph having the set

$V(P(n, m)) = \{ u_{1} , u_{2} , \dots, u_{n} , v_{1} , v_{2} , \dots, v_{n} \}$

as the vertex set, and the set

$E(P(n, m)) = \bigcup\limits_{i = 1}^{n}\left\{u_ix, v_iy\; ;\; x\in N(u_i), \; y \in N(v_i)\right\}$

as the edge set, where $N(u_i) = \{u_{i+1}, u_{i-1}, v_i \}$ and $N(v_i) = \{u_i, v_{i+m}, v_{i-m} \}$ for each $1 \leq i \leq n$ , and the indices greater than $n$ or less than $1$ will be taken modulo $n$ . Vertices $u_i$ and $v_i$ $(1 \leq i \leq n)$ are called the outer vertices and inner vertices, respectively, in $P(n, m)$ . Figure 1 depicts graphs to two different families of generalized Petersen graphs.

Figure 1. Generalized Petersen graphs

$P(15, 4)$ and

$P(16, 7)$ .

DownLoad: Full-Size Img PowerPoint

The rest of the paper is divided into two sections: one is on the family of generalized Petersen graphs $P(n, 4)$ ; and the second is on the family of generalized Petersen graphs $P(2n, n-1)$ . These families have been considered in the context of metric dimension problem by Naz et al. ^[15] and Ahmad et al. ^[3], respectively. Here, we solve the neighbor-distinguishing problem for these families.

2. Family of generalized Petersen graphs $P(n, 4)$

In the next result, we show that only two vertices of $P(n, 4)$ perform the neighbor-distinguishing.

Theorem 3. For $n\geq 9$ , let $G$ be a generalized Petersen graph $P(n, 4)$ , then a neighbor-distinguishing set for $G$ is a $2$ -element subset of $V(G)$ .

Proof. For $n = 9$ , it is an easy exercise to see that the set $A = \{v_1, v_2 \}$ is a neighbor-distinguishing set for $G$ . For $n\geq 10$ , let $A$ be a $2$ -element subset of $V(G)$ . Then, according to Proposition 2, we would perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . Note that, if $x \in A$ , then $(x, y)$ is adjacently distinguished, because the number of edges in $y-x$ geodesic is $1$ , while the number of edges in $x-x$ geodesic is $0$ . Now, we discuss the following eight cases:

Case 1: ( $n = 8k$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 3.

Further, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 1. List of the number of edges in geodesics from the outer vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic
$u_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 4k+3$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $4\leq i \leq 5k+1$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $2\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+3\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $3\leq i \leq 5k$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+1\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$
$u_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+8}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+11}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 5k+1$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $5k+2\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+2$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$	$\frac{n-i+6}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+2$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$	$\frac{n-i+5}{4}$
$u_i- a_2$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+7}{4}$	$\frac{i+2}{4}$	$\frac{i+5}{4}$
$u_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+6}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+9}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$u_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+3}{4}$	$\frac{i+6}{4}$	$\frac{i+9}{4}$
$u_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+5}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+11}{4}$	$\frac{n-i+8}{4}$
$u_i- a_2$ , $2\leq i \leq 5k+1$	$\frac{i+4}{4}$	$\frac{i+7}{4}$	$\frac{i+6}{4}$	$\frac{i+1}{4}$
$u_i- a_2$ , $5k+4\leq i \leq n$	$\frac{n-i+13}{4}$	$\frac{n-i+10}{4}$	$\frac{n-i+7}{4}$	$\frac{n-i+12}{4}$

| Show Table

DownLoad: CSV

Table 2. List of the number of edges in geodesics from the inner vertices to

$a \in A$ in

$P(n, 4)$ .

Geodesic	The number of edges in the geodesic.
$v_i-a$	$i \equiv 0$ (mod 4)	$i \equiv 1$ (mod 4)	$i \equiv 2$ (mod 4)	$i \equiv 3$ (mod 4)
$n = 8k$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i - a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i - a_1$ , $4k+2\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i - a_2$ , $3\leq i \leq 4k+3$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+4\leq i \leq n$	$\frac{n-i+16}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$
$n = 8k+1$ with $k\geq 2$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $4\leq i \leq 4k$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$
$n = 8k+2$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $2\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+11\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+3$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+10\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $3\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+8\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$
$n = 8k+4$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_4 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+4\leq i \leq n$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$
$v_i- a_2$ , $3\leq i \leq 5k+2$	$\frac{i-4}{4}$	$\frac{i+7}{4}$	$\frac{i+10}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $5k+3\leq i \leq n$	$\frac{n-i+4}{4}$	$\frac{n-i+17}{4}$	$\frac{n-i+18}{4}$	$\frac{n-i+15}{4}$
$n = 8k+5$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 4k+1$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $4k+6\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+2$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $4k+7\leq i \leq n$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$	$\frac{n-i+2}{4}$
$n = 8k+6$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_2 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+2$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$	$\frac{n-i+1}{4}$
$v_i- a_2$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i+11}{4}$	$\frac{i-2}{4}$	$\frac{i+9}{4}$
$v_i- a_2$ , $3k+15\leq i \leq n$	$\frac{n-i+2}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+16}{4}$	$\frac{n-i+13}{4}$
$n = 8k+7$ with $k\geq 1$ , and $A = \{v_1 = a_1, v_3 = a_2\}$
$v_i- a_1$ , $1\leq i \leq 3k+3$	$\frac{i+12}{4}$	$\frac{i-1}{4}$	$\frac{i+10}{4}$	$\frac{i+13}{4}$
$v_i- a_1$ , $3k+14\leq i \leq n$	$\frac{n-i+1}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+15}{4}$	$\frac{n-i+12}{4}$
$v_i- a_2$ , $2\leq i \leq 4k+1$	$\frac{i+8}{4}$	$\frac{i+11}{4}$	$\frac{i+10}{4}$	$\frac{i-3}{4}$
$v_i- a_2$ , $4k+12\leq i \leq n$	$\frac{n-i+17}{4}$	$\frac{n-i+14}{4}$	$\frac{n-i+3}{4}$	$\frac{n-i+16}{4}$

| Show Table

DownLoad: CSV

Case 2: ( $n = 8k+1$ with $k\geq 2$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3,

● the number of edges in $u_3-a_2$ geodesic is 2.

Further, – provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 3.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+2 \equiv 2 (mod \ 4)$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$
$j$	$1$	$2$	$3$	$4k+1 \equiv 1 (mod \ 4)$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_j$	$4$	$4$	$3$	$k+1$	$k+3$	$k+3$	$k$	$k$

| Show Table

DownLoad: CSV

Case 3: ( $n = 8k+2$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 4.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+3 \equiv 3 (mod \ 4)$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$
$\lambda_j$	$3$	$0$	$\frac{5k}{4}$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+8}{4}$

| Show Table

DownLoad: CSV

Case 4: ( $n = 8k+3$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 2.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 5.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$-$	$-$
$\lambda_i$	$\frac{5k}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{3k+8}{4}$	$-$	$-$
$j$	$1$	$2$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7\equiv 3 (mod \ 4)$
$\lambda_j$	$4$	$3$	$k+1$	$k$	$k+3$	$k+3$	$k$	$k+1$

| Show Table

DownLoad: CSV

Case 5: ( $n = 8k+4$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_4 = a_2\}$ , then

● the number of edges in $v_1-a_2$ geodesic is 4,

● the number of edges in $v_2-a_2$ geodesic is 4,

● the number of edges in $u_1-a_2$ geodesic is 3,

● the number of edges in $u_2-a_2$ geodesic is 3.

Moreover, and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Case 6: ( $n = 8k+5$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $u_1-a_2$ geodesic is 2,

● the number of edges in $v_1-a_2$ geodesic is 3.

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 6.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$
$\lambda_i$	$k+1$	$k+4$	$k+4$	$k+1$
$j$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$
$\lambda_j$	$k+1$	$k+4$	$k+4$	$k+1$

| Show Table

DownLoad: CSV

Case 7: ( $n = 8k+6$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_2 = a_2\}$ , then

● the number of edges in $v_{3k+3}-a_1$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ ,

● the number of edges in $v_{3k+4}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 0 (mod \ 4)$ ,

● the number of edges in $u_{4k+3}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+4}-a_2$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_2$ geodesic is $k+3$ ,

● the number of edges in $u_{4k+6}-a_2$ geodesic is $k+2$ .

Further, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 7.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+6}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$
$j$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$	$3k+14 \equiv 2 (mod \ 4)$
$\lambda_j$	$\frac{3k+16}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{5k}{4}$	$\frac{3k+20}{4}$	$\frac{3k+8}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$	$\frac{5k+8}{4}$	$\frac{3k+12}{4}$

| Show Table

DownLoad: CSV

Case 8: ( $n = 8k+7$ with $k\geq 1$ )

Let $A = \{v_1 = a_1, v_3 = a_2\}$ , then

● the number of edges in $v_{1}-a_2$ geodesic is $4$ ,

● the number of edges in $u_{4k+4}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{4k+5}-a_1$ geodesic is $k+2$ ,

● the number of edges in $u_{1}-a_2$ geodesic is $3$ ,

● the number of edges in $u_{5k+2}-a_2$ geodesic is $\frac{3k+12}{4} \equiv 2 (mod \ 4)$ ,

● the number of edges in $u_{5k+3}-a_2$ geodesic is $\frac{5k+4}{4} \equiv 3 (mod \ 4)$ .

Moreover, , and provide the lists of number of edges in $x-a_1$ and $x-a_2$ geodesics for all $x \in V(G)-A$ .

Table 8.

$\lambda_i$ is the number of edges in a

$v_i-a_1$ geodesic, and

$\lambda_j$ is the number of edges in a

$v_j-a_2$ geodesic.

$i$	$3k+4 \equiv 0 (mod \ 4)$	$3k+5 \equiv 1 (mod \ 4)$	$3k+6 \equiv 2 (mod \ 4)$	$3k+7 \equiv 3 (mod \ 4)$	$3k+8 \equiv 0 (mod \ 4)$	$3k+9 \equiv 1 (mod \ 4)$	$3k+10 \equiv 2 (mod \ 4)$	$3k+11 \equiv 3 (mod \ 4)$	$3k+12 \equiv 0 (mod \ 4)$	$3k+13 \equiv 1 (mod \ 4)$
$\lambda_i$	$\frac{5k+4}{4}$	$\frac{3k+4}{4}$	$\frac{3k+16}{4}$	$\frac{3k+20}{4}$	$\frac{5k}{4}$	$\frac{3k+8}{4}$	$\frac{3k+8}{4}$	$\frac{5k+12}{4}$	$\frac{5k+8}{4}$	$\frac{5k-4}{4}$
$j$	$4k+2 \equiv 2 (mod \ 4)$	$4k+3 \equiv 3 (mod \ 4)$	$4k+4 \equiv 0 (mod \ 4)$	$4k+5 \equiv 1 (mod \ 4)$	$4k+6 \equiv 2 (mod \ 4)$	$4k+7 \equiv 3 (mod \ 4)$	$4k+8 \equiv 0 (mod \ 4)$	$4k+9 \equiv 1 (mod \ 4)$	$4k+10 \equiv 2 (mod \ 4)$	$4k+11 \equiv 3 (mod \ 4)$
$\lambda_j$	$k+2$	$k$	$k+3$	$k+4$	$k+1$	$k+1$	$k+4$	$k+3$	$k$	$k+2$

| Show Table

DownLoad: CSV

In all of these eight cases, for $y \in N(x)$ , if we denote

● the number of edges in $x-a_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-a_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-a_2$ geodesic by $\alpha_2$ ,

● the number of edges in $y-a_2$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $a_1 \in A$ or $a_2 \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 4. For $n\geq 9$ , if $G$ is a generalized Petersen graph $P(n, 4)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 3.

3. Family of generalized Petersen graphs $P(2n, n-1)$

The results of this section provide the solution of the problem of neighbor-distinguishing in the generalized Petersen graphs $P(2n, n-1)$ .

Theorem 5. For all $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then the set $A = \{u_1, v_{n-1} \}$ is a neighbor-distinguishing set for $G$ .

Proof. According to Proposition 2, we have to perform neighbor-distinguishing for each pair $(x, y)$ , where $x \in V(G)$ and $y \in N(x)$ . When $x \in A$ , then the pair $(x, y)$ adjacently distinguished by $x$ , because the number of edges in $y-x$ geodesic is $1$ while the number of edges in $x-x$ geodesic is $0$ . Further, provides the list of number of edges in $x-u_1$ and $x-v_{n-1}$ geodesics for all $x \in V(G)-A$ .

Table 9. List of the number of edges in

$x-a$ geodesics for

$x \in V(G)-A$ and

$a \in A$ .

Geodesic	The number of edges in the geodesics
When $n = 2k+1$ , $k\geq 1$
For $i$ /geodesics	$u_i- u_1$	$u_i- v_{n-1}$	$v_i- u_1$ $i$ is odd	$v_i- u_1$ $i$ is even	$v_i- v_{n-1}$ $i$ is odd	$v_i- v_{n-1}$ $i$ is even
$1 \leq i \leq k-1$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$k \leq i \leq k+1$	$i-1$	$2k-i+1$	$i$	$i$	$2k-i+2$	$2k-i$
$i = k+2$	$\frac{n+1}{2}$	$k-1$	$\frac{n+1}{2}$	$\frac{n+1}{2}$	$2k-i+2$	$2k-i$
$k+3 \leq i \leq 2k$	$2k-i+4$	$2k-i+1$	$2k-i+3$	$2k-i+3$	$2k-i+2$	$2k-i$
$i = 2k+1$	$i-2k+2$	$i-2k+1$	$i-2k+1$	$i-2k+1$	$i-2k+2$	$i-2k+2$
$i = 2k+2$	$4$	$i-n+2$	$3$	$3$	$i-2k$	$i-2k$
$2k+3 \leq i \leq 3k$	$i-2k$	$i-2k+1$	$i-2k-1$	$i-2k-1$	$i-2k+2$	$i-2k$
$i = 3k+1$	$i-2k$	$i-n+1$	$i-n$	$i-n$	$k+2$	$k$
$i = 3k+2$	$\frac{n+1}{2}$	$k$	$i-n$	$i-n$	$k+1$	$k-1$
$3k+3 \leq i \leq 4k$	$2n-i+1$	$4k-i+2$	$2n-i+2$	$2n-i+2$	$4k-i+3$	$4k-i+1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$
When $n = 2k$ , $k\geq 2$
$1 \leq i \leq k-2$	$i-1$	$i+2$	$i$	$i$	$i+3$	$i+1$
$i = k-1$	$i-1$	$n-i$	$i$	$i$	$k$	$k$
$k \leq i \leq k+1$	$i-1$	$n-i$	$i$	$i$	$2k-i-1$	$2k-i+1$
$i = k+2$	$i-1$	$n-i$	$\frac{n}{2}$	$\frac{n}{2}$	$n-i-1$	$n-i+1$
$k+3 \leq i \leq 2k-1$	$2k-i+3$	$2k-i$	$2k-i+2$	$2k-i+2$	$2k-i-1$	$2k-i+1$
$i = 2k$	$3$	$2$	$2$	$2$	$3$	$3$
$i = 2k+1$	$4$	$3$	$3$	$3$	$2$	$2$
$2k+2 \leq i \leq 3k-2$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$i-2k+1$	$i-2k+3$
$i = 3k-1$	$i-2k+1$	$i-2k+2$	$i-2k$	$i-2k$	$k$	$k$
$3k \leq i \leq 3k+1$	$2n-i+1$	$4k-i$	$i-2k$	$i-2k$	$4k-i+1$	$4k-i-1$
$i = 3k+2$	$k-1$	$k-2$	$\frac{n}{2}$	$\frac{n}{2}$	$4k-i+1$	$4k-i-1$
$3k+3 \leq i \leq 4k-2$	$2n-i+1$	$4k-i$	$2n-i+2$	$2n-i+2$	$4k-i+1$	$4k-i-1$
$i = 2n-1$	$2$	$3$	$3$	$3$	$4$	$4$
$i = 2n$	$1$	$2$	$2$	$2$	$1$	$1$

| Show Table

DownLoad: CSV

Now, for any $y\in N(x)$ , if we denote

● the number of edges in $x-u_1$ geodesic by $\alpha_1$ ,

● the number of edges in $y-u_1$ geodesic by $\beta_1$ ,

● the number of edges in $x-v_{n-1}$ geodesic by $\alpha_2$ ,

● the number of edges in $y-v_{n-1}$ geodesic by $\beta_2$ ,

then it can be seen that

$\rm{either}\; \; |\alpha_1-\beta_1| = 1\; \; \rm{whenever}\; \; \alpha_2 = \beta_2, \; \; \rm{or}\; \; |\alpha_2 - \beta_2| = 1\; \; \rm{whenever}\; \; \alpha_1 = \beta_1,$

which implies that either $u_1 \in A$ or $v_{n-1} \in A$ adjacently distinguishes the pair $(x, y)$ . Hence, $A$ is a neighbor-distinguishing set for $G$ .

Theorem 6. For $n\geq 3$ , if $G$ is a generalized Petersen graph $P(2n, n-1)$ , then $dim_a(G) = 2$ .

Proof. Since $dim_a(G) = 1$ if and only if $G$ is a bipartite graph, by Theorem 1. So $dim_a(G)\geq 2$ , because $G$ is not a bipartite graph. Hence, we get the required result, by Theorem 5.

4. Conclusions

Distinguishing every two vertices in a graph is an eminent problem in graph theory. Many graph theorists have been shown remarkable interest to solve this problem with the aid of distance (the number of edges in a geodesic) from last four decades. Using the technique of finding geodesics between vertices, we solved the problem of distinguishing every two neighbors in generalized Petersen graphs $P(n, 4)$ and $P(2n, n-1)$ . We investigated that, in both the families of generalized Petersen graphs, only two vertices are adequate to distinguish every two neighbors.

Acknowledgments

The authors are grateful to the editor and anonymous referees for their comments and suggestions to improve the quality of this article. This research is supported by Balochistan University of Engineering and Technology Khuzdar, Khuzdar 89100, Pakistan.

Conflict of interest

The authors declare that they have no conflict of interest.

References

[1]	D. Berthelot, N. Carlini, I. Goodfellow, N. Papernot, A. Oliver, C. A. Raffel, Mixmatch: A holistic approach to semi-supervised learning, Adv. Neural Inf. Process. Syst., 32 (2019).
[2]	D. Berthelot, N. Carlini, E. D. Cubuk, A. Kurakin, K. Sohn, H. Zhang, et al., Remixmatch: Semi-supervised learning with distribution alignment and augmentation anchoring, preprint, arXiv: 1911.09785. https://doi.org/10.48550/arXiv.1911.09785
[3]	Z. Peng, S. Tian, L. Yu, D. Zhang, W. Wu, S. Zhou, Semi-supervised medical image classification with adaptive threshold pseudo-labeling and unreliable sample contrastive loss, Biomed. Signal Process. Control, 79 (2023), 104142. https://doi.org/10.1016/j.bspc.2022.104142 doi: 10.1016/j.bspc.2022.104142
[4]	Y. Wang, H. Wang, Y. Shen, J. Fei, W. Li, G. Jin, et al., Semi-Supervised Semantic Segmentation Using Unreliable Pseudo-Labels, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2022), 4238–4247. https://doi.org/10.1109/CVPR52688.2022.00421
[5]	H. Xu, L. Liu, Q. Bian, Z. Yang, Semi-supervised semantic segmentation with prototype-based consistency regularization, Adv. Neural Inf. Process. Syst., 35 (2022), 26007–26020.
[6]	H. Mai, R. Sun, T. Zhang, F. Wu, RankMatch: Exploring the better consistency regularization for semi-supervised semantic segmentation, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2024), 3391–3401. https://doi.org/10.1109/CVPR52733.2024.00326
[7]	H. Wang, Z. Zhang, J. Gao, W. Hu, A-teacher: Asymmetric network for 3D semi-supervised object detection, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2024), 14978–14987. https://doi.org/10.1109/CVPR52733.2024.01419
[8]	M. Xu, Z. Zhang, H. Hu, J. Wang, L. Wang, F. Wei, et al., End-to-end semi-supervised object detection with soft teacher, in Proceedings of the IEEE/CVF International Conference on Computer Vision, (2021), 3060–3069. https://doi.org/10.1109/ICCV48922.2021.00305
[9]	J. Zhang, X. Lin, W. Zhang, K. Wang, X. Tan, J. Han, et al., Semi-detr: Semi-supervised object detection with detection transformers, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2023), 23809–23818. https://doi.org/10.1109/CVPR52729.2023.02280
[10]	T. Sosea, C. Caragea, MarginMatch: Improving semi-supervised learning with pseudo-margins, in IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2023), 15773–15782. https://doi.org/10.1109/CVPR52729.2023.01514
[11]	Y. Wang, H. Chen, Q. Heng, W. Hou, Y. Fan, Z. Wu, et al., FreeMatch: Self-adaptive thresholding for semi-supervised learning, in The Eleventh International Conference on Learning Representations, 2023.
[12]	K. Cao, M. Brbic, J. Leskovec, Open-world semi-supervised learning, preprint, arXiv: 2102.03526. https://doi.org/10.48550/arXiv.2102.03526
[13]	L. Guo, Y. Zhang, Z. Wu, J. Shao, Y. Li, Robust semi-supervised learning when not all classes have labels, Adv. Neural Inf. Process. Syst., 35 (2022), 3305–3317.
[14]	A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, et al., Learning transferable visual models from natural language supervision, in International Conference on Machine Learning, 139 (2021), 8748–8763.
[15]	D. H. Lee, Pseudo-label: The simple and efficient semi-supervised learning method for deep neural networks, in Workshop on Challenges in Representation Learning, ICML, 3 (2013), 896.
[16]	P. Cascante-Bonilla, F. Tan, Y. Qi, V. Ordonez, Curriculum Labeling: Revisiting Pseudo-Labeling for Semi-Supervised Learning, in Proceedings of the AAAI Conference on Artificial Intelligence, 35 (2021), 6912–6920. https://doi.org/10.1609/aaai.v35i8.16852
[17]	J. Hu, C. Chen, L. Cao, S. Zhang, A. Shu, J. Jiang, et al., Pseudo-label alignment for semi-supervised instance segmentation, in Proceedings of the IEEE/CVF International Conference on Computer Vision, (2023), 16337–16347. https://doi.org/10.1109/ICCV51070.2023.01497
[18]	J. Li, C. Xiong, S. C. Hoi, Comatch: Semi-supervised learning with contrastive graph regularization, in Proceedings of the IEEE/CVF International Conference on Computer Vision, (2021), 9475–9484. https://doi.org/10.1109/ICCV48922.2021.00934
[19]	E. Arazo, D. Ortego, P. Albert, N. E. O'Connor, K. McGuinness, Pseudo-labeling and confirmation bias in deep semi-supervised learning, in Proceedings of the 2020 International Joint Conference on Neural Networks, (2020), 1–8. https://doi.org/10.1109/ijcnn48605.2020.9207304
[20]	S. Laine, T. Aila, Temporal ensembling for semi-supervised learning, preprint, arXiv: 1610.02242. https://doi.org/10.48550/arXiv.1610.02242
[21]	A. Tarvainen, H. Valpola, Mean teachers are better role models: Weight-averaged consistency targets improve semi-supervised deep learning results, Adv. Neural Inf. Process. Syst., 30 (2017).
[22]	Q. Xie, Z. Dai, E. Hovy, T. Luong, Q. Le, Unsupervised Data Augmentation for Consistency Training, Adv. Neural Inf. Process. Syst., 33 (2020), 6256–6268.
[23]	Y. Fan, A. Kukleva, D. Dai, B. Schiele Revisiting consistency regularization for semi-supervised learning, Int. J. Comput. Vision, 131 (2023), 626–643. https://doi.org/10.1007/s11263-022-01723-4 doi: 10.1007/s11263-022-01723-4
[24]	K. Sohn, D. Berthelot, N. Carlini, Z. Zhang, H. Zhang, C. A. Raffel, et al., Fixmatch: Simplifying semi-supervised learning with consistency and confidence, Adv. Neural Inf. Process. Syst., 33 (2020), 596–608.
[25]	B. Zhang, Y. Wang, W. Hou, H. Wu, J. Wang, M. Okumura, et al., Flexmatch: Boosting semi-supervised learning with curriculum pseudo labeling, Adv. Neural Inf. Process. Syst., 34 (2021), 18408–18419.
[26]	I. Nassar, M. Hayat, E. Abbasnejad, H. Rezatofighi, G. Haffari, Protocon: Pseudo-label refinement via online clustering and prototypical consistency for efficient semi-supervised learning, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2023), 11641–11650. https://doi.org/10.1109/CVPR52729.2023.01120
[27]	Y. Chen, X. Tan, B. Zhao, Z. Chen, R. Song, J. Liang, et al., Boosting semi-supervised learning by exploiting all unlabeled data, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2023), 7548–7557. https://doi.org/10.1109/CVPR52729.2023.00729
[28]	J. Park, S. Yun, J. Jeong, J. Shin, Opencos: Contrastive semi-supervised learning for handling open-set unlabeled data, in European Conference on Computer Vision, (2022), 134–149. https://doi.org/10.1007/978-3-031-25063-7_9
[29]	S. Mo, J. Su, C. Ma, M. Assran, I. Misra, L. Yu, et al., Ropaws: Robust semi-supervised representation learning from uncurated data, preprint, arXiv: 2302.14483. https://doi.org/10.48550/arXiv.2302.14483
[30]	T. Lucas, P. Weinzaepfel, G. Rogez, Barely-supervised learning: Semi-supervised learning with very few labeled images, in Thirty-Sixth AAAI Conference on Artificial Intelligence, (2022), 1881–1889. https://doi.org/10.1609/aaai.v36i2.20082
[31]	G. Gui, Z. Zhao, L. Qi, L. Zhou, L. Wang, Y. Shi, Improving barely supervised learning by discriminating unlabeled samples with super-class, Adv. Neural Inf. Process. Syst., 35 (2022), 19849–19860.
[32]	Y. Sun, Y. Li, Opencon: Open-world contrastive learning, preprint, arXiv: 2208.02764. https://doi.org/10.48550/arXiv.2208.02764
[33]	M. N. Rizve, N. Kardan, M. Shah, Towards realistic semi-supervised learning, in European Conference on Computer Vision, (2022), 437–455. https://doi.org/10.1007/978-3-031-19821-2_25
[34]	Y. Wang, Z. Zhong, P. Qiao, X. Cheng, X. Zheng, C. Liu, et al., Discover and align taxonomic context priors for open-world semi-supervised learning, Adv. Neural Inf. Process. Syst., 36 (2024).
[35]	S. Vaze, K. Han, A. Vedaldi, A. Zisserman, Generalized category discovery, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2022), 7492–7501. https://doi.org/10.1109/CVPR52688.2022.00734
[36]	X. Wen, B. Zhao, X. Qi, Parametric classification for generalized category discovery: A baseline study, in Proceedings of the IEEE/CVF International Conference on Computer Vision, (2023), 16590–16600. https://doi.org/10.1109/ICCV51070.2023.01521
[37]	B. Zhao, X. Wen, K. Han, Learning semi-supervised gaussian mixture models for generalized category discovery, in Proceedings of the IEEE/CVF International Conference on Computer Vision, (2023), 16623–16633. https://doi.org/10.1109/ICCV51070.2023.01524
[38]	K. Zhou, J. Yang, C. C. Loy, Z. Liu, Learning to prompt for vision-language models, Int. J. Comput. Vision, 130 (2022), 2337–2348. https://doi.org/10.1007/s11263-022-01653-1 doi: 10.1007/s11263-022-01653-1
[39]	K. Zhou, J. Yang, C. C. Loy, Z. Liu, Conditional prompt learning for vision-language models, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2022), 16816–16825. https://doi.org/10.1109/CVPR52688.2022.01631
[40]	P. Gao, S. Geng, R. Zhang, T. Ma, R. Fang, Y. Zhang, et al., Clip-adapter: Better vision-language models with feature adapters, Int. J. Comput. Vision, 132 (2024), 581–595. https://doi.org/10.1007/s11263-023-01891-x doi: 10.1007/s11263-023-01891-x
[41]	R. Zhang, R. Fang, W. Zhang, P. Gao, K. Li, J. Dai, et al., Tip-adapter: Training-free clip-adapter for better vision-language modeling, preprint, arXiv: 2111.03930. https://doi.org/10.48550/arXiv.2111.03930
[42]	A. Krizhevsky, Learning Multiple Layers of Features from Tiny Images, Master's thesis, University of Tront, 2009.
[43]	Y. Le, X. Yang, Tiny ImageNet Visual Recognition Challenge, CS 231N, 7 (2015), 3.
[44]	F. Li, F. Rob, P. Pietro, Learning generative visual models from few training examples: An incremental bayesian approach tested on 101 object categories, in 2004 Conference on Computer Vision and Pattern Recognition Workshop, (2004), 178–178. https://doi.org/10.1016/j.cviu.2005.09.012
[45]	L. Bossard, M. Guillaumin, L. V. Gool, Food-101-mining discriminative components with random forests, in ECCV 2014, (2014), 446–461. https://doi.org/10.1007/978-3-319-10599-4_29
[46]	I. Loshchilov, F. Hutter, Decoupled weight decay regularization, preprint, arXiv: 1711.05101. https://doi.org/10.48550/arXiv.1711.05101
[47]	E. D. Cubuk, B. Zoph, J. Shlens, Q. V. Le, Randaugment: Practical automated data augmentation with a reduced search space, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, (2020), 702–703. https://doi.org/10.1109/CVPRW50498.2020.00359
[48]	T. DeVries, Improved regularization of convolutional neural networks with cutout, preprint, arXiv: 1708.04552. https://doi.org/10.48550/arXiv.1708.04552
[49]	H. Wang, G. Pang, P. Wang, L. Zhang, W. Wei, Y.Zhang, Glocal energy-based learning for few-shot open-set recognition, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, (2023), 7507–7516. https://doi.org/10.1109/CVPR52729.2023.00725

This article has been cited by:

莉周, Vertex Reducible Edge (Total) Coloring of Two Classes of Generalized Petersen Graph, 2023, 13, 2160-7583, 1851, 10.12677/PM.2023.136188

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Electronic Research Archive

1 1.7

Metrics

Article views(758) PDF downloads(38) Cited by(0)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

Figures and Tables

Figures(2) / Tables(7)

Electronic Research Archive

Open-world barely-supervised learning via augmented pseudo labels

Related Papers:

Abstract

1. Preliminaries

2. Family of generalized Petersen graphs $P(n, 4)$

3. Family of generalized Petersen graphs $P(2n, n-1)$

4. Conclusions

Acknowledgments

Conflict of interest

References

This article has been cited by:

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Catalog

Electronic Research Archive

Open-world barely-supervised learning via augmented pseudo labels

Related Papers:

Abstract

1. Preliminaries

2. Family of generalized Petersen graphs P(n,4) P(n, 4)

3. Family of generalized Petersen graphs P(2n,n−1) P(2n, n-1)

4. Conclusions

Acknowledgments

Conflict of interest

References

This article has been cited by:

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Figures and Tables

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog

2. Family of generalized Petersen graphs $P(n, 4)$

3. Family of generalized Petersen graphs $P(2n, n-1)$