activity
20212026
most citedBudgeted Online Influence Maximization

7 citations · 7 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CV2026

MOTIP2: Spatial Priors for End-to-End Multi-Object Tracking

Benoît Roussel, Damien Bouet, Liming Chen +1

End-to-end multi-object trackers have narrowed the gap with classical tracking-by-detection on association-difficult benchmarks. Yet they still make spatially implausible errors no…

cs.LG2026★ 7 cited

Budgeted Online Influence Maximization

Pierre Perrault, Jennifer Healey, Zheng Wen +1

We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a cho…

math.PR2024

A New Bound on the Cumulant Generating Function of Dirichlet Processes

Pierre Perrault, Denis Belomestny, Pierre Ménard +4

In this paper, we introduce a novel approach for bounding the cumulant generating function (CGF) of a Dirichlet process (DP) , using superadditivity. In par…

cs.CV2024

Limitations of (Procrustes) Alignment in Assessing Multi-Person Human Pose and Shape Estimation

Drazic Martin, Pierre Perrault

We delve into the challenges of accurately estimating 3D human pose and shape in video surveillance scenarios. Beginning with the advocacy for metrics like W-MPJPE and W-PVE, which…

stat.ML2023

Model-free Posterior Sampling via Learning Rate Randomization

Daniil Tiapkin, Denis Belomestny, Daniele Calandriello +6

In this paper, we introduce Randomized Q-learning (RandQL), a novel randomized model-free algorithm for regret minimization in episodic Markov Decision Processes (MDPs). To the bes…

stat.ML2023

Demonstration-Regularized RL

Daniil Tiapkin, Denis Belomestny, Daniele Calandriello +5

Incorporating expert demonstrations has empirically helped to improve the sample efficiency of reinforcement learning (RL). This paper quantifies theoretically to what extent this…

cs.DS2021

On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions

Pierre Perrault, Jennifer Healey, Zheng Wen +1

We demonstrate that from an algorithm guaranteeing an approximation factor for the ratio of submodular (RS) optimization problem, we can build another algorithm having a different…