output
20062026
most citedThe Astropy Project: Building an inclusive, open-science project and status of the v2.0 core package

7.7k citations

Showing 2020 · cs.LGShow all

6 papers · 2 filters

cs.LG2020

Reducing the Variance of Variational Estimates of Mutual Information by Limiting the Critic's Hypothesis Space to RKHS

P Aditya Sreekar, Ujjwal Tiwari, Anoop Namboodiri

Mutual information (MI) is an information-theoretic measure of dependency between two random variables. Several methods to estimate MI, from samples of two random variables with un…

cs.LG2020★ 6 cited

Maximum Reward Formulation In Reinforcement Learning

Sai Krishna Gottipati, Yashaswi Pathak, Rohan Nuttall +6

Reinforcement learning (RL) algorithms typically deal with maximizing the expected cumulative return (discounted or undiscounted, finite or infinite horizon). However, several cruc…

cs.LG2020★ 23 cited

Off-policy Bandits with Deficient Support

Noveen Sachdeva, Yi Su, Thorsten Joachims

Learning effective contextual-bandit policies from past actions of a deployed system is highly desirable in many settings (e.g. voice assistants, recommendation, search), since it…

cs.LG2020★ 4 cited

Learning Multiclass Classifier Under Noisy Bandit Feedback

Mudit Agarwal, Naresh Manwani

This paper addresses the problem of multiclass classification with corrupted or noisy bandit feedback. In this setting, the learner may not receive true feedback. Instead, it recei…

cs.LG2020★ 3 cited

Robust Deep Ordinal Regression Under Label Noise

Bhanu Garg, Naresh Manwani

The real-world data is often susceptible to label noise, which might constrict the effectiveness of the existing state of the art algorithms for ordinal regression. Existing works…

cs.LG2020★ 1 cited

Ballooning Multi-Armed Bandits

Ganesh Ghalme, Swapnil Dhamal, Shweta Jain +2

In this paper, we introduce Ballooning Multi-Armed Bandits (BL-MAB), a novel extension of the classical stochastic MAB model. In the BL-MAB model, the set of available arms grows (…