paper-with-me

Papers

Probabilistic Hyper-Graphs using Multiple Randomly Masked Autoencoders for Semi-supervised Multi-modal Multi-task Learning

2025-10-11 · Pîrvu Mihai-Cristian, Marius Leordeanu arxiv

The computer vision domain has greatly benefited from an abundance of data across many modalities to improve on various visual tasks. Recently, there has been a lot of focus on self-supervised pre-training methods through Masked Autoencoders (MAE) \cite{he2022masked,bachmann2022multimae}, usually used as a first step before optimizing for a downstream task, such as classification or regression. This is very useful as it doesn't require any manually labeled data. In this work, we introduce Probabilistic Hyper-Graphs using Masked Autoencoders (PHG-MAE): a novel model that unifies the classical work on neural graphs \cite{leordeanu2021semi} with the modern approach of masked autoencoders under a common theoretical framework. Through random masking of entire modalities, not just patches, the model samples from the distribution of hyper-edges on each forward pass. Additionally, the model adapts the standard MAE algorithm by combining pre-training and fine-tuning into a single training loop. Moreover, our approach enables the creation of inference-time ensembles which, through aggregation, boost the final prediction performance and consistency. Lastly, we show that we can apply knowledge distillation on top of the ensembles with little loss in performance, even with models that have fewer than 1M parameters. While our work mostly focuses on outdoor UAV scenes that contain multiple world interpretations and modalities, the same steps can be followed in other similar domains, such as autonomous driving or indoor robotics. In order to streamline the process of integrating external pre-trained experts for computer vision multi-modal multi-task learning (MTL) scenarios, we developed a data-pipeline software. Using this tool, we have created and released a fully-automated extension of the Dronescapes dataset. All the technical details, code and reproduction steps are publicly released.

📄 PDF Abstract BibTeX arXiv:2510.10068

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge DistillationMulti-Task LearningAutonomous Driving

Similar Papers 제목 키워드 기반

Informative Subgraphs Aware Masked Auto-Encoder in Dynamic Graphs

2024-09-14 · Pengfe Jiao, Xinxun Zhang, Mengzhou Gao, Tianpeng Li 외

Generative self-supervised learning (SSL), especially masked autoencoders (MAE), has greatly succeeded and garnered substantial research interest in graph machine learning. However, the research of MAE in dynamic graphs …

Self-Supervised Learning

Foundation Posteriors for Approximate Probabilistic Inference

2022-05-19 · Mike Wu, Noah Goodman

Probabilistic programs provide an expressive representation language for generative models. Given a probabilistic program, we are interested in the task of posterior inference: estimating a latent variable given a set of…

Language ModelingLanguage ModellingMasked Language ModelingVariational Inference

On a hypergraph probabilistic graphical model

2018-11-20 · Mohammad Ali Javidian, Linyuan Lu, Marco Valtorta, Zhiyu Wang

We propose a directed acyclic hypergraph framework for a probabilistic graphical model that we call Bayesian hypergraphs. The space of directed acyclic hypergraphs is much larger than the space of chain graphs. Hence Bay…

model

Generative Representation Learning on Hyper-relational Knowledge Graphs via Masked Discrete Diffusion

2026-05-22 · Jaejun Lee, Seheon Kim, Joyce Jiyoung Whang arxiv

Hyper-relational knowledge graphs (HKGs) effectively represent complex facts. While inferring new knowledge in HKGs is a critical problem, current methods cast it as a simple link prediction, assuming that nearly all ent…

Representation LearningKnowledge GraphsLink Prediction

MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs

2022-01-07 · Qiaoyu Tan, Ninghao Liu, Xiao Huang, Rui Chen 외

We introduce a novel masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to…

DecoderGraph Neural NetworkLink PredictionNode Classification+1