TPAMI 2026 papers on Learning theory and algorithms
55 of the 880 papers published in TPAMI 2026 (6.2%) are on Learning theory and algorithms, compared with 4.2% at TPAMI 2025. They fall into 8 topics.
See TPAMI 2026 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Clustering · 28 papers
- Interpretable Subspace Clustering (8 citations)
- CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering (7 citations)
- Balanced Multi-View Clustering (5 citations)
- GBSK: Skeleton Clustering via Granular-ball Computing and Multi-Sampling for Large-Scale Data (3 citations)
- Learning Disentangled Representations for Generalized Multi-View Clustering (2 citations)
- STCF: Multi-View Clustering for Spatial Transcriptomics Based on Cross-View Fusion (2 citations)
- A Unified Framework for Pseudo-Supervised Clustering via Weighted Sample Aggregation (1 citation)
- Adaptive Hardness-Driven Dictionary Distillation for Incomplete Streaming View Clustering (1 citation)
- How Relation Enrichment Improves Clustering Ensemble Performance: A Second Order Induced Relation View (1 citation)
- Multi-View Spectral Contrastive Learning (1 citation)
- Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD (1 citation)
- Propagating Cross-View Semantics for Multi-View Clustering: A Unified Anchor Refinement Paradigm (1 citation)
and 16 more in the interactive map.
Matrix and tensor methods · 12 papers
- SPD Matrix Learning for Neuroimaging Analysis: Perspectives, Methods, and Challenges (13 citations)
- Low-Rank Tensor Learning by Generalized Nonconvex Regularization (6 citations)
- Top-$k$k Feature Selection in Sparse Learning via Accelerated Coordinate Descent Method (5 citations)
- Robust Matrix Completion With Deterministic Sampling via Convex Optimization (2 citations)
- Local Duality for Sparse Support Vector Machines (1 citation)
- Training-Free Ultra Small Model for Universal Sparse Reconstruction in Compressed Sensing (1 citation)
- A CUR Decomposition-Based Mix-Order Framework for Large-Scale Hypergraph Matching
- A Structure-Revealing Tensor Network Paradigm and Its Applications
- Linearly Solving Robust Rotation Estimation
- Neurodynamic Approaches With Fixed-Step Optimality for Rank Minimization: A Data-Driven Framework
- Separable Decomposition for Ragged Tensors
- Deeply Learned Robust Matrix Completion for Large-Scale Low-Rank Data Recovery
Prediction and decision losses · 4 papers
- Understanding Data Influence With Differential Approximation (4 citations)
- Beyond Fixed False Discovery Rates: Post-Hoc Conformal Selection With E-Variables
- Model Lineage Analysis: Determination and Closeness Measurement
- DeepCSHAP: Utilizing Shapley Values to Explain Deep Complex-Valued Neural Networks
