Pith. sign in

REVIEW 4 cited by

Conditional Mutual Information Constrained Deep Learning for Classification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.09123 v1 pith:XZUMJN5V submitted 2023-09-17 cs.LG cs.AI

classification cs.LGcs.AI
keywords ncmilearningdeepconditionalconstrainedinformationmutualstandard
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The concepts of conditional mutual information (CMI) and normalized conditional mutual information (NCMI) are introduced to measure the concentration and separation performance of a classification deep neural network (DNN) in the output probability distribution space of the DNN, where CMI and the ratio between CMI and NCMI represent the intra-class concentration and inter-class separation of the DNN, respectively. By using NCMI to evaluate popular DNNs pretrained over ImageNet in the literature, it is shown that their validation accuracies over ImageNet validation data set are more or less inversely proportional to their NCMI values. Based on this observation, the standard deep learning (DL) framework is further modified to minimize the standard cross entropy function subject to an NCMI constraint, yielding CMI constrained deep learning (CMIC-DL). A novel alternating learning algorithm is proposed to solve such a constrained optimization problem. Extensive experiment results show that DNNs trained within CMIC-DL outperform the state-of-the-art models trained within the standard DL and other loss functions in the literature in terms of both accuracy and robustness against adversarial attacks. In addition, visualizing the evolution of learning process through the lens of CMI and NCMI is also advocated.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning to Adapt Frozen CLIP for Few-Shot Test-Time Domain Adaptation

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A parallel side network with reverted attention learns dataset-specific visual knowledge to complement frozen CLIP, and a greedy text ensemble improves class semantics for few-shot test-time domain adaptation.

  2. Going Beyond Feature Similarity: Effective Dataset Distillation based on Class-Aware Conditional Mutual Information

    cs.CV 2024-12 conditional novelty 6.0 of 10

    A class-conditional mutual information penalty, added as a plug-in regularizer, improves accuracy and convergence speed of existing dataset distillation methods on CIFAR, Tiny-ImageNet, and ImageNet.

  3. Distributed Quasi-Newton Method for Fair and Fast Federated Learning

    cs.LG 2025-01 reject novelty 5.0 of 10

    DQN-Fed updates a global model in a direction that makes every client's loss decrease at a rate tied to its local quasi-Newton step, with claimed linear-quadratic convergence.

  4. Improving Open-Set Semantic Segmentation in 3D Point Clouds by Conditional Channel Capacity Maximization: Preliminary Results

    cs.CV 2025-05 reject novelty 4.0 of 10

    A proposed mutual-information regularizer for point-cloud segmentation reports big gains on held-out classes, but the evaluation protocol trains on those classes, so it does not demonstrate open-set detection.

Pith tools