← Search

Alexandre Lacoste

24 accepted papers

2026

Position: Agentic Systems Should be General

ICML 2026poster

We call for the development of agentic systems that thrive in new environments. Agentic systems, comprising foundation models, tools, and an execution strategy, have demonstrated strong capabilities, yet their development is often constrained by narrow benchmarks and their operation is siloed to lim…

Cited by 0SourceScholar
2026

Privileged Information Distillation for Language Models

ICML 2026poster

Training-time privileged information (PI) can enable language models to succeed on tasks they would otherwise fail, making it a powerful tool for reinforcement learning in hard, long-horizon settings. However, transferring capabilities learned with PI to policies that must act without it at inferenc…

Cited by 0SourceScholar
2025

Context is Key: A Benchmark for Forecasting with Essential Textual Information

ICML 2025poster

Forecasting is a critical task in decision-making across numerous domains. While historical numerical data provide a start, they fail to convey the complete context for reliable and accurate predictions. Human forecasters frequently rely on additional information, such as background knowledge and co…

2025

GEOBench-VLM: Benchmarking Vision-Language Models for Geospatial Tasks

ICCV 2025poster

While numerous recent benchmarks focus on evaluating generic Vision-Language Models (VLMs), they do not effectively address the specific challenges of geospatial applications.Generic VLM benchmarks are not designed to handle the complexities of geospatial data, an essential component for application…

2025

How to Train Your LLM Web Agent: A Statistical Diagnosis

NeurIPS 2025poster

Large language model (LLM) agents for web interfaces have advanced rapidly, yet open-source systems still lag behind proprietary agents. Bridging this gap is key to enabling customizable, efficient, and privacy-preserving agents. Two challenges hinder progress: the reproducibility issues in RL and L…

Cited by 0SourceScholar
2025

InsightBench: Evaluating Business Analytics Agents Through Multi-Step Insight Generation

ICLR 2025poster

Data analytics is essential for extracting valuable insights from data that can assist organizations in making effective decisions. We introduce InsightBench, a benchmark dataset with three key features. First, it consists of 100 datasets representing diverse business use cases such as finance and i…

2024

WorkArena++: Towards Compositional Planning and Reasoning-based Common Knowledge Work Tasks

NeurIPS 2024poster

The ability of large language models (LLMs) to mimic human-like intelligence has led to a surge in LLM-based autonomous agents. Though recent LLMs seem capable of planning and reasoning given user instructions, their effectiveness in applying these capabilities for autonomous task solving remains u…

2024

WorkArena: How Capable are Web Agents at Solving Common Knowledge Work Tasks?

ICML 2024poster

We study the use of large language model-based agents for interacting with software via web browsers. Unlike prior work, we focus on measuring the agents' ability to perform tasks that span the typical daily work of knowledge workers utilizing enterprise software systems. To this end, we propose Wor…

Cited by 61SourcePDFScholar
2023

Choreographer: Learning and Adapting Skills in Imagination

ICLR 2023top-25%

Unsupervised skill learning aims to learn a rich repertoire of behaviors without external supervision, providing artificial agents with the ability to control and influence the environment. However, without appropriate knowledge and exploration, skills may provide control only over a restricted area…

2023

GEO-Bench: Toward Foundation Models for Earth Monitoring

NeurIPS 2023poster

Recent progress in self-supervision has shown that pre-training large neural networks on vast amounts of unsupervised data can lead to substantial increases in generalization to downstream tasks. Such models, recently coined foundation models, have been transformational to the field of natural lang…

2023

Mastering the Unsupervised Reinforcement Learning Benchmark from Pixels

ICML 2023oral

Controlling artificial agents from visual sensory data is an arduous task. Reinforcement learning (RL) algorithms can succeed but require large amounts of interactions between the agent and the environment. To alleviate the issue, unsupervised RL proposes to employ self-supervised interaction and le…

2021

Beyond Trivial Counterfactual Explanations With Diverse Valuable Explanations

ICCV 2021poster

Explainability for machine learning models has gained considerable attention within the research community given the importance of deploying more reliable machine-learning systems. In computer vision applications, generative counterfactual methods indicate how to perturb a model's input to change it…

Cited by 72PDFcodeScholar
2021

Seasonal Contrast: Unsupervised Pre-Training From Uncurated Remote Sensing Data

ICCV 2021poster

Remote sensing and automatic earth monitoring are key to solve global-scale challenges such as disaster prevention, land use monitoring, or tackling climate change. Although there exist vast amounts of remote sensing data, most of it remains unlabeled and thus inaccessible for supervised learning al…

Cited by 336PDFcodeScholar
2020

Differentiable Causal Discovery from Interventional Data

NeurIPS 2020spotlight

Learning a causal directed acyclic graph from data is a challenging task that involves solving a combinatorial problem for which the solution is not always identifiable. A new line of work reformulates this problem as a continuous constrained optimization one, which is solved via the augmented Lagra…

2020

Embedding Propagation: Smoother Manifold for Few-Shot Classification

ECCV 2020poster

Few-shot classification is challenging because the data distribution of the training set can be widely different to the test set as their classes are disjoint. This distribution shift often results in poor generalization. Manifold smoothing has been shown to address the distribution shift problem by…

2020

Online Fast Adaptation and Knowledge Accumulation (OSAKA): a New Approach to Continual Learning

NeurIPS 2020poster

Continual learning agents experience a stream of (related) tasks. The main challenge is that the agent must not forget previous tasks and also adapt to novel tasks in the stream. We are interested in the intersection of two recent continual-learning scenarios. In meta-continual learning, the model i…

2020

Stochastic Neural Network with Kronecker Flow

AISTATS 2020poster

Recent advances in variational inference enable the modelling of highly structured joint distributions, but are limited in their capacity to scale to the high-dimensional setting of stochastic neural networks. This limitation motivates a need for scalable parameterizations of the noise generation pr…

Cited by 10SourcePDFScholar
2020

Synbols: Probing Learning Algorithms with Synthetic Datasets

NeurIPS 2020poster

Progress in the field of machine learning has been fueled by the introduction of benchmark datasets pushing the limits of existing algorithms. Enabling the design of datasets to test specific properties and failure modes of learning algorithms is thus a problem of high interest, as it has a direct…

2019

Hierarchical Importance Weighted Autoencoders

ICML 2019oral

Importance weighted variational inference (Burda et al., 2015) uses multiple i.i.d. samples to have a tighter variational lower bound. We believe a joint proposal has the potential of reducing the number of redundant samples, and introduce a hierarchical structure to induce correlation. The hope is…

Cited by 25SourcePDFScholar
2019

Probability Distillation: A Caveat and Alternatives

UAI 2019poster

Due to Van den Oord et al. (2018), probability distillation has recently been of interest to deep learning practitioners, where, as a practical workaround for deploying autoregressive models in real-time applications, a student net-work is used to obtain quality samples in parallel. We identify a…

Cited by 13SourcePDFScholar
2018

Improving Explorability in Variational Inference with Annealed Variational Objectives

NeurIPS 2018poster

Despite the advances in the representational capacity of approximate distributions for variational inference, the optimization process can still limit the density that is ultimately learned. We demonstrate the drawbacks of biasing the true posterior to be unimodal, and introduce Annealed Variational…

Cited by 71SourcePDFScholar
2018

TADAM: Task dependent adaptive metric for improved few-shot learning

NeurIPS 2018poster

Few-shot learning has become essential for producing models that generalize from few examples. In this work, we identify that metric scaling and metric task conditioning are important to improve the performance of few-shot algorithms. Our analysis reveals that simple metric scaling completely change…

Cited by 1703SourcePDFScholar
2016

PAC-Bayesian Theory Meets Bayesian Inference

NeurIPS 2016poster

We exhibit a strong link between frequentist PAC-Bayesian bounds and the Bayesian marginal likelihood. That is, for the negative log-likelihood loss function, we show that the minimization of PAC-Bayesian generalization bounds maximizes the Bayesian marginal likelihood. This provides an alternative…

Cited by 215SourcePDFScholar