Search Results for author: Marek Cygan

Found 8 papers, 2 papers with code

Grasping Student: semi-supervised learning for robotic manipulation

no code implementations8 Mar 2023 Piotr Krzywicki, Krzysztof Ciebiera, Rafał Michaluk, Inga Maziarz, Marek Cygan

Gathering real-world data from the robot quickly becomes a bottleneck when constructing a robot learning system for grasping.

On All-Action Policy Gradients

1 code implementation24 Oct 2022 Michal Nauman, Marek Cygan

We decompose the variance of SPG and derive an optimality condition for all-action SPG.

One Simple Trick to Fix Your Bayesian Neural Network

no code implementations26 Jul 2022 Piotr Tempczyk, Ksawery Smoczyński, Philip Smolenski-Jensen, Marek Cygan

One of the most popular estimation methods in Bayesian neural networks (BNN) is mean-field variational inference (MFVI).

Variational Inference

n-CPS: Generalising Cross Pseudo Supervision to n Networks for Semi-Supervised Semantic Segmentation

no code implementations14 Dec 2021 Dominik Filipiak, Piotr Tempczyk, Marek Cygan

We present n-CPS - a generalisation of the recent state-of-the-art cross pseudo supervision (CPS) approach for the task of semi-supervised semantic segmentation.

Semi-Supervised Semantic Segmentation

Improved GQ-CNN: Deep Learning Model for Planning Robust Grasps

no code implementations16 Feb 2018 Maciej Jaśkowski, Jakub Świątkowski, Michał Zając, Maciej Klimek, Jarek Potiuk, Piotr Rybicki, Piotr Polatowski, Przemysław Walczyk, Kacper Nowicki, Marek Cygan

In this work we improve on one of the most promising approaches, the Grasp Quality Convolutional Neural Network (GQ-CNN) trained on the DexNet 2. 0 dataset.

Approximation and Parameterized Complexity of Minimax Approval Voting

no code implementations26 Jul 2016 Marek Cygan, Łukasz Kowalik, Arkadiusz Socała, Krzysztof Sornat

Motivated by this, we then show a parameterized approximation scheme, running in time $\mathcal{O}^\star(\left({3}/{\epsilon}\right)^{2d})$, which is essentially tight assuming ETH.

Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time

1 code implementation7 Nov 2012 Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V, E) with a given tree decomposition of width tw.

Data Structures and Algorithms Computational Complexity Discrete Mathematics F.2.2; G.2.8

Cannot find the paper you are looking for? You can Submit a new open access paper.