Self-supervised learning (SSL) methods aim to exploit the abundance of unlabelled data for machine learning (ML), however the underlying principles are often method-specific. An SSL framework derived from biological first principles of embodied learning could unify the various SSL methods, help elucidate learning in the brain, and possibly improve ML. SSL commonly transforms each training datapoint into a pair of views, uses the knowledge of this pairing as a positive (i.e.

We study online change point detection problems under the constraint of local differential privacy (LDP) where, in particular, the statistician does not have access to the raw data. As a concrete problem, we study a multivariate nonparametric regression problem. At each time point t, the raw data are assumed to be of the form (Xt,Yt), where Xt is a d-dimensional feature vector and Yt is a response variable. Our primary aim is to detect changes in the regression function mt(x) = E(Yt|Xt = x) as soon as the change occurs. We provide algorithms which respect the LDP constraint, which control the false alarm probability, and which detect changes with a minimal (minimax rate-optimal) delay. To quantify the cost of privacy, we also present the optimal rate in the benchmark, non-private setting. These non-private results are also new to the literature and thus are interesting per se. In addition, we study the univariate mean online change point detection problem, under privacy constraints. This serves as the blueprint of studying more complicated private change point detection problems.

Algorithm 1 Association Graph Learning (TRAININGTIME) Require: {Dtrt }Tt=1: Training sets of all tasks; T: Number of tasks; C: Number of all classes; E: Shared feature extractor; WT,WC: Parameters of metric functions in the association graph; L: Number of GNN layers; {Wl}Ll=1: Parameters of all GNN layers; {ft}Tt=1: Task-specific classifiers; λ: Learning rate. For clarity, we provide the algorithms during training and test in Algorithm 1 and Algorithm 2, respectively. Algorithm 2 Association Graph Learning (TESTTIME) Require: xt: one test instance from the t-th task; E: Trained the feature extractor; GT,GC: Trained task and class graph; L: Number of GNN layers; {Wl}Ll=1: Trained parameters of all GNN layers; ft: The trained task-specific classifier. In this section, we provide the class assignment of all datasets under different missing rates. Table B.1, B.2, B.3 shows the class assignment for Office-Home, Office-Caltechand ImageCLEF, respectively.

In this paper, we focus on multi-task classification, where related classification tasks share the same label space and are learned simultaneously. In particular, we tackle a new setting, which is more realistic than currently addressed in the literature, where categories shift from training to test data. Hence, individual tasks do not contain complete training data for the categories in the test set. To generalize to such test data, it is crucial for individual tasks to leverage knowledge from related tasks. To this end, we propose learning an association graph to transfer knowledge among tasks for missing classes.