--- title: Classification-Predictor Network (ClPr) url: https://www.emergentmind.com/topics/classification-predictor-network-clpr type: topic --- # Classification-Predictor Network (ClPr) Classification-Predictor Network (ClPr) is not a single standardized architecture in the arXiv literature. Rather, the label is used for several related constructions in which a classification signal is coupled to a predictive, routing, or inferential objective. In short-term gaze prediction, ClPr denotes a multitask sequence model that jointly classifies eye-movement events and predicts future gaze positions; in adaptive image restoration, it denotes a classifier that predicts restoration difficulty and selects a sparsity level; in neural architecture search, it denotes a predictor of final classification accuracy conditioned on architecture and dataset difficulty; in uncertainty estimation, it denotes a classifier paired with an auxiliary loss predictor; and in Bayesian connectomics it can refer to a classification framework whose predictor is itself a network-valued object [2509.07126] [2211.05488] [1806.00250] [2502.20375] [2009.11401]. Taken together, these usages indicate that ClPr is best understood as a family of classification-conditioned prediction mechanisms rather than as a unique model class. ## 1. Terminological scope and core design idea Across the cited literature, the common structure is a coupling between a discrete or probabilistic classification output and a second predictive task. The secondary task varies by domain: forecasting gaze trajectories, selecting a sparse restoration branch, estimating architecture accuracy, predicting incurred loss, or regressing a response from network-valued predictors. What remains stable is the use of classification-related structure to improve another inference problem, or conversely the use of auxiliary prediction to audit or route classification. | Context | Role of ClPr | Representative paper | |---|---|---| | Gaze forecasting | Joint event classification and gaze prediction | [2509.07126] | | Image restoration | Difficulty classifier for dynamic N:M branch selection | [2211.05488] | | Architecture search | Train-less predictor of peak validation accuracy | [1806.00250] | | Uncertainty estimation | Classifier plus auxiliary loss predictor | [2502.20375] | | Network classification | Classifier with a network-valued predictor | [2009.11401] | This breadth matters methodologically. In some settings, classification is an auxiliary supervisory signal that enriches temporal representation learning. In others, it is a routing variable that determines computational allocation. In still others, prediction is about the classifier itself: its future accuracy, its expected loss, or the effect of structured predictors on class labels. A plausible implication is that the term has evolved functionally, with its meaning determined by where the classification signal enters the computational graph and what prediction target it conditions. ## 2. Multitask ClPr for short-term gaze prediction In "Short-Term Gaze Prediction: Analysis of Individual Differences, Typical and Extreme-Case Errors" [2509.07126], ClPr is a multitask time-series forecasting model for raw eye-tracking data without IMU or scene-image inputs. The task is short-term gaze prediction at a sampling rate of 90 Hz on the Meta Quest Pro, with a main prediction horizon of 44 ms and supplementary analyses at 22 ms and 66 ms. Input window sizes were treated as hyperparameters over 6–20 samples, and the final model text reports an optimized ClPr input length of 12 samples, while the computational table reports input shape $(3,16)$; this suggests minor configuration differences between optimization and benchmarking runs. The model jointly performs event classification over time and position prediction over time. Its shared trunk consists of a Temporal Convolutional Network encoder, an LSTM module, and an attention-plus-pooling stage. It then branches into a regression head that predicts continuous position differences for the next prediction interval and a classification head that outputs categorical event labels. The forecasting target is positional differences rather than absolute gaze position, $$ \Delta x_{t+PI} = x_{t+PI} - x_t,\qquad \Delta y_{t+PI} = y_{t+PI} - y_t. $$ The best-performing modality for time-series forecasting was reported as \([ \text{velocities}, \text{heading angle} ]\), and ClPr uses \([ \text{velocities}, \text{heading angle}, \text{classification labels} ]\) as inputs while predicting \([ \text{positional differences}, \text{classification labels} ]\). Event labels derive from a modified MNH algorithm adapted from EyeLink 1000 usage at 1000 Hz to 90 Hz Quest Pro data. Evaluation focuses on fixations, saccades split by amplitude, and post-saccadic periods ("ceps"), with small saccades defined as \(< 2^\circ\), large saccades as \(> 2^\circ\), short fixations as \(< 400\) ms, long fixations as \(> 400\) ms, and ceps defined as the 110 ms interval after saccade offset. Smooth pursuit is not part of these RAN tasks. The reported regression objective is the mean Euclidean distance over forecasted steps, $$ e_t = \sqrt{(x_t-\hat{x}_t)^2 + (y_t-\hat{y}_t)^2},\qquad L_{\text{pred}} = \frac{1}{T}\sum_{t=1}^{T}\|\hat{g}_t-g_t\|_2. $$ The paper does not explicitly report the classification loss or multitask weighting, although it notes Adam optimization with learning rate \(0.0003\), batch size \(32\), sliding-window sampling, and PyTorch Lightning training management. The empirical picture is event dependent. On average, LSTM was most accurate overall and generally best for fixations and saccades, whereas TF and ClPr were best on average for ceps. For extreme-case behavior measured via \(P_{95}\), TF was most accurate for ceps and event-agnostic tails, LSTM was best for large saccades and often fixations, and ClPr was competitive but not typically the top \(P_{95}\) model. ClPr performed better as the prediction horizon decreased, and subject-level rankings differed between \(P_{50}\) and \(P_{95}\), especially for ceps and small saccades. Computationally, ClPr has 467.72k parameters, 5.15 MMac, and 0.6855 ms inference time per input sample on an NVIDIA RTX A4000 with CUDA 12.2. The principal trade-off identified is that the classification step adds latency and label dependency, making deployment in strict real-time pipelines more demanding. ## 3. ClPr as a difficulty predictor in dynamic image restoration In "ClassPruning: Speed Up Image Restoration Networks by Dynamic N:M Pruning" [2211.05488], ClPr corresponds to the paper’s Classifier Module. Here the function of ClPr is not to classify semantic content but to predict restoration difficulty and thereby select an appropriate sparse subnetwork. The input is a degraded image \(y\), the classifier outputs a softmax vector \([p_1(y),\ldots,p_L(y)]\), and the selected class $$ i=\arg\max_k p_k(y) $$ determines which restoration branch \(f^R_i\) processes the image. The paper uses \(L=3\) capacity tiers: dense \(4{:}4\), medium-sparse \(2{:}4\), and high-sparse \(1{:}4\), with easy inputs routed to the most pruned branch and hard inputs to the dense branch. The ClPr architecture is a lightweight CNN comprising four Conv-BatchNorm-ReLU blocks, global average pooling, and a fully connected layer followed by softmax. For initial supervised pretraining, the model uses pseudo labels constructed differently by task. In deblurring, degraded samples \(y_i\) are formed by averaging adjacent blurry frames, $$ y_i=\sum_{j=1}^{N_i} y_j. $$ In denoising, deraining, and dehazing, the degradation residual \(R=y-x\) is binned by variance and rescaled according to the median variance of a class, $$ R_i = \frac{R\sqrt{\operatorname{Var}(R_i^m)}}{\sqrt{\operatorname{Var}[R]}},\qquad y_i=x+R_i. $$ The pretraining loss is cross-entropy, $$ L_{\text{cls}}=-\sum_k y_k^*\log p_k(y). $$ End-to-end optimization introduces two additional loss terms. The entropy term $$ L_E=\sum_{i=1}^{L} -p_i(y)\log p_i(y) $$ sharpens confidence and stabilizes convergence, while the cost term $$ L_C=\sum_{i=1}^{L} p_i(y) C_i $$ encourages the use of cheaper branches when reconstruction is adequate. Reconstruction is handled by the weighted \(L_1\) objective $$ L_W=\sum_{i=1}^{L} p_i(y)\,\|f^R_i(y)-x\|_1, $$ and the final objective is $$ L_F=\omega_1 L_W+\omega_2 L_E+\omega_3 L_C. $$ Training proceeds in three stages: pretrain ClPr with cross-entropy on pseudo-labeled data, freeze ClPr and train the restoration module with \(L_W\), then unfreeze all parameters and finetune with \(L_F\). The restoration branches are derived by dynamic N:M fine-grained structured pruning. For each contiguous group \(G\) of \(M\) weights, the top-\(N\) magnitudes are retained and the remainder are zeroed: $$ w' = m\odot w,\qquad \sum_j m_j=N. $$ Because pruning is non-differentiable, the method uses SR-STE for backpropagation, and because different pruning ratios induce different feature statistics, it assigns separate BatchNorm parameters to each branch via Variable BatchNorm. Empirically, the paper reports that ClassPruning can help existing methods save approximately 40% FLOPs while maintaining performance. Representative examples include DnCNN on BSD68, where FLOPs fall from 87.28G to 50.88G while PSNR changes from 31.63 to 31.59 dB at \(\sigma=15\), and SRN on GoPro, where FLOPs fall from 217.2G to 131.8G with PSNR changing from 30.21 to 30.18. The main limitation is routing sensitivity: misclassification of difficulty can send hard inputs to overly sparse branches and degrade restoration quality. ## 4. Train-less ClPr for neural architecture search In "TAPAS: Train-less Accuracy Predictor for Architecture Search" [1806.00250], the ClPr concept is instantiated as a model that predicts the peak validation accuracy a neural architecture would achieve on a dataset without training that candidate architecture. Formally, the predictor maps an architecture encoding \(\mathbf{x}\) and a dataset-difficulty scalar \(d\) to a predicted accuracy, $$ \hat{A}=f(\mathbf{x}, d;\theta). $$ The system combines three components: Dataset Characterization, a Lifelong Database of Experiments, and the Train-less Accuracy Predictor. Dataset difficulty is summarized by the Dataset Characterization Number (DCN), defined as the peak accuracy of a small Deep normalized ProbeNet trained for 10 epochs: $$ d := \mathrm{DCN}(D)=\max_{1\le t\le 10} A^{\text{probe}}_t \in [0,1]. $$ The DCN is used both to condition the predictor directly and to filter relevant past experiments from the Lifelong Database of Experiments according to $$ \left\lVert \mathrm{DCN}(\hat{D})-\mathrm{DCN}(D_j)\right\rVert \le \tau,\qquad \tau=0.05. $$ The predictor itself is iterative. It uses layer-wise and sub-network encodings, initializes with random-guess accuracy \(\hat{A}_0=1/N_c\), and updates accuracy predictions layer by layer: $$ \hat{A}_{i+1}=f([\mathbf{x}_i,\mathbf{x}_{i+1}], d;\theta). $$ The architecture encoding includes layer type, output/input height ratio, output/input depth ratio, number of weights, total number of layers so far, inference FLOPs estimate, inference memory estimate, and a running accuracy field. TAP uses two stacked LSTMs, with 50 hidden units in the first and 100 in the second, followed by a sigmoid output layer. It is trained with RMSprop at learning rate \(10^{-3}\), batch size 512, HeNormal initialization, and feature-wise standardization. The training database is substantial: 19 datasets, 800 sampled architectures per dataset, and incremental training of subnetworks to supply accuracy targets. The reported contribution is speed and cross-dataset calibration. TAPAS predicts in fractions of a second, exceeds 100 networks per second on a single GPU, and supports simulated evolution with 20,000 mutations in 400 seconds on one GPU. In the reported searches, the best discovered networks reach 93.67% accuracy for CIFAR-10 and 81.01% for CIFAR-100 after verification training. Scenario C, which evaluates unseen-dataset prediction across 11 real datasets, shows that including DCN and pre-filtering the experiment database by \(\tau=0.05\) improves mean squared error, Kendall’s Tau, and \(R^2\) relative to variants without DCN or without pre-filtering. In this usage, ClPr is a meta-predictor over classifier architectures rather than a component inside a single end-task classifier. ## 5. ClPr as classifier–loss-predictor coupling In "When does a predictor know its own loss?" [2502.20375], ClPr denotes a classifier paired with an auxiliary loss predictor. The classifier \(f\) outputs a predictive distribution, while the loss predictor \(g\) estimates the loss that \(f\) will incur on an input. For a binary predictor \(p:X\to[0,1]\) and a proper loss \(\ell\), the paper uses the decomposition $$ \ell(y,v)=H_\ell(v)+(y-v)H'_\ell(v), $$ with $$ H_\ell(v)=\mathbb{E}_{y\sim \operatorname{Ber}(v)}[\ell(y,v)],\qquad H'_\ell(v)=\ell(1,v)-\ell(0,v). $$ The baseline loss predictor is the self-entropy predictor, $$ SEP(p(x))=H_\ell(p(x)), $$ which corresponds, in the multiclass cross-entropy setting, to the entropy of the predicted distribution. Loss prediction quality is measured by expected squared error on realized losses, and improvement over the self-estimate is quantified by the advantage $$ adv(LP)=\mathbb{E}\big[(\ell(y,p(x))-SEP(p(x)))^2\big]-\mathbb{E}\big[(\ell(y,p(x))-LP(\phi(p,x)))^2\big]. $$ The theoretical contribution is a tight connection between nontrivial loss prediction and multicalibration. Multicalibration error is defined as $$ \MCE(\mathcal{C},p):=\max_{c\in\mathcal{C}} \left|\mathbb{E}_{x,y\sim \mathcal{D}}[(y-p(x))c(\phi(p,x))]\right|, $$ and the main theorem states $$ \frac{1}{2}\max_{LP\in\mathcal{F}} adv(LP)\le \MCE(\mathcal{C},p)\le \sqrt{\max_{LP\in\mathcal{F}'} adv(LP)}. $$ Accordingly, a loss predictor that substantially beats the classifier’s own entropy estimate witnesses a multicalibration failure, and a multicalibration violation can be converted into a loss predictor with nonzero advantage. The paper distinguishes prediction-only, input-aware, and representation-aware loss predictors, depending on whether \(\phi(p,x)\) includes only the output score, the input features, or also internal or external representations. It also identifies blind spots: for strictly proper losses such as squared loss and binary cross-entropy, \(H'_\ell(p)=0\) at \(p=1/2\), so violations at those scores are not exposed by that loss. Empirically, experiments on UCI Credit Default and Bank Marketing show a robust positive correlation between subgroup multicalibration error and the efficacy of training a loss predictor. In this formulation, ClPr is not a routing or multitask forecast model, but an uncertainty-estimation construct in which prediction targets the classifier’s own future loss. ## 6. Network-valued predictors and Bayesian ClPr In "High Dimensional Bayesian Network Classification with Network Global-Local Shrinkage Priors" [2009.11401], the phrase corresponds to a classification framework in which the predictor is an observed network. For subject \(i\), the response is binary, \(y_i\in\{0,1\}\), and the predictor is an undirected weighted network \(G_i\) represented by an adjacency matrix \(A_i\). Stacking the upper-triangular entries yields an edge feature vector \(x_i\in\mathbb{R}^p\), and the classification model is logistic regression, $$ y_i\sim \operatorname{Bernoulli}(\pi_i),\qquad \operatorname{logit}(\pi_i)=\alpha + x_i^\top \beta. $$ Equivalently, with a symmetric coefficient matrix \(B\), $$ \eta_i=\alpha+\langle B,A_i\rangle = \alpha+\sum_{1\le u