Cover Image

Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Duan, Congyuan, Ma, Wanteng, Jiang, Jiashuo, Xia, Dong
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Statistical Inference for Matching Decisions via Matrix Completion under Dependent Missingness
by: Duan, Congyuan, et al.
Published: (2025)

High-dimensional Linear Bandits with Knapsacks
by: Ma, Wanteng, et al.
Published: (2023)

Statistical Inference in Tensor Completion: Optimal Uncertainty Quantification and Statistical-to-Computational Gaps
by: Ma, Wanteng, et al.
Published: (2024)

Online Policy Learning and Inference by Matrix Completion
by: Duan, Congyuan, et al.
Published: (2024)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
by: Jiang, Jiashuo, et al.
Published: (2022)

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

Online Tensor Learning: Computational and Statistical Trade-offs, Adaptivity and Optimal Regret
by: Li, Jingyang, et al.
Published: (2023)

Regret Bounds for Robust Online Decision Making
by: Appel, Alexander, et al.
Published: (2025)

SPARKLE: A Nonparametric Approach for Online Decision-Making with High-Dimensional Covariates
by: Wang, Wenjia, et al.
Published: (2025)

Multiple Testing of Linear Forms for Noisy Matrix Completion
by: Ma, Wanteng, et al.
Published: (2023)

Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
by: Jiang, Jiashuo
Published: (2023)

Online Mixture of Experts: No-Regret Learning for Optimal Collective Decision-Making
by: Liu, Larkin, et al.
Published: (2025)

Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation
by: Zong, Yiming, et al.
Published: (2026)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
by: Jiang, Jiashuo, et al.
Published: (2024)

Covariance-Aware Transformers for Quadratic Programming and Decision Making
by: Tire, Kutay, et al.
Published: (2026)

Pre-Trained AI Model Assisted Online Decision-Making under Missing Covariates: A Theoretical Perspective
by: Hu, Haichen, et al.
Published: (2025)

Stochastic Low-rank Tensor Bandits for Multi-dimensional Online Decision Making
by: Zhou, Jie, et al.
Published: (2020)

Statistical Inference in Classification of High-dimensional Gaussian Mixture
by: Huang, Hanwen, et al.
Published: (2024)

Online Conformal Prediction with Adversarial Semi-bandit Feedback via Regret Minimization
by: Yang, Junyoung, et al.
Published: (2026)

Statistical Inference for Linear Functionals of Online SGD in High-dimensional Linear Regression
by: Agrawalla, Bhavya, et al.
Published: (2023)

Online Scheduling for LLM Inference with KV Cache Constraints
by: Jaillet, Patrick, et al.
Published: (2025)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
by: Feng, Qing, et al.
Published: (2024)

On The Statistical Complexity of Offline Decision-Making
by: Nguyen-Tang, Thanh, et al.
Published: (2025)

Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)

Hierarchical Deep Counterfactual Regret Minimization
by: Chen, Jiayu, et al.
Published: (2023)

Invariance-Based Dynamic Regret Minimization
by: Lazzaretto, Margherita, et al.
Published: (2026)

Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions
by: Hu, Piao, et al.
Published: (2024)

Statistical Inference for Online Algorithms
by: Carter, Selina, et al.
Published: (2025)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

Design-Based Bandits Under Network Interference: Trade-Off Between Regret and Statistical Inference
by: Wang, Zichen, et al.
Published: (2025)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
by: Zhang, Lijun, et al.
Published: (2025)

Regretful Decisions under Label Noise
by: Nagaraj, Sujay, et al.
Published: (2025)

Regret Minimization via Saddle Point Optimization
by: Kirschner, Johannes, et al.
Published: (2024)

Efficient Swap Regret Minimization in Combinatorial Bandits
by: Kontogiannis, Andreas, et al.
Published: (2026)

Constrained Online Decision-Making: A Unified Framework
by: Hu, Haichen, et al.
Published: (2025)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)