Search Results for author:
Found 4 papers, 1 papers with code
Refined bounds for randomized experimental design
Experimental design is an approach for selecting samples among a given set so as to obtain the best estimator for a given criterion.
Parallel Contextual Bandits in Wireless Handover Optimization
As cellular networks become denser, a scalable and dynamic tuning of wireless base station parameters can only be achieved through automated optimization.
KONG: Kernels for ordered-neighborhood graphs
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i. e. when neighbor nodes follow an order.
Reinforcement Learning with Wasserstein Distance Regularisation, with Applications to Multipolicy Learning
We describe an application of Wasserstein distance to Reinforcement Learning.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
