activity
20242026
most citedLucidPPN: Unambiguous Prototypical Parts Network for User-centric Interpretable Computer Vision

1 citations · 1 across the 14 of their papers we have counts for

collaborators

14 papers

cs.AI2026

Fast LapSum: Exact Differentiable Top- at Million Scale

Łukasz Struski, Joanna Wojciechowicz, Jakub Antczak +3

Selecting the top- elements is a fundamental operation for inducing sparsity in large-scale models and optimization problems, enabling robust expert activation, token routing or…

cs.LG2026

LaPrune: Controllable Differentiable Sparsity at Million Scale

Jakub Antczak, Joanna Wojciechowicz, Łukasz Struski +1

Top- selection determines which components of a sparse model remain active. Hard selection blocks gradients, while continuous relaxations often couple mask hardness to the selec…

cs.CV2026

Interpretability-Guided Soft Pruning of Attention Heads in Vision Transformers

Kamil Książek, Piotr Suszyński, Michał Jan Włodarczyk +2

Vision foundation models, such as DINOv2, learn highly expressive representations but rely on massive, opaque architectures that demand substantial computational power and memory.…

cs.CV2026

What Pixels Are Enough? SEAMS: Sufficiency Saliency via MSE-Preservation Soft-Masks

Magdalena Trędowicz, Łukasz Struski, Arkadiusz Lewicki +4

Saliency maps are most useful when they identify the image regions that are sufficient to preserve a model's behaviour. We introduce SEAMS, a sufficiency-based saliency method that…

cs.LG2026

SoftMoE: Soft Differentiable Routing for Mixture-of-Experts in LLMs

Mikołaj Zasada, Łukasz Struski, Jacek Tabor +1

Sparse Mixture-of-Experts (MoE) architectures enable scaling LLM parameters under a fixed inference budget by activating only a small subset of experts via top- routing. While t…

cs.LG2026

LAPLEX: The FFT of Learnable Laplace Kernels

Łukasz Struski, Hanna Blazhko, Piotr Kubaty +1

Fast linear algebra in deep learning usually comes with a choice: fixed geometry and exact computation, as in the Fourier transform, or adaptive geometry paid for by dense paramete…

cs.CV2026

Conceptualizing Embeddings: Sparse Disentanglement for Vision-Language Models

Piotr Kubaty, Patryk Marszałek, Łukasz Struski +3

Vision-language models learn powerful multimodal embeddings, yet their internal semantics remain opaque. While sparse autoencoders (SAEs) can extract interpretable features, they r…

cs.CV2026

DAVE: Distribution-aware Attribution via ViT Gradient Decomposition

Adam Wróbel, Siddhartha Gairola, Jacek Tabor +3

Vision Transformers (ViTs) have become a dominant architecture in computer vision, yet producing stable and high-resolution attribution maps for these models remains challenging. A…

cs.CV2025

SIDE: Sparse Information Disentanglement for Explainable Artificial Intelligence

Viktar Dubovik, Łukasz Struski, Jacek Tabor +1

Understanding the decisions made by deep neural networks is essential in high-stakes domains such as medical imaging and autonomous driving. Yet, these models often lack transparen…

cs.LG2025

FeNeC: Enhancing Continual Learning via Feature Clustering with Neighbor- or Logit-Based Classification

Kamil Książek, Hubert Jastrzębski, Bartosz Trojan +3

The ability of deep learning models to learn continuously is essential for adapting to new data categories and evolving data distributions. In recent years, approaches leveraging f…

cs.AI2025

LapSum -- One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection

Łukasz Struski, Michał B. Bednarczyk, Igor T. Podolak +1

We present a novel technique for constructing differentiable order-type operations, including soft ranking, soft top-k selection, and soft permutations. Our approach leverages an e…

cs.LG2025

SEMU: Singular Value Decomposition for Efficient Machine Unlearning

Marcin Sendera, Łukasz Struski, Kamil Książek +3

While the capabilities of generative foundational models have advanced rapidly in recent years, methods to prevent harmful and unsafe behaviors remain underdeveloped. Among the pre…

cs.CV2024

InfoDisent: Explainability of Image Classification Models by Information Disentanglement

Łukasz Struski, Dawid Rymarczyk, Jacek Tabor

In this work, we introduce InfoDisent, a hybrid approach to explainability based on the information bottleneck principle. InfoDisent enables the disentanglement of information in t…

cs.CV2024★ 1 cited

LucidPPN: Unambiguous Prototypical Parts Network for User-centric Interpretable Computer Vision

Mateusz Pach, Dawid Rymarczyk, Koryna Lewandowska +2

Prototypical parts networks combine the power of deep learning with the explainability of case-based reasoning to make accurate, interpretable decisions. They follow the this looks…