activity
20182026
most citedOptimal Continual Learning has Perfect Memory and is NP-hard

33 citations · 42 across the 13 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2026

Accelerating Speculative Diffusions via Block Verification

Alexander Soen, Hisham Husain, Valentin De Bortoli +1

Speculative decoding speeds up LLM inference by using a draft model to generate tokens, with an acceptance-rejection scheme that ensures that the output matches the target distribu…

cs.LG2026

Seasoning Generative Models for a Generalization Aftertaste

Hisham Husain, Valentin De Bortoli, Richard Nock

The use of discriminators to train or fine-tune generative models has proven to be a rather successful framework. A notable example is Generative Adversarial Networks (GANs) that m…

cs.LG2022★ 1 cited

Confident Sinkhorn Allocation for Pseudo-Labeling

Vu Nguyen, Hisham Husain, Sachin Farfade +1

Semi-supervised learning is a critical tool in reducing machine learning's dependence on labeled data. It has been successfully applied to structured data, such as images and natur…

cs.LG2022★ 1 cited

Distributionally Robust Bayesian Optimization with -divergences

Hisham Husain, Vu Nguyen, Anton van den Hengel

The study of robustness has received much attention due to its inevitability in data-driven settings where many systems face uncertainty. One such example of concern is Bayesian Op…

cs.LG2021★ 1 cited

Regularized Policies are Reward Robust

Hisham Husain, Kamil Ciosek, Ryota Tomioka

Entropic regularization of policies in Reinforcement Learning (RL) is a commonly used heuristic to ensure that the learned policy explores the state-space sufficiently before overf…

cs.LG2020★ 33 cited

Optimal Continual Learning has Perfect Memory and is NP-hard

Jeremias Knoblauch, Hisham Husain, Tom Diethe

Continual Learning (CL) algorithms incrementally learn a predictor or representation across multiple sequentially observed tasks. Designing CL algorithms that perform reliably and…