SearcharxivSearch

arXiv subjects

Maciej Satkiewicz

Publications and source records attributed to Maciej Satkiewicz.

3 recordsLinked to original sources

Pulling Back the Curtain on Deep Networks

In linear models, visualizing a weight vector naturally reveals the model's preferred input direction, but extending this intuition to deep networks via gradients or gradient ascent often yields brittle or adversarial-looking features. We argue that deep networks are better understood as input-conditioned affine operators, whose natural adjoint action pulls a neuron's preferred direction back to input space. We further refine this representation by backward-only softening and iterative enhancement to reconstruct coherent local structures encoded by the target neuron. This provides a unifying perspective on previously disparate ideas such as SmoothGrad, B-cos-style alignment, and Feature Accentuation. The resulting Semantic Pullbacks (SP) generate perceptually aligned, class-conditional post-hoc explanations that emphasize semantically meaningful features, facilitate coherent counterfactual perturbations, and remain theoretically grounded. Across convolutional architectures (ResNet50, VGG) and transformer-based models (PVT), Semantic Pullbacks achieve the best overall trade-off across faithfulness, stability, and target-sensitivity benchmarks, while remaining general, computationally efficient, and readily integrable into existing deep learning pipelines.

cs.LG

Towards White Box Deep Learning

Deep neural networks learn fragile "shortcut" features, rendering them difficult to interpret (black box) and vulnerable to adversarial attacks. This paper proposes semantic features as a general architectural solution to this problem. The main idea is to make features locality-sensitive in the adequate semantic topology of the domain, thus introducing a strong regularization. The proof of concept network is lightweight, inherently interpretable and achieves almost human-level adversarial test metrics - with no adversarial training! These results and the general nature of the approach warrant further research on semantic features. The code is available at https://github.com/314-Foundation/white-box-nn

cs.LG

Transfinite Asymptotic Dimension

Asymptotic property C for metric spaces was introduced by Dranishnikos as generalization of finite asymptotic dimension - asdim. It turns out that this property can be viewed as transfinite extension of asymptotic dimension. The original definition was given by Radul. We introduce three equivalent definitions, show that asymptotic property C is closed under products (open problem stated "Open problems in topology II") and prove some other facts, i.e. by defining dimension of a family of metric spaces. Some examples of spaces enjoying countable trasfinite asymptotic dimension are given. We also formulate open problems and state "omega conjecture", which inspired most part of this paper.

math.GN