Online Policy Learning and Inference by Matrix Completion
From MaRDI portal
Cites work
- A linear response bandit problem
- Bandit algorithms
- Confidence intervals for policy evaluation in adaptive experiments
- Counterfactual reasoning and learning systems: the example of computational advertising
- Fast learning rates for plug-in classifiers
- Inference and uncertainty quantification for noisy matrix completion
- Inference for low-rank models
- Matrix Completion From a Few Entries
- Matrix completion and low-rank SVD via fast alternating least squares
- Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Online decision making with high-dimensional covariates
- Optimal Dynamic Treatment Regimes
- Performance guarantees for individualized treatment rules
- Reinforcement learning. An introduction
- Spectral regularization algorithms for learning large incomplete matrices
- Statistical Inferences of Linear Forms for Noisy Matrix Completion
- Statistical inference for online decision making: in a contextual bandit setting
- Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
- Stochastic Low-Rank Tensor Bandits for Multi-Dimensional Online Decision Making
- The big data newsvendor: practical insights from machine learning
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
This page was built for publication: Online Policy Learning and Inference by Matrix Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231182)
