BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.4.0.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:218@isdm.umontpellier.fr
DTSTART;TZID=Europe/Paris:20240502T140000
DTEND;TZID=Europe/Paris:20240502T140000
DTSTAMP:20260825T133045Z
URL:https://isdm.umontpellier.fr/events/active-clustering-with-bandit-feed
 back/
SUMMARY:Active Clustering with bandit feedback
DESCRIPTION:Room 109\, IMAG\, Triolet campus\n\nMachine Learning in Montpel
 lier\, Theory &amp\; Practice\n\nWe will present the recent Active Cluster
 ing Problem (ACP). In this problem\, a set of items can be partitioned int
 o groups where items within the same group are characterised by the same m
 ulti-dimensional vector. A learner obtains noisy observations of these vec
 tors\, and we consider an active setting where the learner chooses the ord
 er and the number of observations. The objective is to recover the hidden 
 partition of the items\, using as few requests as possible.In the presenta
 tion\, I will explain the ACP and answer two questions. Can we improve upo
 n the number of requests of the simple uniform sampling algorithm\, using 
 the benefits of active sampling ? Is there a fundamental computation-infor
 mation gap for clustering in high-dimension with repeated measurements?\n\
 nMachine Learning in Montpellier\, Theory &amp\; Practice
ATTACH;FMTTYPE=image/jpeg:https://isdm.umontpellier.fr/wp-content/uploads/
 2026/06/ml-mtp-gC78d5.png
CATEGORIES:ML MTP
LOCATION:Triolet Campus- IMAG - Room 109\, Place Eugène Bataillon\, Montpe
 llier\, 
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Place Eugène Bataillon\, M
 ontpellier\, ;X-APPLE-RADIUS=100;X-TITLE=Triolet Campus- IMAG - Room 109:g
 eo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20240331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR