For the experiments described in Section 3.5 of the main paper, all methods which required a Bayesian These residuals are obtained by first training a separate classifier per each class, and then calculating the residual as the error between the predicted and ground truth class. Training Hyperparameters For each method, we used a batch size of 128 and a learning rate of 0.001. Each method was trained until convergence for 200 epochs. To validate that our "non-noisy" class conditioning approach is RBCC, and the class ordering implies that each class is predicted before its parent classes. Results are shown in Figure 1.

Recurrent Classifier Chains (RCCs), a recurrent neural network extension of ensemble-based classifier chains, are the state-of-the-art exact multi-label classification method for maximizing subset accuracy.

Discrimination in machine learning often arises along multiple dimensions (a.k.a.

Since the VB algorithm does not depend on the unknown truth to achieve optimality, our results shed light on effective prior choices.

By combining robust regression and prior information, we develop an effective robust regression method that can resist adaptive adversarial attacks. Due to the widespread existence of noise and data corruption, it is necessary to recover the true regression parameters when a certain proportion of the response variables have been corrupted. Methods to overcome this problem often involve robust least-squares regression. However, few methods achieve good performance when dealing with severe adaptive adversarial attacks. Based on the combination of prior information and robust regression via hard thresholding from [ 1 ], this paper proposes an algorithm that improves the breakdown point when facing adaptive adversarial attacks. Furthermore, to improve the robustness and reduce the estimation error caused by the inclusion of a prior, the idea of Bayesian reweighting is used to construct a more robust algorithm. We prove the theoretical convergence of proposed algorithms under mild conditions. Extensive experiments show that, under different dataset attacks, our algorithms achieve state-of-the-art results compared with other benchmark algorithms, demonstrating the robustness of the proposed approach.