output
20132026
most citedModulating early visual processing by language

298 citations

Showing cs.AIShow all

18 papers · 1 filter

cs.AI2025

Reasoning Core: A Scalable RL Environment for LLM Symbolic Reasoning

Valentin Lacombe, Valentin Quesnel, Damien Sileo

We introduce Reasoning Core, a new scalable environment for Reinforcement Learning with Verifiable Rewards (RLVR), designed to advance foundational symbolic reasoning in Large Lang…

cs.AI2025★ 1 cited

The Fair Game: Auditing & Debiasing AI Algorithms Over Time

Debabrota Basu, Udvas Das

An emerging field of AI, namely Fair Machine Learning (ML), aims to quantify different types of bias (also known as unfairness) exhibited in the predictions of ML algorithms, and t…

cs.AI2025★ 1 cited

Exploring Flow-Lenia Universes with a Curiosity-driven AI Scientist: Discovering Diverse Ecosystem Dynamics

Thomas Michel, Marko Cvjetko, Gautier Hamon +2

We present a curiosity-driven AI scientist method for discovering system-level dynamics in Flow-Lenia, a continuous cellular automaton (CA) with mass conservation and parameter loc…

cs.AI2025

Bridging Econometrics and AI: VaR Estimation via Reinforcement Learning and GARCH Models

Fredy Pokou, Jules Sadefo Kamdem, François Benhmad

In an environment of increasingly volatile financial markets, the accurate estimation of risk remains a major challenge. Traditional econometric models, such as GARCH and its varia…

cs.AI2024★ 4 cited

Bridging the Data Provenance Gap Across Text, Speech and Video

Shayne Longpre, Nikhil Singh, Manuel Cherep +40

Progress in AI is driven largely by the scale and quality of training data. Despite this, there is a deficit of empirical analysis examining the attributes of well-established data…

cs.AI2024

IDEQ -- Improving Diffusion Models for the Traveling Salesman Problem (TSP) by Leveraging the Structure of the Solution Space

Mickael Basson, Philippe Preux

We investigate diffusion models to solve the Traveling Salesman Problem. Building on the recent DIFUSCO and T2TCO approaches, we propose IDEQ. IDEQ improves the quality of the solu…

cs.AI2024

Power Mean Estimation in Stochastic Monte-Carlo Tree_Search

Tuan Dam, Odalric-Ambrym Maillard, Emilie Kaufmann

Monte-Carlo Tree Search (MCTS) is a widely-used strategy for online planning that combines Monte-Carlo sampling with forward tree search. Its success relies on the Upper Confidence…

cs.AI2024

Interpretable and Editable Programmatic Tree Policies for Reinforcement Learning

Hector Kohler, Quentin Delfosse, Riad Akrour +2

Deep reinforcement learning agents are prone to goal misalignments. The black-box nature of their policies hinders the detection and correction of such misalignments, and the trust…

cs.AI2024★ 3 cited

Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey

El-Ghazali Talbi

Many real world optimization problems are formulated as mixed-variable optimization problems (MVOPs) which involve both continuous and discrete variables. MVOPs including dimension…

cs.AI2023

A Virtual-Force Based Swarm Algorithm for Balanced Circular Bin Packing Problems

Juliette Gamot, Mathieu Balesdent, Romain Wuilbercq +3

Balanced circular bin packing problems consist in positioning a given number of weighted circles in order to minimize the radius of a circular container while satisfying equilibriu…

cs.AI2023★ 6 cited

Applying Ising Machines to Multi-objective QUBOs

Mayowa Ayodele, Richard Allmendinger, Manuel López-Ibáñez +2

Multi-objective optimisation problems involve finding solutions with varying trade-offs between multiple and often conflicting objectives. Ising machines are physical devices that…

cs.AI2022★ 11 cited

gym-DSSAT: a crop model turned into a Reinforcement Learning environment

Romain Gautron, Emilio J. Padrón, Philippe Preux +3

Addressing a real world sequential decision problem with Reinforcement Learning (RL) usually starts with the use of a simulated environment that mimics real conditions. We present…

cs.AI2021

Indexed Minimum Empirical Divergence for Unimodal Bandits

Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard

We consider a multi-armed bandit problem specified by a set of one-dimensional family exponential distributions endowed with a unimodal structure. We introduce IMED-UB, a algorithm…

cs.AI2021★ 1 cited

On Limited-Memory Subsampling Strategies for Bandits

Dorian Baudry, Yoan Russac, Olivier Cappé

There has been a recent surge of interest in nonparametric bandit algorithms based on subsampling. One drawback however of these approaches is the additional complexity required by…

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.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.AI2017★ 80 cited

HoME: a Household Multimodal Environment

Simon Brodeur, Ethan Perez, Ankesh Anand +6

We introduce HoME: a Household Multimodal Environment for artificial agents to learn from vision, audio, semantics, physics, and interaction with objects and other agents, all with…

cs.AI2016★ 19 cited

GuessWhat?! Visual object discovery through multi-modal dialogue

Harm de Vries, Florian Strub, Sarath Chandar +3

We introduce GuessWhat?!, a two-player guessing game as a testbed for research on the interplay of computer vision and dialogue systems. The goal of the game is to locate an unknow…