Pierre Tholoniat

Pierre Tholoniat

Auto-generated profile, based on publicly available information

Pierre Tholoniat

Columbia University, New York, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2022
Verified
Book Chapter
Closed access
PDF file
PTPierre Tholoniat
Pierre Tholoniat
VGVincent Gramoli
Vincent Gramoli

4 November 2024
Verified
Conference Paper
Open access
PTPierre Tholoniat
Pierre Tholoniat
KKKelly Kostopoulou
Kelly Kostopoulou
PMPeter McNeely
Peter McNeely
PSPrabhpreet Singh Sodhi
Prabhpreet Singh Sodhi
AVAnirudh Varanasi
Anirudh Varanasi
MLMathias Lécuyer
Mathias Lécuyer
With the impending removal of third-party cookies from major browsers and the introduction of new privacy-preserving advertising APIs, the research community has a timely opportunity to assist industry in qualitatively improving the Web's privacy. This paper discusses our efforts, within a W3C community group, to enhance existing privacy-preserving advertising measurement APIs. We analyze designs from Google, Apple, Meta and Mozilla, and augment them with a more rigorous and efficient differential privacy (DP) budgeting component. Our approach, called Cookie Monster, enforces well-defined DP guarantees and enables advertisers to conduct more private measurement queries accurately. By framing the privacy guarantee in terms of an individual form of DP, we can make DP budgeting more efficient than in current systems that use a traditional DP definition. We incorporate Cookie Monster into Chrome and evaluate it on microbenchmarks and advertising datasets. Across workloads, Cookie Monster significantly outperforms baselines in enabling more advertising measurements under comparable DP protection.

8 April 2023 in Distributed Computing
Verified
Journal Article
Open access
PDF file
RGRob van Glabbeek
Rob van Glabbeek
VGVincent Gramoli
Vincent Gramoli
PTPierre Tholoniat
Pierre Tholoniat
In this paper, we consider the problem of cross-chain payment whereby customers of different escrows—implemented by a bank or a blockchain smart contract—successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We introduce a new specification formalism called Asynchronous Networks of Timed Automata to formalise such protocols. We present the first cross-chain payment protocol that ensures termination in a bounded amount of time and works correctly in the presence of clock drift. We then demonstrate that it is impossible to solve this problem without assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time. Yet, we solve an eventually terminating weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals.

23 October 2023
Verified
Conference Paper
Open access
KKKelly Kostopoulou
Kelly Kostopoulou
PTPierre Tholoniat
Pierre Tholoniat
ACAsaf Cidon
Asaf Cidon
RGRoxana Geambasu
Roxana Geambasu
MLMathias Lécuyer
Mathias Lécuyer

30 March 2025
Verified
Conference Paper
Open access
PTPierre Tholoniat
Pierre Tholoniat
KKKelly Kostopoulou
Kelly Kostopoulou
MCMosharaf Chowdhury
Mosharaf Chowdhury
ACAsaf Cidon
Asaf Cidon
RGRoxana Geambasu
Roxana Geambasu
JYJunfeng Yang
Junfeng Yang

12 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
PTPierre Tholoniat
Pierre Tholoniat
HIHuseyin A. Inan
Huseyin A. Inan
JKJanardhan Kulkarni
Janardhan Kulkarni
RSRobert Sim
Robert Sim
This position paper investigates the integration of Differential Privacy (DP) in the training of Mixture of Experts (MoE) models within the field of natural language processing. As Large Language Models (LLMs) scale to billions of parameters, leveraging expansive datasets, they exhibit enhanced linguistic capabilities and emergent abilities. However, this growth raises significant computational and privacy concerns. Our study addresses these issues by exploring the potential of MoE models, known for their computational efficiency, and the application of DP, a standard for privacy preservation. We present the first known attempt to train MoE models under the constraints of DP, addressing the unique challenges posed by their architecture and the complexities of DP integration. Our initial experimental studies demonstrate that MoE models can be effectively trained with DP, achieving performance that is competitive with their non-private counterparts. This initial study aims to provide valuable insights and ignite further research in the domain of privacy-preserving MoE models, softly laying the groundwork for prospective developments in this evolving field.