Copertina

Online Uniform Sampling: Randomized Learning-Augmented Approximation Algorithms with Application to Digital Health

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Xueqing, Gan, Kyra, Keyvanshokooh, Esmaeil, Murphy, Susan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Machine Learning-Augmented Optimization of Large Bilevel and Two-stage Stochastic Programs: Application to Cycling Network Design
di: Chan, Timothy C. Y., et al.
Pubblicazione: (2022)

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