Cover Image

Localized exploration in contextual dynamic pricing achieves dimension-free regret

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chai, Jinhang, Duan, Yaqi, Fan, Jianqing, Wang, Kaizheng
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Similarity Measure Between Functions with Applications to Statistical Learning and Optimization
by: Huang, Chengpiao, et al.
Published: (2025)

MINTS: Minimalist Thompson Sampling
by: Wang, Kaizheng
Published: (2026)

A Minimalist Bayesian Framework for Stochastic Optimization
by: Wang, Kaizheng
Published: (2025)

On the optimization dynamics of RLVR: Gradient gap and step size thresholds
by: Suk, Joe, et al.
Published: (2025)

Logarithmic regret bounds for continuous-time average-reward Markov decision processes
by: Gao, Xuefeng, et al.
Published: (2022)

Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis
by: Jakob, Fabian, et al.
Published: (2025)

Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces
by: Duan, Yaqi, et al.
Published: (2024)

Optimal Semiparametric Dynamic Pricing with Feature Diversity
by: Chai, Jinhang, et al.
Published: (2026)

Primal-dual algorithm for contextual stochastic combinatorial optimization
by: Bouvier, Louis, et al.
Published: (2025)

Minimizing UCB: a Better Local Search Strategy in Local Bayesian Optimization
by: Fan, Zheyi, et al.
Published: (2024)

A Stability Principle for Learning under Non-Stationarity
by: Huang, Chengpiao, et al.
Published: (2023)

Orlicz regrets to consistently bound statistics of random variables with an application to environmental indicators
by: Yoshioka, Hidekazu, et al.
Published: (2023)

Structured Matrix Learning under Arbitrary Entrywise Dependence and Estimation of Markov Transition Kernel
by: Chai, Jinhang, et al.
Published: (2024)

Safe exploration in reproducing kernel Hilbert spaces
by: Tokmak, Abdullah, et al.
Published: (2025)

A safe exploration approach to constrained Markov decision processes
by: Ni, Tingting, et al.
Published: (2023)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

Variable Clustering via Distributionally Robust Nodewise Regression
by: Wang, Kaizheng, et al.
Published: (2022)

What price to pay? Auto-tuning a building MPC controller for optimal economic cost
by: Yu, Jiarui, et al.
Published: (2025)

A Weighted Gradient Tracking Privacy-Preserving Method for Distributed Optimization
by: Xie, Furan, et al.
Published: (2025)

Parameter-free Algorithms for the Stochastically Extended Adversarial Model
by: Wang, Shuche, et al.
Published: (2025)

Analysis of On-policy Policy Gradient Methods under the Distribution Mismatch
by: Wang, Weizhen, et al.
Published: (2025)

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
by: Kerimov, Süleyman, et al.
Published: (2025)

One-Layer Transformer Provably Learns One-Nearest Neighbor In Context
by: Li, Zihao, et al.
Published: (2024)

Parameter-free Mirror Descent
by: Jacobsen, Andrew, et al.
Published: (2022)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
by: Xu, Zi, et al.
Published: (2021)

Generalized EXTRA stochastic gradient Langevin dynamics
by: Gurbuzbalaban, Mert, et al.
Published: (2024)

Derivative-free tree optimization for complex systems
by: Wei, Ye, et al.
Published: (2024)

Asynchronous Distributed Optimization with Delay-free Parameters
by: Wu, Xuyang, et al.
Published: (2023)

Local linear convergence of gradient methods for overparameterized Gaussian mixtures
by: Wang, Jingxing, et al.
Published: (2026)

Meta-Learning Linear Quadratic Regulators: A Policy Gradient MAML Approach for Model-free LQR
by: Toso, Leonardo F., et al.
Published: (2024)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle
by: Richtárik, Peter, et al.
Published: (2026)

Locally Adaptive Federated Learning
by: Mukherjee, Sohom, et al.
Published: (2023)

Optimal Local Convergence Rates of Stochastic First-Order Methods under Local $α$-PL
by: Masiha, Saeed, et al.
Published: (2024)

Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction
by: Horenko, Illia, et al.
Published: (2023)

Deep Transfer $Q$-Learning for Offline Non-Stationary Reinforcement Learning
by: Chai, Jinhang, et al.
Published: (2025)

Coherent Local Explanations for Mathematical Optimization
by: Otto, Daan, et al.
Published: (2025)

Convergence of Distributed Adaptive Optimization with Local Updates
by: Cheng, Ziheng, et al.
Published: (2024)