↓Skip to main content

🏢 Université Paris-Saclay

Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
·1315 words·7 mins· loading · loading
Reinforcement Learning 🏢 Université Paris-Saclay
A novel Thompson Sampling variant achieves polynomial regret for combinatorial bandits, solving a key limitation of existing methods and offering significantly improved performance.
Shape analysis for time series
·2156 words·11 mins· loading · loading
Machine Learning Representation Learning 🏢 Université Paris-Saclay
TS-LDDMM: Unsupervised time-series analysis handles irregular data, offering interpretable shape-based representations & exceeding existing methods in benchmarks.