activity
20182021
most citedImproving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

cs.GT2021

Computing Stackelberg Equilibrium with Memory in Sequential Games

Aditya Aradhye, Branislav Bošanský, Michael Hlaváček

Stackelberg equilibrium is a solution concept that describes optimal strategies to commit: Player 1 (the leader) first commits to a strategy that is publicly announced, then Player…

cs.LG20211 cited

Improving Robustness of Malware Classifiers using Adversarial Strings Generated from Perturbed Latent Representations

Marek Galovic, Branislav Bosansky, Viliam Lisy

In malware behavioral analysis, the list of accessed and created files very often indicates whether the examined file is malicious or benign. However, malware authors are trying to…

cs.LG2020

Discovering Imperfectly Observable Adversarial Actions using Anomaly Detection

Olga Petrova, Karel Durkota, Galina Alperovich +4

Anomaly detection is a method for discovering unusual and suspicious behavior. In many real-world scenarios, the examined events can be directly linked to the actions of an adversa…

cs.GT2019

Compact Representation of Value Function in Partially Observable Stochastic Games

Karel Horák, Branislav Bošanský, Christopher Kiekintveld +1

Value methods for solving stochastic games with partial observability model the uncertainty about states of the game as a probability distribution over possible states. The dimensi…

cs.GT2018

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games

Jiri Cermak, Viliam Lisy, Branislav Bosansky

Extensive-form games (EFGs) model finite sequential interactions between players. The amount of memory required to represent these games is the main bottleneck of algorithms for co…