output
20142026
most citedCooperating with Machines

235 citations

17 papers

cs.LG2026

Hierarchical Bayesian optimization of an aircraft-based multi-agent system-of-systems

Paul Saves, Thierry Lefebvre, Nathalie Bartoli +4

Developing innovative system architectures increasingly relies on advanced modeling and optimization techniques to frame the architecting process and define the corresponding compu…

cs.CY2022★ 11 cited

Understanding Political Divisiveness using Online Participation data from the 2022 French and Brazilian Presidential Elections

Carlos Navarrete, Mariana Macedo, Rachael Colley +8

Digital technologies can augment civic participation by facilitating the expression of detailed political preferences. Yet, digital participation efforts often rely on methods opti…

econ.EM2022★ 1 cited

Encompassing Tests for Nonparametric Regressions

Elia Lapenta, Pascal Lavergne

We set up a formal framework to characterize encompassing of nonparametric models through the L2 distance. We contrast it to previous literature on the comparison of nonparametric…

math.OC2019★ 31 cited

Optimal Complexity and Certification of Bregman First-Order Methods

Radu-Alexandru Dragomir, Adrien Taylor, Alexandre d'Aspremont +1

We provide a lower bound showing that the convergence rate of the NoLips method (a.k.a. Bregman Gradient) is optimal for the class of functions satisfying the -smoothne…

math.ST2018★ 28 cited

Spatial Blind Source Separation

François Bachoc, Marc G. Genton, Klaus Nordhausen +2

Recently a blind source separation model was suggested for spatial data together with an estimator based on the simultaneous diagonalisation of two scatter matrices. The asymptotic…

econ.EM2018

Inference on a Distribution from Noisy Draws

Koen Jochmans, Martin Weidner

We consider a situation where the distribution of a random variable is being estimated by the empirical distribution of noisy measurements of that variable. This is common practice…

math.OC2017

The multiproximal linearization method for convex composite problems

Jérôme Bolte, Zheng Chen, Edouard Pauwels

Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smoot…

physics.soc-ph2017★ 129 cited

How social information can improve estimation accuracy in human groups

Bertrand Jayles, Hye-rin Kim, Ramón Escobedo +5

In our digital and connected societies, the development of social networks, online shopping, and reputation systems raises the question of how individuals use social information, a…

math.OC2017★ 4 cited

Communicating Zero-Sum Product Stochastic Games

Tristan Garrec

We study two classes of zero-sum stochastic games with compact action sets and a finite product state space. These two classes assume a communication property on the state spaces o…

stat.ME2017★ 46 cited

On optimal tests for rotational symmetry against new classes of hyperspherical distributions

Eduardo García-Portugués, Davy Paindaveine, Thomas Verdebout

Motivated by the central role played by rotationally symmetric distributions in directional statistics, we consider the problem of testing rotational symmetry on the hypersphere. W…

cs.AI2017★ 235 cited

Cooperating with Machines

Jacob W. Crandall, Mayada Oudah, Tennom +7

Since Alan Turing envisioned Artificial Intelligence (AI) [1], a major driving force behind technical progress has been competition with human cognition. Historical milestones have…

math-ph2017★ 16 cited

Kinetic models for topological nearest-neighbor interactions

Adrien Blanchet, Pierre Degond

We consider systems of agents interacting through topological interactions. These have been shown to play an important part in animal andhuman behavior. Precisely, the system consi…

stat.CO2016★ 7 cited

REPPlab: An R package for detecting clusters and outliers using exploratory projection pursuit

Daniel Fischer, Alain Berro, Klaus Nordhausen +1

The R-package REPPlab is designed to explore multivariate data sets using one-dimensional unsupervised projection pursuit. It is useful in practice as a preprocessing step to find…

cs.AI2016★ 30 cited

Graph Aggregation

Ulle Endriss, Umberto Grandi

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs…

econ.GN2015★ 12 cited

Key drivers of EU budget allocation: Does power matter?

Vera Zaporozhets, María García-Valiñas, Sascha Kurz

We examine the determinants of the EU budget expenditures allocation among different countries. In line with earlier literature, we consider two alternative explanations for the EU…

math.PR2015★ 2 cited

Regret bounds for Narendra-Shapiro bandit algorithms

Sébastien Gadat, Fabien Panloup, Sofiane Saadane

Narendra-Shapiro (NS) algorithms are bandit-type algorithms that have been introduced in the sixties (with a view to applications in Psychology or learning automata), whose converg…

math.OC2014★ 12 cited

On values of repeated games with signals

Hugo Gimbert, Jérôme Renault, Sylvain Sorin +2

We study the existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing tha…