{"total":20,"rows":[{"id":"2107.02237","title":"Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination","created":"2021-07-05","cited_by_count":53,"area":null},{"id":"2202.02765","title":"Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States","created":"2022-02-06","cited_by_count":15,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"area":null},{"id":"2103.11354","title":"Online Strongly Convex Optimization with Unknown Delays","created":"2021-03-21","cited_by_count":11,"area":null},{"id":"2305.13946","title":"Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness","created":"2023-05-23","cited_by_count":11,"area":null},{"id":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","cited_by_count":10,"area":null},{"id":"2202.07574","title":"Damped Online Newton Step for Portfolio Selection","created":"2022-02-15","cited_by_count":9,"area":null},{"id":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2110.14804","title":"Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers","created":"2021-10-27","cited_by_count":8,"area":null},{"id":"2210.00997","title":"Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States","created":"2022-10-03","cited_by_count":7,"area":null},{"id":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","cited_by_count":7,"area":null},{"id":"2310.01609","title":"Adversarial Contextual Bandits Go Kernelized","created":"2023-10-02","cited_by_count":6,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2502.07774","title":"Optimistic Interior Point Methods for Sequential Hypothesis Testing by Betting","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2504.07307","title":"Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems","created":"2025-04-09","cited_by_count":2,"area":null},{"id":"2311.02557","title":"Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging","created":"2023-11-05","cited_by_count":1,"area":null},{"id":"2511.22283","title":"The Hidden Cost of Approximation in Online Mirror Descent","created":"2025-11-27","cited_by_count":1,"area":null},{"id":"2411.06192","title":"Variational Bayes Portfolio Construction","created":"2024-11-09","cited_by_count":0,"area":null},{"id":"2506.19294","title":"Duality and Policy Evaluation in Distributionally Robust Bayesian Diffusion Control","created":"2025-06-24","cited_by_count":0,"area":null}],"next_cursor":null}