EnfoMax: Domain Entropy and Mutual Information Maximization for Domain Generalized Face Anti-spoofing
The face anti-spoofing (FAS) method performs well under intra-domain setups. However, its cross-domain performance is unsatisfactory. As a result, the domain generalization (DG) method has gained more attention in FAS. Existing methods treat FAS as a simple binary classification task and propose a heuristic training objective to learn domain-invariant features. However, there is no theoretical explanation of what a domain-invariant feature is. Additionally, the lack of theoretical support makes domain generalization techniques such as adversarial training lack training stability. To address these issues, this paper proposes the EnfoMax framework, which uses information theory to analyze cross-domain FAS tasks. This framework provides theoretical guarantees and optimization objectives for domain-generalized FAS tasks. EnfoMax maximizes the domain entropy and mutual information of live samples in source domains without using adversarial learning. Experimental results demonstrate that our approach performs well on extensive public datasets and outperforms state-of-the-art methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationContrastive LearningDomain GeneralizationFace Anti-SpoofingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
APS: Active Pretraining with Successor Features
We introduce a new unsupervised pretraining objective for reinforcement learning. During the unsupervised reward-free pretraining phase, the agent maximizes mutual information between tasks and states induced by the poli…
Unsupervised Reinforcement LearningSubmodular Benchmark Selection
Evaluating large language models across many benchmarks is expensive, yet many benchmarks are highly correlated. We formalize the selection of a small, informative subset as submodular maximization under a multivariate G…
Submodular Combinatorial Information Measures with Applications in Machine Learning
Information-theoretic quantities like entropy and mutual information have found numerous uses in machine learning. It is well known that there is a strong connection between these entropic quantities and submodularity si…
BIG-bench Machine LearningClusteringPrivacy PreservingInformation Maximization for Few-Shot Learning
We introduce Transductive Infomation Maximization (TIM) for few-shot learning. Our method maximizes the mutual information between the query features and their label predictions for a given few-shot task, in conjunction …
Few-Shot LearningMeta-LearningTransductive Information Maximization For Few-Shot Learning
We introduce Transductive Infomation Maximization (TIM) for few-shot learning. Our method maximizes the mutual information between the query features and their label predictions for a given few-shot task, in conjunction …
Few-Shot Image ClassificationFew-Shot LearningMeta-Learning