activity
20162026
most citedGemma: Open Models Based on Gemini Research and Technology

238 citations · 535 across the 27 of their papers we have counts for

collaborators
Showing cs.LGShow all

13 papers · 1 filter

cs.LG2024★ 1 cited

Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design

Melis Ilayda Bal, Pier Giuseppe Sessa, Mojmir Mutny +1

Bayesian optimization (BO) is a powerful framework to optimize black-box expensive-to-evaluate functions via sequential interactions. In several important problems (e.g. drug disco…

cs.LG2024★ 1 cited

BOND: Aligning LLMs with Best-of-N Distillation

Pier Giuseppe Sessa, Robert Dadashi, Léonard Hussenot +17

Reinforcement learning from human feedback (RLHF) is a key driver of quality and safety in state-of-the-art large language models. Yet, a surprisingly simple and strong inference-t…

cs.LG2024★ 1 cited

WARP: On the Benefits of Weight Averaged Rewarded Policies

Alexandre Ramé, Johan Ferret, Nino Vieillard +7

Reinforcement learning from human feedback (RLHF) aligns large language models (LLMs) by encouraging their generations to have high rewards, using a reward model trained on human p…

cs.LG2024★ 4 cited

RecurrentGemma: Moving Past Transformers for Efficient Open Language Models

Aleksandar Botev, Soham De, Samuel L Smith +59

We introduce RecurrentGemma, a family of open language models which uses Google's novel Griffin architecture. Griffin combines linear recurrences with local attention to achieve ex…

cs.LG2023★ 3 cited

DockGame: Cooperative Games for Multimeric Rigid Protein Docking

Vignesh Ram Somnath, Pier Giuseppe Sessa, Maria Rodriguez Martinez +1

Protein interactions and assembly formation are fundamental to most biological processes. Predicting the assembly structure from constituent proteins -- referred to as the protein…

cs.LG2023★ 1 cited

Distributionally Robust Model-based Reinforcement Learning with Large State Spaces

Shyam Sundhar Ramesh, Pier Giuseppe Sessa, Yifan Hu +2

Three major challenges in reinforcement learning are the complex dynamical systems with large state spaces, the costly data acquisition processes, and the deviation of real-world d…

cs.LG2023

Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning

Pier Giuseppe Sessa, Pierre Laforgue, Nicolò Cesa-Bianchi +1

Multitask learning is a powerful framework that enables one to simultaneously learn multiple related tasks by sharing information between them. Quantifying uncertainty in the estim…

cs.LG2023★ 2 cited

Adversarial Causal Bayesian Optimization

Scott Sussex, Pier Giuseppe Sessa, Anastasiia Makarova +1

In Causal Bayesian Optimization (CBO), an agent intervenes on an unknown structural causal model to maximize a downstream reward variable. In this paper, we consider the generaliza…

cs.LG2022★ 1 cited

Model-based Causal Bayesian Optimization

Scott Sussex, Anastasiia Makarova, Andreas Krause

How should we intervene on an unknown structural equation model to maximize a downstream variable of interest? This setting, also known as causal Bayesian optimization (CBO), has i…

cs.LG2022★ 1 cited

Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation

Pier Giuseppe Sessa, Maryam Kamgarpour, Andreas Krause

We consider model-based multi-agent reinforcement learning, where the environment transition model is unknown and can only be learned via expensive interactions with the environmen…

cs.LG2020★ 1 cited

Learning to Play Sequential Games versus Unknown Opponents

Pier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour +1

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to succes…

cs.LG2020★ 1 cited

Mixed Strategies for Robust Optimization of Unknown Objectives

Pier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour +1

We consider robust optimization problems, where the goal is to optimize an unknown objective function against the worst-case realization of an uncertain parameter. For this setting…

cs.LG2019

No-Regret Learning in Unknown Games with Correlated Payoffs

Pier Giuseppe Sessa, Ilija Bogunovic, Maryam Kamgarpour +1

We consider the problem of learning to play a repeated multi-agent game with an unknown reward function. Single player online learning algorithms attain strong regret bounds when p…