University of Warsaw

research

∙ 12/19/2019

Uncertainty-sensitive Learning and Planning with Ensembles

We propose a reinforcement learning framework for discrete environments ...

Piotr Miłoś, et al. ∙

research

∙ 06/07/2022

A generative recommender system with GMM prior for cancer drug generation and sensitivity prediction

Recent emergence of high-throughput drug screening assays sparkled an in...

Krzysztof Koras, et al. ∙

research

∙ 08/25/2021

Subgoal Search For Complex Reasoning Tasks

Humans excel in solving complex reasoning tasks through a mental process...

Konrad Czechowski, et al. ∙

research

∙ 08/02/2017

Helping AI to Play Hearthstone: AAIA'17 Data Mining Challenge

This paper summarizes the AAIA'17 Data Mining Challenge: Helping AI to P...

Andrzej Janusz, et al. ∙

research

∙ 05/19/2017

Atari games and Intel processors

The asynchronous nature of the state-of-the-art reinforcement learning a...

Robert Adamski, et al. ∙

research

∙ 04/21/2017

Multi-Objective Deep Q-Learning with Subsumption Architecture

In this work we present a method for using Deep Q-Networks (DQNs) in mul...

Tomasz Tajmajer, et al. ∙

research

∙ 07/26/2016

Approximation and Parameterized Complexity of Minimax Approval Voting

We present three results on the complexity of Minimax Approval Voting. F...

Marek Cygan, et al. ∙

research

∙ 06/07/2016

ENet: A Deep Neural Network Architecture for Real-Time Semantic Segmentation

The ability to perform pixel-wise semantic segmentation in real-time is ...

Adam Paszke, et al. ∙

research

∙ 04/25/2015

A Prior Distribution over Directed Acyclic Graphs for Sparse Bayesian Networks

The main contribution of this article is a new prior distribution over d...

Felix L. Rios, et al. ∙

research

∙ 05/24/2016

An Analysis of Deep Neural Network Models for Practical Applications

Since the emergence of Deep Neural Networks (DNNs) as a prominent techni...

Alfredo Canziani, et al. ∙

research

∙ 04/04/2009

Optimal Tableau Decision Procedures for PDL

We reformulate Pratt's tableau decision procedure of checking satisfiabi...

Linh Anh Nguyen, et al. ∙

research

∙ 10/24/2017

The Erdős-Hajnal conjecture for caterpillars and their complements

The celebrated Erdős-Hajnal conjecture states that for every proper here...

Anita Liebenau, et al. ∙

research

∙ 09/28/2017

Improved approximate near neighbor search without false negatives for l_2

We present a new algorithm for the c--approximate nearest neighbor searc...

Piotr Wygocki, et al. ∙

research

∙ 09/22/2017

Planar Perfect Matching is in NC

In this paper we show that the problem of computing perfect matchings in...

Piotr Sankowski, et al. ∙

research

∙ 07/06/2017

When the Optimum is also Blind: a New Perspective on Universal Optimization

Consider the following variant of the set cover problem. We are given a ...

Marek Adamczyk, et al. ∙

research

∙ 01/04/2018

A Quantitative Analysis of Multi-Winner Rules

To choose a multi-winner rule, i.e., a voting rule that selects a subset...

Martin Lackner, et al. ∙

research

∙ 02/19/2018

Linear Equations with Ordered Data

Following a recently considered generalization of linear equations to un...

Piotr Hofman, et al. ∙

research

∙ 02/26/2018

Analysis of Langevin Monte Carlo via convex optimization

In this paper, we provide new insights on the Unadjusted Langevin Algori...

Alain Durmus, et al. ∙

research

∙ 02/27/2018

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness

The notions of bounded expansion and nowhere denseness not only offer ro...

Wojciech Nadara, et al. ∙

research

∙ 03/02/2018

An improved FPT algorithm for Independent Feedback Vertex Set

We study the Independent Feedback Vertex Set problem - a variant of the ...

Shaohua Li, et al. ∙

research

∙ 03/16/2018

Fair non-monetary scheduling in federated clouds

In a hybrid cloud, individual cloud service providers (CSPs) often have ...

Milosz Pacholczyk, et al. ∙

research

∙ 03/15/2018

Definable decompositions for graphs of bounded linear cliquewidth

We prove that for every positive integer k, there exists an MSO_1-transd...

Mikołaj Bojańczyk, et al. ∙

research

∙ 03/20/2018

Collective Schedules: Scheduling Meets Computational Social Choice

When scheduling public works or events in a shared facility one needs to...

Fanny Pascual, et al. ∙

research

∙ 04/04/2018

Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp.ed...

Anupam Gupta, et al. ∙

research

∙ 04/06/2018

Subquadratic Approximation Scheme for Partition

The subject of this paper is the time complexity of approximating Knapsa...

Marcin Mucha, et al. ∙

research

∙ 04/07/2018

Random Order Contention Resolution Schemes

Contention resolution schemes have proven to be an incredibly powerful c...

Marek Adamczyk, et al. ∙

research

∙ 04/18/2018

On Abelian Longest Common Factor with and without RLE

We consider the Abelian longest common factor problem in two scenarios: ...

Szymon Grabowski, et al. ∙

research

∙ 04/19/2018

Individual Security and Network Design with Malicious Nodes

Networks are beneficial to those being connected but can also be used as...

Tomasz Janus, et al. ∙

research

∙ 04/23/2018

Longest Common Factor Made Fully Dynamic

In the longest common factor (LCF) problem, we are given two strings S a...

Amihood Amir, et al. ∙

research

∙ 04/28/2018

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms

We study an expressive model of timed pushdown automata extended with mo...

Lorenzo Clemente, et al. ∙

research

∙ 05/04/2018

Analysis of nonsmooth stochastic approximation: the differential inclusion approach

In this paper we address the convergence of stochastic approximation whe...

Szymon Majewski, et al. ∙

research

∙ 05/09/2018

Parameterized circuit complexity of model checking first-order logic on sparse structures

We prove that for every class C of graphs with effectively bounded expan...

Michał Pilipczuk, et al. ∙

research

∙ 06/28/2018

Decremental SPQR-trees for Planar Graphs

We present a decremental data structure for maintaining the SPQR-tree of...

Jacob Holm, et al. ∙

research

∙ 07/10/2018

Online Facility Location with Deletions

In this paper we study three previously unstudied variants of the online...

Marek Cygan, et al. ∙

research

∙ 07/13/2018

A collisionless singular Cucker-Smale model with decentralized formation control

In this paper we address the design of decentralized feedback control la...

Young-Pil Choi, et al. ∙

research

∙ 07/19/2018

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

We consider two optimization problems in planar graphs. In Maximum Weigh...

Michał Pilipczuk, et al. ∙

research

∙ 07/23/2018

Undecidability of MSO+"ultimately periodic"

We prove that MSO on ω-words becomes undecidable if allowing to quantify...

Mikołaj Bojańczyk, et al. ∙

research

∙ 07/27/2018

Connected Components at Scale via Local Contractions

As a fundamental tool in hierarchical graph clustering, computing connec...

Jakub Łącki, et al. ∙

research

∙ 08/08/2018

Asymptotics of maximum likelihood estimators based on Markov chain Monte Carlo methods

In many complex statistical models maximum likelihood estimators cannot ...

Błażej Miasojedow, et al. ∙

research

∙ 08/09/2018

Finite Query Answering in Expressive Description Logics with Transitive Roles

We study the problem of finite ontology mediated query answering (FOMQA)...

Tomasz Gogacz, et al. ∙

research

∙ 08/14/2018

Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms

We investigate the impact of supervised prediction models on the strengt...

Maciej Świechowski, et al. ∙

research

∙ 08/15/2018

An infinitary rewriting interpretation of coinductive types

We introduce an infinitary rewriting semantics for strictly positive nes...

Łukasz Czajka, et al. ∙

research

∙ 09/15/2018

Kernelization and approximation of distance-r independent sets on nowhere dense graphs

For a positive integer r, a distance-r independent set in an undirected ...

Michał Pilipczuk, et al. ∙

research

∙ 09/16/2018

Constant factor FPT approximation for capacitated k-median

Capacitated k-median is one of the few outstanding optimization problems...

Marek Adamczyk, et al. ∙

research

∙ 09/19/2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)

Petri nets, also known as vector addition systems, are a long establishe...

Wojciech Czerwiński, et al. ∙

research

∙ 10/04/2018

First-order interpretations of bounded expansion classes

The notion of bounded expansion captures uniform sparsity of graph class...

Jakub Gajarsky, et al. ∙

research

∙ 10/16/2018

Randomized contractions meet lean decompositions

The randomized contractions technique, introduced by Chitnis et al. in 2...

Marek Cygan, et al. ∙

research

∙ 10/16/2018

Multi-budgeted directed cuts

We study multi-budgeted variants of the classic minimum cut problem and ...

Stefan Kratsch, et al. ∙

research

∙ 10/20/2018

Proportionality Degree of Multiwinner Rules

We study multiwinner elections with approval-based preferences. An insta...

Piotr Skowron, et al. ∙

research

∙ 11/01/2018

Hanson-Wright inequality in Banach spaces

We discuss two-sided bounds for moments and tails of quadratic forms in ...

Radosław Adamczak, et al. ∙

University of Warsaw

Featured Researchers