paper-with-me

홈 › Papers

Projective Subspace Networks For Few-Shot Learning

2019-05-01 · ICLR 2019 5 · Christian Simon, Piotr Koniusz, Mehrtash Harandi

Generalization from limited examples, usually studied under the umbrella of meta-learning, equips learning techniques with the ability to adapt quickly in dynamical environments and proves to be an essential aspect of lifelong learning. In this paper, we introduce the Projective Subspace Networks (PSN), a deep learning paradigm that learns non-linear embeddings from limited supervision. In contrast to previous studies, the embedding in PSN deems samples of a given class to form an affine subspace. We will show that such modeling leads to robust solutions, yielding competitive results on supervised and semi-supervised few-shot classification. Moreover, our PSN approach has the ability of end-to-end learning. In contrast to previous works, our projective subspace can be thought of as a richer representation capturing higher-order information datapoints for modeling new concepts.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Few-Shot LearningGeneral ClassificationLifelong learningMeta-Learning

Similar Papers 제목 키워드 기반

New Coresets for Projective Clustering and Applications

2022-03-08 · Murad Tukan, Xuan Wu, Samson Zhou, Vladimir Braverman 외

$(j,k)$-projective clustering is the natural generalization of the family of $k$-clustering and $j$-subspace clustering problems. Given a set of points $P$ in $\mathbb{R}^d$, the goal is to find $k$ flats of dimension $j…

Clusteringregression

Deep Learning Meets Projective Clustering

2020-10-08 · ICLR 2021 1 · Alaa Maalouf, Harry Lang, Daniela Rus, Dan Feldman

A common approach for compressing NLP networks is to encode the embedding layer as a matrix $A\in\mathbb{R}^{n\times d}$, compute its rank-$j$ approximation $A_j$ via SVD, and then factor $A_j$ into a pair of matrices th…

ClusteringDeep Learning

On Generalization Bounds for Projective Clustering

2023-10-13 · NeurIPS 2023 11

Given a set of points, clustering consists of finding a partition of a point set into $k$ clusters such that the center to which a point is assigned is as close as possible. Most commonly, centers are points themselves, …

ClusteringGeneralization Bounds

ProLab: perceptually uniform projective colour coordinate system

2020-12-14 · Ivan A. Konovalenko, Anna A. Smagina, Dmitry P. Nikolaev, Petr P. Nikolaev

In this work, we propose proLab: a new colour coordinate system derived as a 3D projective transformation of CIE XYZ. We show that proLab is far ahead of the widely used CIELAB coordinate system (though inferior to the m…

IPPRO: Importance-based Pruning with PRojective Offset for Magnitude-indifferent Structural Pruning

2025-07-10 · Jaeheun Jung, Jaehyuk Lee, Yeajin Lee, Donghun Lee arxiv

Importance-based structured pruning overwhelmingly relies on filter magnitude. This proxy is fundamentally flawed: due to scale invariance, functionally identical filters can receive arbitrarily different importance scor…

Neural Network Compression