Fast DPCNs for Feature Extraction without Labels

Deep predictive coding networks (DPCNs) effectively model and capture video features through a bi-directional inference without labels. They are based on an overcomplete description of video scenes, and one of the bottlenecks has been the lack of effective sparsification techniques to find discriminative and robust dictionaries. This paper proposes a DPCN with a fast inference of internal dictionaries and variables that achieve high sparsity and feature clustering accuracy. The proposed unsupervised learning procedure uses majorization-minimization (MM) to smooth sparsity constraints in optimization and admits explainability and convergence. Experiments in the image and video data sets CIFAR-10, Super Mario Bros, and Coil-100 validate that the approach outperforms previous versions of DPCNs on learning rate, sparsity ratio, and feature clustering accuracy. This advance opens the door for general applications in object recognition in video without labels.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889164
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast DPCNs for Feature Extraction without Labels

José C. Prı́ncipe, Wenqian Xue, Chi Ding
Neural Networks and Applications
article

Fast DPCNs for Feature Extraction without Labels

José C. Prı́ncipe, Wenqian Xue, Chi Ding
article en

Abstract

Deep predictive coding networks (DPCNs) effectively model and capture video features through a bi-directional inference without labels. They are based on an overcomplete description of video scenes, and one of the bottlenecks has been the lack of effective sparsification techniques to find discriminative and robust dictionaries. This paper proposes a DPCN with a fast inference of internal dictionaries and variables that achieve high sparsity and feature clustering accuracy. The proposed unsupervised learning procedure uses majorization-minimization (MM) to smooth sparsity constraints in optimization and admits explainability and convergence. Experiments in the image and video data sets CIFAR-10, Super Mario Bros, and Coil-100 validate that the approach outperforms previous versions of DPCNs on learning rate, sparsity ratio, and feature clustering accuracy. This advance opens the door for general applications in object recognition in video without labels.

University of Florida (US)
Office of the Under Secretary of Defense
Openalex Percentile: Top 98%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.