paper-with-me

홈 › Papers

Learning Permutation Invariant Representations using Memory Networks

2019-11-18 · ECCV 2020 8 · Shivam Kalra, Mohammed Adnan, Graham Taylor, Hamid Tizhoosh

Many real-world tasks such as classification of digital histopathology images and 3D object detection involve learning from a set of instances. In these cases, only a group of instances or a set, collectively, contains meaningful information and therefore only the sets have labels, and not individual data instances. In this work, we present a permutation invariant neural network called Memory-based Exchangeable Model (MEM) for learning set functions. The MEM model consists of memory units that embed an input sequence to high-level features enabling the model to learn inter-dependencies among instances through a self-attention mechanism. We evaluated the learning ability of MEM on various toy datasets, point cloud classification, and classification of lung whole slide images (WSIs) into two subtypes of lung cancer---Lung Adenocarcinoma, and Lung Squamous Cell Carcinoma. We systematically extracted patches from lung WSIs downloaded from The Cancer Genome Atlas~(TCGA) dataset, the largest public repository of WSIs, achieving a competitive accuracy of 84.84\% for classification of two sub-types of lung cancer. The results on other datasets are promising as well, and demonstrate the efficacy of our model.

📄 PDF Abstract BibTeX arXiv:1911.07984

Code (1)

ohshyuk5/Memory-based-Exchangeable-Model pytorch

Tasks

3D Object DetectionClassificationGeneral ClassificationImage Classificationobject-detectionObject DetectionPoint Cloud Classificationwhole slide images

Similar Papers 제목 키워드 기반

Learning Binary and Sparse Permutation-Invariant Representations for Fast and Memory Efficient Whole Slide Image Search

2022-08-29 · Sobhan Hemati, Shivam Kalra, Morteza Babaie, H. R. Tizhoosh

Learning suitable Whole slide images (WSIs) representations for efficient retrieval systems is a non-trivial task. The WSI embeddings obtained from current methods are in Euclidean space not ideal for efficient WSI retri…

GPUImage RetrievalRetrievalwhole slide images

Learning Representations of Sets through Optimized Permutations

2018-12-10 · ICLR 2019 5 · Yan Zhang, Jonathon Hare, Adam Prügel-Bennett

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The perm…

General ClassificationQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)

Rethink MAE with Linear Time-Invariant Dynamics

2026-04-29 · Zice Wang arxiv

Standard representation probing for visual models relies on mathematically permutation-invariant operations like Global Average Pooling (GAP) or CLS tokens, treating patch representations as an unstructured bag-of-words.…

Inducing Permutation Invariant Priors in Bayesian Optimization for Carbon Capture and Storage Applications

2026-05-04 · Sofianos Panagiotis Fotias, Vassilis Gaganis arxiv

Bayesian Optimization is an iterative method, tailored to optimizing expensive black box objective functions. Surrogate models like Gaussian Processes, which are the gold standard in Bayesian Optimization, can be ineffic…

Gaussian Processes

SetRank: Learning a Permutation-Invariant Ranking Model for Information Retrieval

2019-12-12 · Liang Pang, Jun Xu, Qingyao Ai, Yanyan Lan 외

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a…

Information RetrievalLearning-To-RankRetrieval