Extending Momentum Contrast With Cross Similarity Consistency Regularization
نویسندگان
چکیده
Contrastive self-supervised representation learning methods maximize the similarity between positive pairs, and at same time tend to minimize negative pairs. However, in general interplay pairs is ignored as they do not put place special mechanisms treat differently according their specific differences similarities. In this paper, we present Extended Momentum Contrast (XMoCo), a method founded upon legacy of momentum-encoder unit proposed MoCo family configurations. To end, introduce cross consistency regularization loss, with which extend transformation dissimilar images (negative pairs). Under rule, argue that semantic representations associated any pair (positive or negative) should preserve cross-similarity under pretext transformations. Moreover, further regularize training loss by enforcing uniform distribution over across batch. The can easily be added existing algorithms plug-and-play fashion. Empirically, report competitive performance on standard Imagenet-1K linear head classification benchmark. addition, transferring learned common downstream tasks, show using XMoCo prevalently utilized augmentations lead improvements such tasks. We hope findings paper serve motivation for researchers take into consideration important among examples learning.
منابع مشابه
Extending GENET with lazy arc consistency
Constraint satisfaction problems (CSP's) naturally occur in a number of important industrial applications, such as planning, scheduling and resource allocation. GENET is a neural network simulator to solve binary constraint satisfaction problems. GENET uses a convergence procedure based on a relaxed form of local consistency to nd assignments which are locally minimal in terms of constraint vio...
متن کاملExtending Dual Arc Consistency
Comparisons between primal and dual approaches have recently been extensively studied and evaluated from a theoretical standpoint based on the amount of pruning achieved by each of these when applied to non-binary constraint satisfaction problems. Enforcing arc consistency on the dual encoding has been shown to strictly dominate enforcing GAC on the primal encoding (Stergiou & Walsh 1999). More...
متن کاملExtending Generalized Arc Consistency
Generalized arc consistency (GAC) is the most widely used local consistency in constraint programming. Several GAC algorithms for specific constraints, as well as generic algorithms that can be used on any constraint, have been proposed in the literature. Stronger local consistencies than GAC have also been studied but algorithms for such consistencies are generally considered too expensive. In...
متن کاملExtending EGENET with Lazy Constraint Consistency
Constraint satisfaction problems (CSPs) occur widely in real-life applications such as bin-packing, planning and scheduling. EGENET, a neural network simulator based on the min-connict heuristic, has had remarkable success in solving hard CSPs such as hard graph-colouring problems. Consistency techniques such as arc consistency have been extensively used to improve the search behaviour of compl...
متن کاملTrust Prediction with Propagation and Similarity Regularization
Online social networks have been used for a variety of rich activities in recent years, such as investigating potential employees and seeking recommendations of high quality services and service providers. In such activities, trust is one of the most critical factors for the decisionmaking of users. In the literature, the state-of-the-art trust prediction approaches focus on either dispositiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems for Video Technology
سال: 2022
ISSN: ['1051-8215', '1558-2205']
DOI: https://doi.org/10.1109/tcsvt.2022.3169145