1 citations · 1 across the 3 of their papers we have counts for
4 papers
Shapley Pruning for Neural Network Compression
Kamil Adamczewski, Yawei Li, Luc van Gool
Neural network pruning is a rich field with a variety of approaches. In this work, we propose to connect the existing pruning concepts such as leave-one-out pruning and oracle prun…
Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing
Jan-Nico Zaech, Martin Danelljan, Tolga Birdal +1
Adiabatic quantum computing (AQC) is a promising approach for discrete and often NP-hard optimization problems. Current AQCs allow to implement problems of research interest, which…
Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion
Kamil Adamczewski, Christos Sakaridis, Vaishakh Patil +1
Lidar is a vital sensor for estimating the depth of a scene. Typical spinning lidars emit pulses arranged in several horizontal lines and the monetary cost of the sensor increases…
Dilemma First Search for Effortless Optimization of NP-Hard Problems
Julien Weissenberg, Hayko Riemenschneider, Ralf Dragon +1
To tackle the exponentiality associated with NP-hard problems, two paradigms have been proposed. First, Branch & Bound, like Dynamic Programming, achieve efficient exact inference…