:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Liu, Xueqing, Gan, Kyra, Keyvanshokooh, Esmaeil, Murphy, Susan
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	https://arxiv.org/abs/2402.01995
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Contextual Bandits with Budgeted Information Reveal
by: Gan, Kyra, et al.
Published: (2023)

Deconfounded Warm-Start Thompson Sampling with Applications to Precision Medicine
by: Jaiswal, Prateek, et al.
Published: (2025)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
by: Wu, Yuman, et al.
Published: (2026)

Approximation with Random Shallow ReLU Networks with Applications to Model Reference Adaptive Control
by: Lamperski, Andrew, et al.
Published: (2024)

Learning-Augmented Decentralized Online Convex Optimization in Networks
by: Li, Pengfei, et al.
Published: (2023)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
by: Grigorescu, Elena, et al.
Published: (2024)

Blackwell's Approachability with Approximation Algorithms
by: Garber, Dan, et al.
Published: (2025)

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)

Random Features Approximation for Control-Affine Systems
by: Kazemian, Kimia, et al.
Published: (2024)

Online Covariance Estimation in Nonsmooth Stochastic Approximation
by: Jiang, Liwei, et al.
Published: (2025)

Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data
by: Li, Wenye, et al.
Published: (2025)

The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective
by: Muehlebach, Michael, et al.
Published: (2025)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2024)

Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms
by: Scroccaro, Pedro Zattoni, et al.
Published: (2023)

Function Gradient Approximation with Random Shallow ReLU Networks with Control Applications
by: Lamperski, Andrew, et al.
Published: (2024)

Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency
by: Cai, Qi, et al.
Published: (2022)

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
by: Zhao, Heyang, et al.
Published: (2023)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

Scalable Approximate Algorithms for Optimal Transport Linear Models
by: Kacprzak, Tomasz, et al.
Published: (2025)

AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
by: Chen, Xi, et al.
Published: (2025)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Fully First-Order Algorithms for Online Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Enhancing Digital Health Services: A Machine Learning Approach to Personalized Exercise Goal Setting
by: Fang, Ji, et al.
Published: (2022)

Learning-Augmented Algorithms for the Bahncard Problem
by: Zhao, Hailiang, et al.
Published: (2024)

Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints
by: Sid-Ali, Ahmed, et al.
Published: (2023)

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
by: Niu, Chengmei, et al.
Published: (2025)

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems
by: Lyu, Jiameng, et al.
Published: (2024)

Practical Bayesian Algorithm Execution via Posterior Sampling
by: Cheng, Chu Xin, et al.
Published: (2024)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation
by: Song, Zhao, et al.
Published: (2023)

Gradient Equilibrium in Online Learning: Theory and Applications
by: Angelopoulos, Anastasios N., et al.
Published: (2025)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
by: Boveiri, Mohammad, et al.
Published: (2024)

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
by: Yan, Wenjing, et al.
Published: (2024)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
by: Wang, Yi-Han, et al.
Published: (2025)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
by: Tran-Dinh, Quoc, et al.
Published: (2023)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)