← Search

Hossein Hajimirsadeghi

9 accepted papers

2025

Radar: Fast Long-Context Decoding for Any Transformer

ICLR 2025poster

Transformer models have demonstrated exceptional performance across a wide range of applications. Though forming the foundation of Transformer models, the dot-product attention does not scale well to long-context data since its time requirement grows quadratically with context length. In this work,…

2024

Memory Efficient Neural Processes via Constant Memory Attention Block

ICML 2024poster

Neural Processes (NPs) are popular meta-learning methods for efficiently modelling predictive uncertainty. Recent state-of-the-art methods, however, leverage expensive attention mechanisms, limiting their applications, particularly in low-resource settings. In this work, we propose Constant Memory A…

2024

Tree Cross Attention

ICLR 2024poster

Cross Attention is a popular method for retrieving information from a set of context tokens for making predictions. At inference time, for each prediction, Cross Attention scans the full set of $\mathcal{O}(N)$ tokens. In practice, however, often only a small subset of tokens are required for good p…

2023

Latent Bottlenecked Attentive Neural Processes

ICLR 2023poster

Neural Processes (NPs) are popular methods in meta-learning that can estimate predictive uncertainty on target datapoints by conditioning on a context dataset. Previous state-of-the-art method Transformer Neural Processes (TNPs) achieve strong performance but require quadratic computation with respe…

2023

Towards Better Selective Classification

ICLR 2023poster

We tackle the problem of Selective Classification where the objective is to achieve the best performance on a predetermined ratio (coverage) of the dataset. Recent state-of-the-art selective methods come with architectural changes either via introducing a separate selection head or an extra abstenti…

2022

TD-GEN: Graph Generation Using Tree Decomposition

AISTATS 2022poster

We propose TD-GEN, a graph generation framework based on tree decomposition, and introduce a reduced upper bound on the maximum number of decisions needed for graph generation. The framework includes a permutation invariant tree generation model which forms the backbone of graph generation. Tree nod…

Cited by 7SourcePDFScholar
2021

Variational Selective Autoencoder: Learning from Partially-Observed Heterogeneous Data

AISTATS 2021poster

Learning from heterogeneous data poses challenges such as combining data from various sources and of different types. Meanwhile, heterogeneous data are often associated with missingness in real-world applications due to heterogeneity and noise of input sources. In this work, we propose the variation…

Cited by 20SourcePDFScholar
2015

Learning Ensembles of Potential Functions for Structured Prediction With Latent Variables

ICCV 2015poster

Many visual recognition tasks involve modeling variables which are structurally related. Hidden conditional random fields (HCRFs) are a powerful class of models for encoding structure in weakly supervised training examples. This paper presents HCRF-Boost, a novel and general framework for learning H…

Cited by 14PDFScholar
2015

Visual Recognition by Counting Instances: A Multi-Instance Cardinality Potential Kernel

CVPR 2015poster

Many visual recognition problems can be approached by counting instances. To determine whether an event is present in a long internet video, one could count how many frames seem to contain the activity. Classifying the activity of a group of people can be done by counting the actions of individual…

Cited by 106SourcePDFScholar