:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xu, Kan, Bastani, Hamsa
Format:	Preprint
Published:	2021
Subjects:	Machine Learning Statistics Theory
Online Access:	https://arxiv.org/abs/2112.14233
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Bandits with ReLU Neural Networks
by: Xu, Kan, et al.
Published: (2024)

Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity
by: Huang, Xinmeng, et al.
Published: (2023)

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

Group-Sparse Matrix Factorization for Transfer Learning of Word Embeddings
by: Xu, Kan, et al.
Published: (2021)

Concave Statistical Utility Maximization Bandits via Influence-Function Gradients
by: Carrasco, Matías, et al.
Published: (2026)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality
by: Chen, Hanxiao, et al.
Published: (2026)

Strategic Hiring under Algorithmic Monoculture
by: Baek, Jackie, et al.
Published: (2025)

A Statistical Theory of Contrastive Learning via Approximate Sufficient Statistics
by: Lin, Licong, et al.
Published: (2025)

Transfer Learning for Contextual Multi-armed Bandits
by: Cai, Changxiao, et al.
Published: (2022)

Beating the Winner's Curse via Inference-Aware Policy Optimization
by: Bastani, Hamsa, et al.
Published: (2025)

Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learning
by: Prevost, Adrien, et al.
Published: (2025)

Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards
by: Ji, Wenlong, et al.
Published: (2025)

Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
by: Xu, Yunbei, et al.
Published: (2020)

Rethinking Algorithmic Fairness for Human-AI Collaboration
by: Ge, Haosen, et al.
Published: (2023)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
by: Praharaj, Samya, et al.
Published: (2025)

The Fragility of Optimized Bandit Algorithms
by: Fan, Lin, et al.
Published: (2021)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

Improving Human Sequential Decision-Making with Reinforcement Learning
by: Bastani, Hamsa, et al.
Published: (2021)

Adaptive Smooth Non-Stationary Bandits
by: Suk, Joe
Published: (2024)

Statistical-Computational Trade-offs in Learning Multi-Index Models via Harmonic Analysis
by: Latourelle-Vigeant, Hugo, et al.
Published: (2026)

Testing the Feasibility of Linear Programs with Bandit Feedback
by: Gangrade, Aditya, et al.
Published: (2024)

Truncated LinUCB for Stochastic Linear Bandits
by: Song, Yanglei, et al.
Published: (2022)

Statistical Learning Theory for Distributional Classification
by: Fiedler, Christian
Published: (2026)

Complexity Dependent Error Rates for Physics-informed Statistical Learning via the Small-ball Method
by: Marcondes, Diego
Published: (2025)

Statistical inference for pairwise comparison models
by: Han, Ruijian, et al.
Published: (2024)

Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Navigating Sparsities in High-Dimensional Linear Contextual Bandits
by: Zhao, Rui, et al.
Published: (2025)

Design Experiments to Compare Multi-armed Bandit Algorithms
by: Meng, Huiling, et al.
Published: (2026)

Convergence of Statistical Estimators via Mutual Information Bounds
by: Khribch, El Mahdi, et al.
Published: (2024)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Statistical Inference and Learning for Shapley Additive Explanations (SHAP)
by: Whitehouse, Justin, et al.
Published: (2026)

Statistical analysis of Inverse Entropy-regularized Reinforcement Learning
by: Belomestny, Denis, et al.
Published: (2025)

Statistical Learning Guarantees for Group-Invariant Barron Functions
by: Yang, Yahong, et al.
Published: (2025)

Winner's Curse Drives False Promises in Data-Driven Decisions: A Case Study in Refugee Matching
by: Bastani, Hamsa, et al.
Published: (2026)

Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits
by: Zhou, Julien, et al.
Published: (2024)

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
by: Graf, Maximilian, et al.
Published: (2026)