:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhou, Jie, Hao, Botao, Wen, Zheng, Zhang, Jingfei, Sun, Will Wei
Format:	Preprint
Published:	2020
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2007.15788
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Jointly Modeling and Clustering Tensors in High Dimensions
by: Cai, Biao, et al.
Published: (2021)

Online Tensor Inference
by: Wen, Xin, et al.
Published: (2023)

Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
by: Rahbar, Arman, et al.
Published: (2023)

Online Statistical Inference in Decision-Making with Matrix Context
by: Han, Qiyu, et al.
Published: (2022)

Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems
by: Chen, Botao, et al.
Published: (2025)

Efficient Online Learning with Offline Datasets for Infinite Horizon MDPs: A Bayesian Approach
by: Tang, Dengwang, et al.
Published: (2023)

A Multi-resolution Low-rank Tensor Decomposition
by: Rozada, Sergio, et al.
Published: (2024)

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
by: Zhang, Weitong, et al.
Published: (2021)

Combinatorial Bandit Bayesian Optimization for Tensor Outputs
by: Huang, Jingru, et al.
Published: (2026)

Offline Local Search for Online Stochastic Bandits
by: Benadè, Gerdus, et al.
Published: (2026)

Low-rank Matrix Bandits with Heavy-tailed Rewards
by: Kang, Yue, et al.
Published: (2024)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
by: Liu, Shuai, et al.
Published: (2026)

Efficient Generalized Low-Rank Tensor Contextual Bandits
by: Yi, Qianxin, et al.
Published: (2023)

Fourier Low-rank and Sparse Tensor for Efficient Tensor Completion
by: Li, Jingyang, et al.
Published: (2025)

Optimizing Sharpe Ratio: Risk-Adjusted Decision-Making in Multi-Armed Bandits
by: Khurshid, Sabrina, et al.
Published: (2024)

Stochastic Online Conformal Prediction with Semi-Bandit Feedback
by: Ge, Haosen, et al.
Published: (2024)

Online Bandit Learning with Offline Preference Data for Improved RLHF
by: Agnihotri, Akhil, et al.
Published: (2024)

Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates
by: Duan, Congyuan, et al.
Published: (2024)

Online Statistical Inference for Contextual Bandits via Stochastic Gradient Descent
by: Chang, Xiangyu, et al.
Published: (2022)

Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits
by: Gu, Yuzhou, et al.
Published: (2025)

Adapter-Augmented Bandits for Online Multi-Constrained Multi-Modal Inference Scheduling
by: Zhang, Xianzhi, et al.
Published: (2026)

Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?
by: Guan, Changkun, et al.
Published: (2026)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
by: Della Vecchia, Riccardo, et al.
Published: (2023)

Robust Low-rank Tensor Train Recovery
by: Qin, Zhen, et al.
Published: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

Causal Customer Churn Analysis with Low-rank Tensor Block Hazard Model
by: Gao, Chenyin, et al.
Published: (2024)

Weighted Low-rank Approximation via Stochastic Gradient Descent on Manifolds
by: Xu, Conglong, et al.
Published: (2025)

Budget-Constrained Causal Bandits: Bridging Uplift Modeling and Sequential Decision-Making
by: Pillai, Abhirami
Published: (2026)

Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
by: Ghaffari, Fatemeh, et al.
Published: (2024)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)

Buzz, Choose, Forget: A Meta-Bandit Framework for Bee-Like Decision Making
by: Claeys, Emmanuelle, et al.
Published: (2025)

A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for $m$-Set Semi-Bandit Problem
by: Chen, Botao, et al.
Published: (2026)

Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion
by: Su, Bowen, et al.
Published: (2024)

Tensor Low-rank Approximation of Finite-horizon Value Functions
by: Rozada, Sergio, et al.
Published: (2024)

Wait-Less Offline Tuning and Re-solving for Online Decision Making
by: Sun, Jingruo, et al.
Published: (2024)

Hybrid Combinatorial Multi-armed Bandits with Probabilistically Triggered Arms
by: Zhou, Kongchang, et al.
Published: (2025)

A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
by: Zhan, Jingxin, et al.
Published: (2025)

Fairness of Exposure in Online Restless Multi-armed Bandits
by: Sood, Archit, et al.
Published: (2024)