Alert button
Picture for Kamil Adamczewski

Kamil Adamczewski

Alert button

Scaling Laws for Fine-Grained Mixture of Experts

Feb 12, 2024
Jakub Krajewski, Jan Ludziejewski, Kamil Adamczewski, Maciej Pióro, Michał Krutul, Szymon Antoniak, Kamil Ciebiera, Krystian Król, Tomasz Odrzygóźdź, Piotr Sankowski, Marek Cygan, Sebastian Jaszczur

Viaarxiv icon

Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classification

Jun 19, 2023
Kamil Adamczewski, Yingchen He, Mijung Park

Figure 1 for Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classification
Figure 2 for Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classification
Figure 3 for Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classification
Figure 4 for Pre-Pruning and Gradient-Dropping Improve Differentially Private Image Classification
Viaarxiv icon

Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion

Mar 21, 2023
Kamil Adamczewski, Christos Sakaridis, Vaishakh Patil, Luc Van Gool

Figure 1 for Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion
Figure 2 for Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion
Figure 3 for Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion
Figure 4 for Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion
Viaarxiv icon

Differential Privacy Meets Neural Network Pruning

Mar 08, 2023
Kamil Adamczewski, Mijung Park

Figure 1 for Differential Privacy Meets Neural Network Pruning
Figure 2 for Differential Privacy Meets Neural Network Pruning
Figure 3 for Differential Privacy Meets Neural Network Pruning
Figure 4 for Differential Privacy Meets Neural Network Pruning
Viaarxiv icon

Differentially Private Neural Tangent Kernels for Privacy-Preserving Data Generation

Mar 03, 2023
Yilin Yang, Kamil Adamczewski, Danica J. Sutherland, Xiaoxiao Li, Mijung Park

Figure 1 for Differentially Private Neural Tangent Kernels for Privacy-Preserving Data Generation
Figure 2 for Differentially Private Neural Tangent Kernels for Privacy-Preserving Data Generation
Figure 3 for Differentially Private Neural Tangent Kernels for Privacy-Preserving Data Generation
Figure 4 for Differentially Private Neural Tangent Kernels for Privacy-Preserving Data Generation
Viaarxiv icon

Revisiting Random Channel Pruning for Neural Network Compression

May 11, 2022
Yawei Li, Kamil Adamczewski, Wen Li, Shuhang Gu, Radu Timofte, Luc Van Gool

Figure 1 for Revisiting Random Channel Pruning for Neural Network Compression
Figure 2 for Revisiting Random Channel Pruning for Neural Network Compression
Figure 3 for Revisiting Random Channel Pruning for Neural Network Compression
Figure 4 for Revisiting Random Channel Pruning for Neural Network Compression
Viaarxiv icon

Dirichlet Pruning for Neural Network Compression

Nov 10, 2020
Kamil Adamczewski, Mijung Park

Figure 1 for Dirichlet Pruning for Neural Network Compression
Figure 2 for Dirichlet Pruning for Neural Network Compression
Figure 3 for Dirichlet Pruning for Neural Network Compression
Figure 4 for Dirichlet Pruning for Neural Network Compression
Viaarxiv icon

Q-FIT: The Quantifiable Feature Importance Technique for Explainable Machine Learning

Oct 26, 2020
Kamil Adamczewski, Frederik Harder, Mijung Park

Figure 1 for Q-FIT: The Quantifiable Feature Importance Technique for Explainable Machine Learning
Figure 2 for Q-FIT: The Quantifiable Feature Importance Technique for Explainable Machine Learning
Figure 3 for Q-FIT: The Quantifiable Feature Importance Technique for Explainable Machine Learning
Figure 4 for Q-FIT: The Quantifiable Feature Importance Technique for Explainable Machine Learning
Viaarxiv icon

Differentially Private Mean Embeddings with Random Features (DP-MERF) for Simple & Practical Synthetic Data Generation

Mar 10, 2020
Frederik Harder, Kamil Adamczewski, Mijung Park

Figure 1 for Differentially Private Mean Embeddings with Random Features (DP-MERF) for Simple & Practical Synthetic Data Generation
Figure 2 for Differentially Private Mean Embeddings with Random Features (DP-MERF) for Simple & Practical Synthetic Data Generation
Figure 3 for Differentially Private Mean Embeddings with Random Features (DP-MERF) for Simple & Practical Synthetic Data Generation
Figure 4 for Differentially Private Mean Embeddings with Random Features (DP-MERF) for Simple & Practical Synthetic Data Generation
Viaarxiv icon