output
20132026
most citedModulating early visual processing by language

298 citations

Showing 2018Show all

32 papers · 1 filter

stat.ML2018★ 13 cited

A determinantal point process for column subset selection

Ayoub Belhadji, Rémi Bardenet, Pierre Chainais

Dimensionality reduction is a first step of many machine learning pipelines. Two popular approaches are principal component analysis, which projects onto a small number of well cho…

cs.SE2018★ 22 cited

A Large-Scale Study of Call Graph-based Impact Prediction using Mutation Testing

Vincenzo Musco, Martin Monperrus, Philippe Preux

In software engineering, impact analysis involves predicting the software elements (e.g., modules, classes, methods) potentially impacted by a change in the source code. Impact ana…

cs.AI2018★ 104 cited

Deep Reinforcement Learning and the Deadly Triad

Hado van Hasselt, Yotam Doron, Florian Strub +3

We know from reinforcement learning theory that temporal difference learning can fail in certain cases. Sutton and Barto (2018) identify a deadly triad of function approximation, b…

cs.DB2018★ 11 cited

Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

Antoine Amarilli, Pierre Bourhis, Stefan Mengel +1

We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the…

cs.AI2018★ 31 cited

Matheuristics to optimize refueling and maintenance planning of nuclear power plants

Nicolas Dupin, El-Ghazali Talbi

Planning the maintenance of nuclear power plants is a complex optimization problem, involving a joint optimization of maintenance dates, fuel constraints and power production decis…

cs.SE2018★ 71 cited

How to Design a Program Repair Bot? Insights from the Repairnator Project

Simon Urli, Zhongxing Yu, Lionel Seinturier +1

Program repair research has made tremendous progress over the last few years, and software development bots are now being invented to help developers gain productivity. In this pap…

cs.SE2018★ 7 cited

Out-Of-Place debugging: a debugging architecture to reduce debugging interference

Matteo Marra, Guillermo Polito, Elisa Gonzalez Boix

Context. Recent studies show that developers spend most of their programming time testing, verifying and debugging software. As applications become more and more complex, developer…

cs.DB2018★ 14 cited

Connecting Knowledge Compilation Classes and Width Parameters

Antoine Amarilli, Florent Capelli, Mikaël Monet +1

The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structure…

stat.OT2018★ 1 cited

Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces

John Klein

We prove that intersections and unions of independent random sets in finite spaces achieve a form of Lipschitz continuity. More precisely, given the distribution of a random set $Ξ…

cs.CC2018★ 1 cited

Enumerating models of DNF faster: breaking the dependency on the formula size

Florent Capelli, Yann Strozecki

In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of…

cs.LG2018★ 1 cited

DPPy: Sampling DPPs with Python

Guillaume Gautier, Guillermo Polito, Rémi Bardenet +1

Determinantal point processes (DPPs) are specific probability distributions over clouds of points that are used as models and computational tools across physics, probability, stati…

eess.SY2018★ 28 cited

Towards Efficient Maximum Likelihood Estimation of LPV-SS Models

Pepijn B. Cox, Roland Tóth, Mihály Petreczky

How to efficiently identify multiple-input multiple-output (MIMO) linear parameter-varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling vari…

cs.DB2018★ 1 cited

Evaluating Datalog via Tree Automata and Cycluits

Antoine Amarilli, Pierre Bourhis, Mikaël Monet +1

We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-gu…

stat.AP2018

Bayesian Calibration using Different Prior Distributions: an Iterative Maximum A Posteriori Approach for Radio Interferometers

Virginie Ollier, Mohammed Nabil El Korso, André Ferrari +2

In this paper, we aim to design robust estimation techniques based on the compound-Gaussian (CG) process and adapted for calibration of radio interferometers. The motivation beyond…

cs.CC2018

Knowledge Compilation, Width and Quantification

Florent Capelli, Stefan Mengel

We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start b…

cs.NI2018

Multi-Armed Bandit Learning in IoT Networks: Learning helps even in non-stationary settings

Rémi Bonnefoi, Lilian Besson, Christophe Moy +2

Setting up the future Internet of Things (IoT) networks will require to support more and more communicating devices. We prove that intelligent devices in unlicensed bands can use M…

cs.CV2018

A Novel Geometric Framework on Gram Matrix Trajectories for Human Behavior Understanding

Anis Kacem, Mohamed Daoudi, Boulbaba Ben Amor +2

In this paper, we propose a novel space-time geometric representation of human landmark configurations and derive tools for comparison and classification. We model the temporal evo…

cs.RO2018

Motion Planning for a Humanoid Mobile Manipulator System

Yan Wei, Wei Jiang, Ahmed Rahmani +1

A high redundant non-holonomic humanoid mobile dual-arm manipulator system is presented in this paper where the motion planning to realize "human-like" autonomous navigation and ma…

cs.CL2018★ 14 cited

Unsupervised Word Segmentation from Speech with Attention

Pierre Godard, Marcely Zanon-Boito, Lucas Ondel +4

We present a first attempt to perform attentional word segmentation directly from the speech signal, with the final goal to automatically identify lexical units in a low-resource,…

stat.ML2018★ 13 cited

Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling

Emilie Kaufmann, Wouter Koolen, Aurelien Garivier

Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning…

math.OC2018

Dual heuristics and new dual bounds to schedule the maintenances of nuclear power plants

Nicolas Dupin, El-Ghazali Talbi

The EURO/ROADEF 2010 Challenge aimed to schedule the maintenance and refueling operations of French nuclear power plants, ranking the approaches in competition for the quality of p…

stat.CO2018★ 27 cited

Robust Covariance Adaptation in Adaptive Importance Sampling

Yousef El-Laham, Victor Elvira, Monica F. Bugallo

Importance sampling (IS) is a Monte Carlo methodology that allows for approximation of a target distribution using weighted samples generated from another proposal distribution. Ad…

cs.CV2018★ 23 cited

Deep Covariance Descriptors for Facial Expression Recognition

Naima Otberdout, Anis Kacem, Mohamed Daoudi +2

In this paper, covariance matrices are exploited to encode the deep convolutional neural networks (DCNN) features for facial expression recognition. The space geometry of the covar…

cs.CV2018★ 56 cited

Advanced local motion patterns for macro and micro facial expression recognition

B. Allaert, IM. Bilasco, C. Djeraba

In this paper, we develop a new method that recognizes facial expressions, on the basis of an innovative local motion patterns feature, with three main contributions. The first one…