:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Suder, Piotr M., Laber, Eric
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	https://arxiv.org/abs/2503.05098
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exploiting Concavity Information in Gaussian Process Contextual Bandit Optimization
par: Li, Kevin, et autres
Publié: (2025)

Implicit Q-Learning and SARSA: Liberating Policy Control from Step-Size Calibration
par: Kim, Hwanwoo, et autres
Publié: (2026)

Scalable Policy Maximization Under Network Interference
par: Gleich, Aidan, et autres
Publié: (2025)

Adaptive Policy Learning Under Unknown Network Interference
par: Gleich, Aidan, et autres
Publié: (2026)

Stabilizing Temporal Difference Learning via Implicit Stochastic Recursion
par: Kim, Hwanwoo, et autres
Publié: (2025)

Implicit Updates for Average-Reward Temporal Difference Learning
par: Kim, Hwanwoo, et autres
Publié: (2025)

Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
par: Jin, Tianyuan, et autres
Publié: (2024)

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
par: Qin, Hao, et autres
Publié: (2023)

Bandits with Mean Bounds
par: Sharma, Nihal, et autres
Publié: (2020)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
par: Eldowa, Khaled, et autres
Publié: (2024)

Optimal Excess Risk Bounds for Empirical Risk Minimization on $p$-Norm Linear Regression
par: Hanchi, Ayoub El, et autres
Publié: (2023)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
par: Huang, Zhiming, et autres
Publié: (2026)

Empirical Bayesian Multi-Bandit Learning
par: Jiang, Xia, et autres
Publié: (2025)

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
par: Laber, Eduardo S., et autres
Publié: (2024)

New bounds on the cohesion of complete-link and other linkage methods for agglomeration clustering
par: Dasgupta, Sanjoy, et autres
Publié: (2024)

An Information-Theoretic Analysis of Thompson Sampling for Logistic Bandits
par: Gouverneur, Amaury, et autres
Publié: (2024)

Norm-Bounded Low-Rank Adaptation
par: Wang, Ruigang, et autres
Publié: (2025)

Norm$\times$Direction: Restoring the Missing Query Norm in Vision Linear Attention
par: Meng, Weikang, et autres
Publié: (2025)

Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
par: Balagopalan, Kapilan, et autres
Publié: (2024)

Refined PAC-Bayes Bounds for Offline Bandits
par: Gouverneur, Amaury, et autres
Publié: (2025)

Improved Regret Bounds for Bandits with Expert Advice
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2024)

Directional Optimism for Safe Linear Bandits
par: Hutchinson, Spencer, et autres
Publié: (2023)

Optimistic Information Directed Sampling
par: Neu, Gergely, et autres
Publié: (2024)

Sample-Efficient Agnostic Boosting
par: Ghai, Udaya, et autres
Publié: (2024)

Improved Bounds for Reward-Agnostic and Reward-Free Exploration
par: Ridel, Oran, et autres
Publié: (2026)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes
par: Sharma, Nihal, et autres
Publié: (2021)

Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood
par: Ouyang, Jiangrong, et autres
Publié: (2026)

Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
par: Jose, Sharu Theresa, et autres
Publié: (2024)

Improved Online Confidence Bounds for Multinomial Logistic Bandits
par: Lee, Joongkyu, et autres
Publié: (2025)

Queue Length Regret Bounds for Contextual Queueing Bandits
par: Bae, Seoungbin, et autres
Publié: (2026)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
par: Fiandri, Marco, et autres
Publié: (2024)

Improved Bound for Robust Causal Bandits with Linear Models
par: Yan, Zirui, et autres
Publié: (2024)

Depth Separation in Norm-Bounded Infinite-Width Neural Networks
par: Parkinson, Suzanna, et autres
Publié: (2024)

Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers
par: Grishina, Ekaterina, et autres
Publié: (2024)

Sample-Optimal Agnostic Boosting with Unlabeled Data
par: Ghai, Udaya, et autres
Publié: (2025)

Lower Bounds for Time-Varying Kernelized Bandits
par: Cai, Xu, et autres
Publié: (2024)

Sparse Optimistic Information Directed Sampling
par: Schwartz, Ludovic, et autres
Publié: (2025)

Offline Contextual Bandit with Counterfactual Sample Identification
par: Gilotte, Alexandre, et autres
Publié: (2025)

Thompson Sampling in Partially Observable Contextual Bandits
par: Park, Hongju, et autres
Publié: (2024)