Asia
Training Uncertainty
The first subset (in red) is utilized to evaluate a traditional accuracy-basedlossfunction `a,suchasthecrossentropy. This benchmark is based on a loss function designed to incentivize the trained model to produce the smallest possible conformal prediction sets with the desired coverage (e.g., 90% ifฮฑ = 0.1). The hybrid training procedure is similar to Algorithm 1, in the sense that it relies on analogous soft-sorting, soft-ranking, and soft-indexing algorithms toevaluate adifferentiable approximation Wi oftheconformity scoreWi in(8). Above, the second equality follows directly from the fact thatS(x,U;ฯ,t), defined in (A2), is by construction increasing in t, and therefore Y / S(x,U;ฯ,1 ฮฑ) if and only if min{t [0,1]:Y S(x,U;ฯ,t)}>1 ฮฑ. The proof consists of showing that`a and`u are separately minimized by หฯ = ฯ,although only approximately inthelatter case.
ICNet: Intra-saliencyCorrelationNetworkfor Co-SaliencyDetection
Specifically, we adopt normalized masked average pooling (NMAP) to extract latent intra-saliency categories from the SISMs and semantic features as intra cues. Then we employ a correlation fusion module (CFM) to obtain inter cues by exploiting correlations between the intra cues and single-image features. To improve Co-SOD performance, we propose a category-independent rearranged self-correlation feature(RSCF)strategy.
8c64bc3f7796d31caa7c3e6b969bf7da-Paper-Conference.pdf
Deep active learning aims to reduce the annotation cost for the training of deep models, which is notoriously data-hungry. Until recently, deep active learning methods were ineffectual inthelow-budgetregime, where only asmall number ofexamples areannotated. Thesituation hasbeen alleviated byrecent advances inrepresentation andself-supervised learning, which impart thegeometry ofthe data representation with rich information about the points.