Cover Image

High-dimensional Contextual Bandit Problem without Sparsity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Komiyama, Junpei, Imaizumi, Masaaki
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

High-dimensional Nonparametric Contextual Bandit Problem
by: Iwazaki, Shogo, et al.
Published: (2025)

CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency
by: Ota, Hirofumi, et al.
Published: (2026)

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
by: Komiyama, Junpei
Published: (2022)

Replicability is Asymptotically Free in Multi-armed Bandits
by: Komiyama, Junpei, et al.
Published: (2024)

Finite-Time Regret Analysis of Retry-Aware Bandits
by: Tong, Bingkui, et al.
Published: (2026)

Data-dependent Bounds with $T$-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
by: Nguyen, Quan, et al.
Published: (2025)

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

Rate-optimal Design for Anytime Best Arm Identification
by: Komiyama, Junpei, et al.
Published: (2025)

Fixed Confidence Best Arm Identification in the Bayesian Setting
by: Jang, Kyoungseok, et al.
Published: (2024)

High-Dimensional Limit of Stochastic Gradient Flow via Dynamical Mean-Field Theory
by: Nishiyama, Sota, et al.
Published: (2026)

Neuron Block Dynamics for XOR Classification with Zero-Margin
by: Braun, Guillaume, et al.
Published: (2026)

Spectrum-Adaptive Generalization Bounds for Trained Deep Transformers
by: Sakai, Mana, et al.
Published: (2026)

Best-of-$\infty$ -- Asymptotic Performance of Test-Time LLM Ensembling
by: Komiyama, Junpei, et al.
Published: (2025)

Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size
by: Takeshita, Naoki, et al.
Published: (2025)

Benign Overfitting in Time Series Linear Models with Over-Parameterization
by: Nakakita, Shogo, et al.
Published: (2022)

Extended Wasserstein-GAN Approach to Causal Distribution Learning: Density-Free Estimation and Minimax Optimality
by: Tamano, Shu, et al.
Published: (2026)

An Efficient Algorithm for Thresholding Monte Carlo Tree Search
by: Nameki, Shoma, et al.
Published: (2026)

Bayesian Analysis for Over-parameterized Linear Model via Effective Spectra
by: Wakayama, Tomoya, et al.
Published: (2023)

Finite-Sample Inference for Sparsely Permuted Linear Regression
by: Ota, Hirofumi, et al.
Published: (2026)

Precise Dynamics of Diagonal Linear Networks: A Unifying Analysis by Dynamical Mean-Field Theory
by: Nishiyama, Sota, et al.
Published: (2025)

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
by: Komiyama, Junpei, et al.
Published: (2025)

Minimax Rates of Estimation for Optimal Transport Map between Infinite-Dimensional Spaces
by: Ponnoprat, Donlapark, et al.
Published: (2025)

Automatic Domain Adaptation by Transformers in In-Context Learning
by: Hataya, Ryuichiro, et al.
Published: (2024)

Zero Generalization Error Theorem for Random Interpolators via Algebraic Geometry
by: Yoshida, Naoki, et al.
Published: (2025)

Infinite-Width Limit of a Single Attention Layer: Analysis via Tensor Programs
by: Sakai, Mana, et al.
Published: (2025)

Effect of Weight Quantization on Learning Models by Typical Case Analysis
by: Kashiwamura, Shuhei, et al.
Published: (2024)

Effect of Random Learning Rate: Theoretical Analysis of SGD Dynamics in Non-Convex Optimization via Stationary Distribution
by: Yoshida, Naoki, et al.
Published: (2024)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Precise gradient descent training dynamics for finite-width multi-layer neural networks
by: Han, Qiyang, et al.
Published: (2025)

Reliable Chain-of-Thought via Prefix Consistency
by: Iwase, Naoto, et al.
Published: (2026)

Learning a Single Index Model from Anisotropic Data with vanilla Stochastic Gradient Descent
by: Braun, Guillaume, et al.
Published: (2025)

Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsity
by: Shrestha, Susav, et al.
Published: (2025)

Spectral Gradient Descent Mitigates Anisotropy-Driven Misalignment: A Case Study in Phase Retrieval
by: Braun, Guillaume, et al.
Published: (2026)

Anti Mode-Collapse in Mean-Field Transformer via Auxiliary Variables
by: Imaizumi, Masaaki, et al.
Published: (2026)

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport
by: Ponnoprat, Donlapark, et al.
Published: (2026)

Dichotomy of Feature Learning and Unlearning: Fast-Slow Analysis on Neural Networks with Stochastic Gradient Descent
by: Imai, Shota, et al.
Published: (2026)

HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems
by: Angioli, Marco, et al.
Published: (2025)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
by: Jin, Tianyuan, et al.
Published: (2024)

Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)

Fast Escape, Slow Convergence: Learning Dynamics of Phase Retrieval under Power-Law Data
by: Braun, Guillaume, et al.
Published: (2025)