Skip to content

Similar papers

Preprint Sep 2026

Pure Tail Constraints for Online Problems

Controlling tail risk is an important objective in online optimization, and recently it has been studied in the context of competitive analysis. Continuing this line of research, we investigate pure tail constraints, which capture the tradeoff between expected and worst-case competitiveness. For two fundamental search...

Mateusz Basiak, Marcin Bienkowski, Yong-Ho Shin et al. · 0 citations
Open access Aug 2026

Optimizing the UCB Strategy for Batch Data Processing

For the Gaussian two-armed bandit, which occurs during the analysis of batch data processing, the case of variable batch size is considered. This optimal control problem has a classical interpretation as a game with nature. The player’s payment function is the mathematical expectation of the regrets of full income caus...

M. Ershov, A. Voroshilov · 0 citations
Conference

Online Resource Allocation with Predictions

Online decision-makers often obtain predictions on future variables, such as arrivals, demands, inventories, and so on. These predictions can be generated from simple forecasting algorithms for univariate time-series, all the way to state-of-the-art machine learning models that leverage multiple time-series and additio...

Lin An, Andrew A. Li, Benjamin Moseley et al. · 0 citations
#machine learning Conference Open access Sep 2026

Learning to Price and Stock Under Contextual and Censored Demand

This work proposes an efficient algorithm to achieve regret bound O(K sqrt(T) log T) under concave revenue conditions and O(K^(2/3) T^(2/3) (log T)^(1/2) for the general case, with matching lower bounds confirming optimality.

Ze-An Han, Ze-Zhen Ding, Ji-Heng Zhang · 1 citation
#machine learning Preprint Sep 2026

Variable Selection for Feature-Based Newsvendor

This paper forms the resulting $\ell_0$-constrained empirical newsvendor problem with $\ell_2$-regularization, establishes its computational hardness, and develops a mixed-integer second-order cone programming reformulation that strengthens the standard Big-$M$ formulation.

Zhao Yuan, Jie Wang · 0 citations
Open access 2023

Dynamic Programming For Data Independent Decision Sets

The contribution is a proof that there exist measurable versions of intermediate value functions, which reveals regularity in addition, and a verification theorems allow stating traditional problem specifications in the novel setting with mathematical rigor.

Paul Dommel, Alois Pichler · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.