output
20022026
most citedTypical random 3-SAT formulae and the satisfiability threshold

146 citations

Showing 2022Show all

8 papers · 1 filter

cs.DS2022

First Order Logic on Pathwidth Revisited Again

Michael Lampis

Courcelle's celebrated theorem states that all MSO-expressible properties can be decided in linear time on graphs of bounded treewidth. Unfortunately, the hidden constant implied b…

cs.DC2022★ 1 cited

Lower bound for constant-size local certification

Virgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley +3

Given a network property or a data structure, a local certification is a labeling that allows to efficiently check that the property is satisfied, or that the structure is correct.…

cs.GT2022★ 1 cited

Smooth Fictitious Play in Stochastic Games with Perturbed Payoffs and Unknown Transitions

Lucas Baudin, Rida Laraki

Recent extensions to dynamic games of the well-known fictitious play learning procedure in static games were proved to globally converge to stationary Nash equilibria in two import…

cs.CV2022

Is the U-Net Directional-Relationship Aware?

Mateus Riva, Pietro Gori, Florian Yger +1

CNNs are often assumed to be capable of using contextual information about distinct objects (such as their directional relations) inside their receptive field. However, the nature…

cs.AI2022★ 1 cited

Cautious Learning of Multiattribute Preferences

Hugo Gilbert, Mohamed Ouaguenouni, Meltem Ozturk +1

This paper is dedicated to a cautious learning methodology for predicting preferences between alternatives characterized by binary attributes (formally, each alternative is seen as…

cs.LG2022★ 2 cited

Towards Consistency in Adversarial Classification

Laurent Meunier, Raphaël Ettedgui, Rafael Pinot +2

In this paper, we study the problem of consistency in the context of adversarial examples. Specifically, we tackle the following question: can surrogate losses still be used as a p…