Image de couverture de livre

Neural Logistic Bandits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bae, Seoungbin, Lee, Dabeen
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Logistic Bandits with $\tilde{O}(\sqrt{dT})$ Regret without Context Diversity Assumptions
par: Bae, Seoungbin, et autres
Publié: (2026)

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

Learning to Route and Schedule LLMs from User Retrials via Contextual Queueing Bandits
par: Bae, Seoungbin, et autres
Publié: (2026)

Primal-Dual Policy Optimization for Linear CMDPs with Adversarial Losses
par: Yu, Kihyun, et autres
Publié: (2026)

Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards
par: Yu, Kihyun, et autres
Publié: (2026)

Chebyshev Center-Based Direction Selection for Multi-Objective Optimization and Training PINNs
par: Yoon, Hoyeol, et autres
Publié: (2026)

Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation
par: Park, Jaehyun, et autres
Publié: (2024)

Combinatorial Logistic Bandits
par: Liu, Xutong, et autres
Publié: (2024)

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

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
par: Lee, Joongkyu, et autres
Publié: (2024)

Stochastic-Constrained Stochastic Optimization with Markovian Data
par: Kim, Yeongjong, et autres
Publié: (2023)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
par: Goyal, Tanmay, et autres
Publié: (2025)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
par: Chae, Woojin, et autres
Publié: (2024)

Achieving Limited Adaptivity for Multinomial Logistic Bandits
par: Midigeshi, Sukruta Prakash, et autres
Publié: (2025)

Near Optimal Pure Exploration in Logistic Bandits
par: Rivera, Eduardo Ochoa, et autres
Publié: (2024)

Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret
par: Yu, Kihyun, et autres
Publié: (2026)

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

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion
par: Lee, Junghyun, et autres
Publié: (2023)

Improved Regret Bound for Safe Reinforcement Learning via Tighter Cost Pessimism and Reward Optimism
par: Yu, Kihyun, et autres
Publié: (2024)

Learning What to Recommend: Minimax Optimal Simple Regret in Logistic Bandits
par: Liu, Shuai, et autres
Publié: (2026)

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
par: Hong, Kihyuk, et autres
Publié: (2024)

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
par: Zhu, Jiahui, et autres
Publié: (2025)

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span
par: Chae, Woojin, et autres
Publié: (2024)

Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
par: Park, Sungwoo, et autres
Publié: (2024)

Classification with Deep Neural Networks and Logistic Loss
par: Zhang, Zihan, et autres
Publié: (2023)

Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm
par: Boudart, Pierre, et autres
Publié: (2025)

Neural Exploitation and Exploration of Contextual Bandits
par: Ban, Yikun, et autres
Publié: (2023)

Uncertainty of Joint Neural Contextual Bandit
par: Guo, Hongbo, et autres
Publié: (2024)

Riemannian Multinomial Logistics Regression for SPD Neural Networks
par: Chen, Ziheng, et autres
Publié: (2023)

Compact Memory for Continual Logistic Regression
par: Jung, Yohan, et autres
Publié: (2025)

Meta Clustering of Neural Bandits
par: Ban, Yikun, et autres
Publié: (2024)

Neural Risk-sensitive Satisficing in Contextual Bandits
par: Ito, Shogo, et autres
Publié: (2025)

On Transportability for Structural Causal Bandits
par: Park, Min Woo, et autres
Publié: (2025)

Infrequent Exploration in Linear Bandits
par: Lee, Harin, et autres
Publié: (2025)

Consequences of Kernel Regularity for Bandit Optimization
par: Lee, Madison, et autres
Publié: (2025)

Contextual Bandit Optimization with Pre-Trained Neural Networks
par: Terekhov, Mikhail
Publié: (2025)

Neural Contextual Bandits Under Delayed Feedback Constraints
par: Moghimi, Mohammadali, et autres
Publié: (2025)

Parameter-Free Hypergraph Neural Network for Few-Shot Node Classification
par: Bae, Chaewoon, et autres
Publié: (2025)

Neural Active Learning Beyond Bandits
par: Ban, Yikun, et autres
Publié: (2024)

Lipschitz Bandits with Stochastic Delayed Feedback
par: Liu, Zhongxuan, et autres
Publié: (2025)