Differentially private and budget-limited bandit learning over matroids
From MaRDI portal
(Redirected from Publication:3386800)
Recommendations
Cites work
- Combinatorial Optimization with Rational Objective Functions
- Encyclopedia of Optimization
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 5717961 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Introduction to algorithms.
- Maximizing a monotone submodular function subject to a matroid constraint
- Measure, probability, and mathematical finance. A problem-oriented approach
- Online learning methods for networking
- Probability and Computing
- Probability and random processes.
- Probability Inequalities for Sums of Bounded Random Variables
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Stochastic Online Shortest Path Routing: The Value of Feedback
- The algorithmic foundations of differential privacy
Cited in
(5)
This page was built for publication: Differentially private and budget-limited bandit learning over matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386800)