◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jean Tarbouriech

3 papers hereh-index 113.6k citations16 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author1

Across the 2 of 3 papers where every author was matched, so the position is known.

fields
  • cs.LG2
  • cs.CL1

identity via Semantic Scholar / OpenAlex

most citedSample Complexity Bounds for Stochastic Shortest Path with a Generative Model

8 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing cs.LGShow all

2 papers · 1 filter

cs.LG2026

How Transparent is DiffusionGemma?

Joshua Engels, Callum McDougall, Bilal Chughtai +13

LLM reasoning transparency is a critical affordance for understanding model decisions, mitigating misuse and misalignment, and debugging surprising model behaviors. However, Diffus…

cs.LG2026★ 8 cited

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model

Jean Tarbouriech, Matteo Pirotta, Michal Valko +1

We study the sample complexity of learning an I^µ-optimal policy in the Stochastic Shortest Path (SSP) problem. We first derive sample complexity bounds when the learner has acces…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.