← Search

Patrik Okanovic

4 accepted papers

2026

Memory-Efficient LLMs Training with Dynamic Sparsity: From Stability to Practical Scaling

ICML 2026poster

Dynamic Sparse Training (DST) offers a promising paradigm for improving the training and inference efficiency of deep neural networks; however, we find that in large language model training, DST suffers from optimization instability, manifested as loss spikes following topology updates. In this work…

Cited by 0SourceScholar
2026

When Data Is Scarce: Scaling Sparse Language Models with Repeated Training

ICML 2026poster

Scaling laws for dense LLMs under infinite data are well explored, but how sparsity interacts with limited data is not. In this work, we study sparse training in data-constrained regimes where limited unique tokens require multi-epoch training. Our experiments span models up to 3.84B parameters, spa…

Cited by 0SourceScholar
2025

All models are wrong, some are useful: Model Selection with Limited Labels

AISTATS 2025poster

We introduce MODEL SELECTOR, a framework for label-efficient selection of pretrained classifiers. Given a pool of unlabeled target data, MODEL SELECTOR samples a small subset of highly informative examples for labeling, in order to efficiently identify the best pretrained model for deployment on thi…

Cited by 0SourcecodeScholar
2024

Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learning

ICLR 2024poster

Methods for carefully selecting or generating a small set of training data to learn from, i.e., data pruning, coreset selection, and dataset distillation, have been shown to be effective in reducing the ever-increasing cost of training neural networks. Behind this success are rigorously designed, ye…