Workshop
PAC-Bayes Meets Interactive Learning
Hamish Flynn · Maxime Heuillet · Audrey Durand · Melih Kandemir · Benjamin Guedj
Fri 28 Jul, noon PDT
Interactive learning encompasses online learning, continual learning, active learning, bandits, reinforcement learning, and other settings where an algorithm must learn while interacting with a continual stream of data. Such problems often involve exploration-exploitation dilemmas, which can be elegantly handled with probabilistic and Bayesian methods. Deep interactive learning methods leveraging neural networks are typically used when the setting involves rich observations, such as images. As a result, both probabilistic and deep interactive learning methods are growing in popularity. However, acquiring observations in an interactive fashion with the environment can be costly. There is therefore great interest in understanding when sample-efficient learning with probabilistic and deep interactive learning can be expected or guaranteed. Within statistical learning theory, PAC-Bayesian theory is designed for the analysis of probabilistic learning methods. It has recently been shown to be well-suited for the analysis of deep learning methods. This workshop aims to bring together researchers from the broad Bayesian and interactive learning communities in order to foster the emergence of new ideas that could contribute to both theoretical and empirical advancement of PAC-Bayesian theory in interactive learning settings.
Schedule
Fri 12:00 p.m. - 12:15 p.m.
|
Welcome
(
Opening Remarks
)
>
|
🔗 |
Fri 12:15 p.m. - 1:00 p.m.
|
PAC-Bayes Tutorial
(
Invited Talk
)
>
|
🔗 |
Fri 1:00 p.m. - 1:30 p.m.
|
Poster session 1
(
Poster Session
)
>
|
🔗 |
Fri 1:30 p.m. - 2:15 p.m.
|
Invited talk: Lessons Learned from Studying PAC-Bayes and Generalization
(
Invited Talk
)
>
SlidesLive Video |
Gintare Karolina Dziugaite 🔗 |
Fri 2:15 p.m. - 3:00 p.m.
|
Invited Talk 2: A unified recipe for deriving (time-uniform) PAC-Bayes bounds
(
Invited Talk
)
>
|
Aaditya Ramdas 🔗 |
Fri 3:00 p.m. - 4:00 p.m.
|
Lunch break
|
🔗 |
Fri 4:00 p.m. - 4:10 p.m.
|
Improved Time-Uniform PAC-Bayes Bounds using Coin Betting
(
Contributed Talk
)
>
link
SlidesLive Video |
Kyoungseok Jang · Kwang-Sung Jun · Ilja Kuzborskij · Francesco Orabona 🔗 |
Fri 4:10 p.m. - 4:20 p.m.
|
PAC-Bayesian Offline Contextual Bandits with Guarantees
(
Contributed Talk
)
>
link
SlidesLive Video |
Otmane Sakhi · Pierre Alquier · Nicolas Chopin 🔗 |
Fri 4:20 p.m. - 4:30 p.m.
|
PAC-Bayes bounds’ parameter optimization via events’ space discretization: new bounds for losses with general tail behaviors
(
Contributed Talk
)
>
link
SlidesLive Video |
Borja Rodríguez Gálvez · Ragnar Thobaben · Mikael Skoglund 🔗 |
Fri 4:30 p.m. - 5:15 p.m.
|
Invited Talk 3: Meta-Learning Reliable Priors for Interactive Learning
(
Invited Talk
)
>
SlidesLive Video |
Jonas Rothfuss 🔗 |
Fri 5:15 p.m. - 6:00 p.m.
|
Invited Talk 4: Generalization Theory for Robot Learning
(
Invited Talk
)
>
SlidesLive Video |
Anirudha Majumdar 🔗 |
Fri 6:00 p.m. - 6:30 p.m.
|
Poster Session 2
(
Poster Session
)
>
|
🔗 |
Fri 6:30 p.m. - 6:40 p.m.
|
Anytime Model Selection in Linear Bandits
(
Contributed Talk
)
>
link
SlidesLive Video |
Parnian Kassraie · Aldo Pacchiano · Nicolas Emmenegger · Andreas Krause 🔗 |
Fri 6:40 p.m. - 6:50 p.m.
|
PAC-Bayesian Error Bound, via R\'enyi Divergence, for a Class of Linear Time-Invariant State-Space Models
(
Contributed Talk
)
>
link
SlidesLive Video |
Deividas Eringis · john leth · Rafal Wisniewski · Zheng-Hua Tan · Mihaly Petreczky 🔗 |
Fri 6:50 p.m. - 7:00 p.m.
|
Experiment Planning with Function Approximation
(
Contributed Talk
)
>
link
SlidesLive Video |
Aldo Pacchiano · Jonathan Lee · Emma Brunskill 🔗 |
Fri 7:00 p.m. - 7:45 p.m.
|
Panel Discussion
(
Panel Discussion
)
>
SlidesLive Video |
🔗 |
-
|
Improved Time-Uniform PAC-Bayes Bounds using Coin Betting ( Poster ) > link | Kyoungseok Jang · Kwang-Sung Jun · Ilja Kuzborskij · Francesco Orabona 🔗 |
-
|
Flat minima can fail to transfer to downstream tasks ( Poster ) > link | Deepansha Singh · Ekansh Sharma · Daniel Roy · Gintare Karolina Dziugaite 🔗 |
-
|
Computing non-vacuous PAC-Bayes generalization bounds for Models under Adversarial Corruptions ( Poster ) > link | Waleed Mustafa · Philipp Liznerski · Dennis Wagner · Puyu Wang · Marius Kloft 🔗 |
-
|
XLDA: Linear Discriminant Analysis for Scaling Continual Learning to Extreme Classification Settings at the Edge ( Poster ) > link | Karan Shah · Vishruth Veerendranath · Anushka Hebbar · Raghavendra Bhat 🔗 |
-
|
Information-Theoretic Generalization Bounds for the Subtask Problem ( Poster ) > link | Firas Laakom · Yuheng Bu · Moncef Gabbouj 🔗 |
-
|
Experiment Planning with Function Approximation ( Poster ) > link | Aldo Pacchiano · Jonathan Lee · Emma Brunskill 🔗 |
-
|
PAC-Bayesian Error Bound, via R\'enyi Divergence, for a Class of Linear Time-Invariant State-Space Models ( Poster ) > link | Deividas Eringis · john leth · Rafal Wisniewski · Zheng-Hua Tan · Mihaly Petreczky 🔗 |
-
|
PAC-Bayesian Offline Contextual Bandits with Guarantees ( Poster ) > link | Otmane Sakhi · Pierre Alquier · Nicolas Chopin 🔗 |
-
|
Bayesian Feasibility Determination with Multiple Constraints ( Poster ) > link | Tingnan Gong · Di Liu · Yao Xie · Seong-Hee Kim 🔗 |
-
|
Anytime Model Selection in Linear Bandits ( Poster ) > link | Parnian Kassraie · Aldo Pacchiano · Nicolas Emmenegger · Andreas Krause 🔗 |
-
|
PAC-Bayesian Domain Adaptation Bounds for Multi-view learning ( Poster ) > link | Mehdi Hennequin · Khalid Benabdeslem · Haytham Elghazel 🔗 |
-
|
Tighter fast and mixed rate PAC-Bayes bounds ( Poster ) > link | Borja Rodríguez Gálvez · Ragnar Thobaben · Mikael Skoglund 🔗 |
-
|
PAC-Bayes bounds’ parameter optimization via events’ space discretization: new bounds for losses with general tail behaviors ( Poster ) > link | Borja Rodríguez Gálvez · Ragnar Thobaben · Mikael Skoglund 🔗 |
-
|
Bayesian Risk-Averse Q-Learning with Streaming Data ( Poster ) > link | Yuhao Wang · Enlu Zhou 🔗 |