Papers
316 papers found
Online Learning of Combinatorial Objects via Extended Formulation
Holakou Rahmanian, David P. Helmbold, S. V. N. Vishwanathan
On Similarity Prediction and Pairwise Clustering
Stephen Pasteris, Fabio Vitale, Claudio Gentile et al.
On the Help of Bounded Shot Verifiers, Comparators and Standardisers
for Learnability in Inductive Inference
Ziyuan Gao, Sanjay Jain, Frank Stephan et al.
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence
Maryam Aziz, Jesse Anderton, Emilie Kaufmann et al.
Ranking Median Regression: Learning to Order through Local Consensus
Stephan Clémençon, Anna Korba, Eric Sibony
Robust Inference for Multiclass Classification
Uriel Feige, Yishay Mansour, Robert E. Schapire
Sequential prediction with coded side information under logarithmic loss
Yanina Shkel, Maxim Raginsky, Sergio Verdú
Smooth Sensitivity Based Approach for Differentially Private PCA
Alon Gonem, Ram Gilad-Bachrach
Sparsity, variance and curvature in multi-armed bandits
Sébastien Bubeck, Michael Cohen, Yuanzhi Li
Structure Learning of ${H}$-colorings
Antonio Blanca, Zongchen Chen, Daniel Štefankovič et al.
The K-Nearest Neighbour UCB Algorithm for Multi-Armed Bandits with Covariates
Henry Reeve, Joe Mellor, Gavin Brown
Unperturbed: spectral analysis beyond Davis-Kahan
Justin Eldridge, Mikhail Belkin, Yusu Wang
Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs
Mohammad Sadegh Talebi, Odalric-Ambrym Maillard
Adaptive Submodularity with Varying Query Sets: An Application to Active Multi-label Learning
Alan Fern, Robby Goetschalckx, Mandana Hamidi-Haines et al.
A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds
Pooria Joulani, András György, Csaba Szepesvári
An efficient query learning algorithm for zero-suppressed binary decision diagrams
Hayato Mizumoto, Shota Todoroki, Diptarama et al.
A Strongly Quasiconvex PAC-Bayesian Bound
Niklas Thiemann, Christian Igel, Olivier Wintenberger et al.
Boundary Crossing for General Exponential Families
Odalric-Ambrym Maillard
Collaborative Clustering: Sample Complexity and Efficient Algorithms
Jungseul Ok, Se-Young Yun, Alexandre Proutiere et al.
Efficient tracking of a growing number of experts
Jaouad Mourtada, Odalric-Ambrym Maillard
Erasing Pattern Languages Distinguishable by a Finite Number of Strings
Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles
Graph Verification with a Betweenness Oracle
Mano Vikash Janardhanan
Hypotheses testing on infinite random graphs
Daniil Ryabko
Learning from Networked Examples
Yuyi Wang, Zheng-Chu Guo, Jan Ramon