Arrow Research search

Author name cluster

Olivier Laurent

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers
1 author row

Possible papers

6

NeurIPS Conference 2025 Conference Paper

Torch-Uncertainty: Deep Learning Uncertainty Quantification

  • Adrien Lafage
  • Olivier Laurent
  • Firas Gabetni
  • Gianni Franchi

Deep Neural Networks (DNNs) have demonstrated remarkable performance across various domains, including computer vision and natural language processing. However, they often struggle to accurately quantify their predictions' uncertainty, limiting their broader adoption in critical industrial applications. Uncertainty Quantification (UQ) for Deep Learning seeks to address this challenge by providing methodologies to improve the reliability of uncertainty estimates. While numerous techniques have been proposed, a unified tool remains lacking that offers a seamless workflow for evaluating and integrating these methods. To bridge this gap, we introduce Torch-Uncertainty, a PyTorch and Lightning framework designed to streamline the training and evaluation of DNNs with UQ techniques. In this paper, we outline the foundational principles of our library and present comprehensive experimental results that benchmark a diverse set of UQ methods across classification, segmentation, and regression tasks. Our library is available at: https: //github. com/ENSTA-U2IS-AI/torch-uncertainty.

TCS Journal 2020 Journal Article

Polynomial time in untyped elementary linear logic

  • Olivier Laurent

We show how to represent polynomial time computation in an untyped version of proof-nets for elementary linear logic. This follows previous work by P. Baillot but which was developed in a typed and affine setting. We describe how these two properties can be adapted.

TCS Journal 2010 Journal Article

An exact correspondence between a typed pi-calculus and polarised proof-nets

  • Kohei Honda
  • Olivier Laurent

This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed π -calculus based on IO-typing. The respective incremental constraints, one on geometric structures of proof-nets and one based on types, precisely correspond to each other, leading to the exact correspondence of the respective formalisms as they appear in Olivier Laurent (2003) [27] (for proof-nets) and Kohei Honda et al. (2004) [24] (for the π -calculus).

I&C Journal 2010 Journal Article

Interpreting a finitary pi-calculus in differential interaction nets

  • Thomas Ehrhard
  • Olivier Laurent

We propose and study a translation of a pi-calculus without sums nor recursion into an untyped version of differential interaction nets. We define a transition system of labeled processes and a transition system of labeled differential interaction nets. We prove that our translation from processes to nets is a bisimulation between these two transition systems. This shows that differential interaction nets are sufficiently expressive for representing concurrency and mobility, as formalized by the pi-calculus. Our study will concern essentially a replication-free fragment of the pi-calculus, but we shall also give indications on how to deal with a restricted form of replication.

TCS Journal 2005 Journal Article

Syntax vs. semantics: A polarized approach

  • Olivier Laurent

We present a notion of sliced proof-nets for the polarized fragment of Linear Logic and a corresponding game model. We show that the connection between them is very strong through an equivalence of categories (this contains soundness, full completeness and faithful completeness).

TCS Journal 2003 Journal Article

Polarized proof-nets and λμ-calculus

  • Olivier Laurent

We first define polarized proof-nets, an extension of MELL proof-nets for the polarized fragment of linear logic; the main difference with usual proof-nets is that we allow structural rules on any negative formula. The essential properties (confluence, strong normalization in the typed case) of polarized proof-nets are proved using a reduction preserving translation into usual proof-nets. We then give a reduction preserving encoding of Parigot's λμ-terms for classical logic as polarized proof-nets. It is based on the intuitionistic translation: A→B⇝! A⊸B, so that it is a straightforward extension of the usual translation of λ-calculus into proof-nets. We give a reverse encoding which sequentializes any polarized proof-net as a λμ-term. In the last part of the paper, we extend the σ-equivalence for λ-calculus to λμ-calculus. Interestingly, this new σ-equivalence relation identifies normal λμ-terms. We eventually show that two terms are equivalent iff they are translated as the same polarized proof-net; thus the set of polarized proof-nets represents the quotient of λμ-calculus by σ-equivalence.

v2026.09.13