Low-Rank Single-Index Bandits with Unknown Links: From Matrices to Tensors
cs.LG, stat.ML
Submitted: 2026-09-26
Updated: 2026-09-26
Terminology
Sources
- On High-dimensional and Low-rank Tensor Bandits
- Efficient Generalized Low-Rank Tensor Contextual Bandits
- Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions
- Optimal Regret for Single Index Bandits
- Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems
- Stochastic Low-rank Tensor Bandits for Multi-dimensional Online Decision Making
- A Unified Regularization Approach to High-Dimensional Generalized Tensor Bandits
- Nonparametric Bandits with Single-Index Rewards: Optimality and Adaptivity
- Batched Single-Index Global Multi-Armed Bandits with Covariates
- Kernel Single-Index Bandits: Estimation, Inference, and Learning
- The generalized Lasso with non-linear observations
- On Stein's Identity and Near-Optimal Estimation in High-dimensional Index Models
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks