Tensor attention training: Provably efficient learning of higher-order transformers
Tensor Attention, a multi-view attention that is able to capture high-order correlations among
multiple modalities, can overcome the representational limitations of classical matrix …
multiple modalities, can overcome the representational limitations of classical matrix …
Collaborative filtering bandits
Classical collaborative filtering, and content-based filtering methods try to learn a static
recommendation model given training data. These approaches are far from ideal in highly …
recommendation model given training data. These approaches are far from ideal in highly …
Transfer learning
SJ Pan - Learning, 2020 - api.taylorfrancis.com
Supervised machine learning techniques have already been widely studied and applied to
various real-world applications. However, most existing supervised algorithms work well …
various real-world applications. However, most existing supervised algorithms work well …
Online clustering of bandits
We introduce a novel algorithmic approach to content recommendation based on adaptive
clustering of exploration-exploitation (“bandit") strategies. We provide a sharp regret …
clustering of exploration-exploitation (“bandit") strategies. We provide a sharp regret …
Meta-thompson sampling
Efficient exploration in bandits is a fundamental online learning problem. We propose a
variant of Thompson sampling that learns to explore better as it interacts with bandit …
variant of Thompson sampling that learns to explore better as it interacts with bandit …
Bayesian decision-making under misspecified priors with applications to meta-learning
Thompson sampling and other Bayesian sequential decision-making algorithms are among
the most popular approaches to tackle explore/exploit trade-offs in (contextual) bandits. The …
the most popular approaches to tackle explore/exploit trade-offs in (contextual) bandits. The …
On context-dependent clustering of bandits
We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation
tasks that implements the underlying feedback sharing mechanism by estimating user …
tasks that implements the underlying feedback sharing mechanism by estimating user …
Hierarchical bayesian bandits
Abstract Meta-, multi-task, and federated learning can be all viewed as solving similar tasks,
drawn from a distribution that reflects task similarities. We provide a unified view of all these …
drawn from a distribution that reflects task similarities. We provide a unified view of all these …
Multi-armed bandits for intelligent tutoring systems
We present an approach to Intelligent Tutoring Systems which adaptively personalizes
sequences of learning activities to maximize skills acquired by students, taking into account …
sequences of learning activities to maximize skills acquired by students, taking into account …
Provable benefits of representational transfer in reinforcement learning
We study the problem of representational transfer in RL, where an agent first pretrains in a
number of\emph {source tasks} to discover a shared representation, which is subsequently …
number of\emph {source tasks} to discover a shared representation, which is subsequently …