Skip to content

Author

Maya Lindqvist

6 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

RASP: Read-All, Sparse-Plasticity Continual Learning in a Stationary-Size LoRA

Parameter-efficient continual learning on pre-trained Vision Transformers largely relies on a costly premise: preventing catastrophic forgetting requires either spawning a dedicated LoRA branch per session---causing adapter parameters to scale linearly with task horizon---or applying sparse Mixture-of-Experts gating sy...

Wen-Hsuan Liu, Amara Okonkwo, Tom Saliencro et al. · 0 citations
Preprint Nov 2026

BISECT: Bilevel Spectral Decomposition for Low-Rank Continual Learning

Exemplar-free continual learning on pre-trained Vision Transformers increasingly relies on Low-Rank Adaptation (LoRA), yet prevailing methods govern the low-rank update space through strict subspace isolation. By projecting each incoming task into the approximate null space of historical token activations, isolation-ba...

Tom Saliencro, Wen-Hsuan Liu, Rohan Desai et al. · 0 citations
#diffusion models Open access Oct 2026

Generative artificial intelligence and innovation performance in emerging-economy SMEs

Generative artificial intelligence is reaching small firms in emerging economies with unusual speed, because it is rented, not built, and is operated through ordinary language instead of code. This paper develops a conceptual framework that explains when and how generative AI use improves innovation performance in emer...

Aaron Whitfield, Maya Lindqvist · 0 citations
#machine learning Preprint Sep 2026

Score the Update, Not the Token: Descent-Aligned Routing for Combinatorial LoRA Experts

Mixture-of-LoRA-experts methods raise the capacity of low-rank adaptation by routing each token to a few low-rank experts. Nearly all of them tie one input-side factor to one output-side factor per expert, and nearly all of them route by scoring the token: the router picks experts without seeing what any of them would...

Priya Nair, Lukas Brenner, Maya Lindqvist et al. · 0 citations
Jul 2026

Spend Experts Where You Are Unsure: Confidence-Adaptive Routing for Mixture-of-Experts LoRA

This work introduces CARE (Confidence-Adaptive Routing of Experts), which admits experts in a nucleus fashion and improves over fixed top-k MoE-LoRA at matched compute and matches the fixed-k=4 baseline while activating fewer experts.

Tom Saliencro, Rohan Desai, Priya Nair et al. · 1 citation
Preprint Aug 2026

Uncertainty Is Not Enough: Value-of-Information Routing for Mixtures of LoRA Experts

Mixtures of low-rank adaptation experts increase parameter-efficient capacity by routing each input through a subset of adapters. Recent dynamic routers activate more experts when the router or prediction is uncertain. This rule silently equates uncertainty with useful additional computation: an uncertain example may c...

Tom Saliencro, Rohan Desai, Priya Nair et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.