Copertina

Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Jiang, Jiashuo
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions
di: Hu, Piao, et al.
Pubblicazione: (2024)

Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation
di: Zong, Yiming, et al.
Pubblicazione: (2026)

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
di: Hu, Bingshan, et al.
Pubblicazione: (2021)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

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

Optimal Bounds for Adversarial Constrained Online Convex Optimization
di: Ferreira, Ricardo N., et al.
Pubblicazione: (2025)

Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
di: Chen, Lesi, et al.
Pubblicazione: (2022)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
di: Iwazaki, Shogo
Pubblicazione: (2026)

Near-Optimal Sample Complexity for Online Constrained MDPs
di: Liu, Chang, et al.
Pubblicazione: (2026)

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
di: Lu, Yiyang, et al.
Pubblicazione: (2025)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
di: Zuo, Shiliang
Pubblicazione: (2020)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
di: Jiang, Jiashuo, et al.
Pubblicazione: (2024)

Distributionally-Constrained Adversaries in Online Learning
di: Blanchard, Moïse, et al.
Pubblicazione: (2025)

Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
di: Di, Qiwei, et al.
Pubblicazione: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
di: Chen, Sijia, et al.
Pubblicazione: (2023)

humancompatible.train: Implementing Optimization Algorithms for Stochastically-Constrained Stochastic Optimization Problems
di: Kliachkin, Andrii, et al.
Pubblicazione: (2025)

Single-Loop Deterministic and Stochastic Interior-Point Algorithms for Nonlinearly Constrained Optimization
di: Curtis, Frank E., et al.
Pubblicazione: (2024)

Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards
di: Yu, Kihyun, et al.
Pubblicazione: (2026)

A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
di: Gong, Xiaochuan, et al.
Pubblicazione: (2024)

The Value of Information in Resource-Constrained Pricing
di: Ao, Ruicheng, et al.
Pubblicazione: (2026)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
di: Sarkar, Dhruv, et al.
Pubblicazione: (2025)

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
di: Wang, Bokun, et al.
Pubblicazione: (2023)

Prescriptive PCA: Dimensionality Reduction for Two-stage Stochastic Optimization
di: He, Long, et al.
Pubblicazione: (2023)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
di: Sachs, Sarah, et al.
Pubblicazione: (2023)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
di: Wan, Yuanyu, et al.
Pubblicazione: (2024)

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

Non-Stationary Online Resource Allocation: Learning from a Single Sample
di: Feng, Yiding, et al.
Pubblicazione: (2026)

Near-Optimal Solutions of Constrained Learning Problems
di: Elenter, Juan, et al.
Pubblicazione: (2024)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
di: Ghosh, Debamita, et al.
Pubblicazione: (2025)

Near-Optimal Regret in Adversarial Kernel Bandits
di: Zhang, Yu-Jie, et al.
Pubblicazione: (2026)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
di: Maiti, Arnab, et al.
Pubblicazione: (2025)

Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling
di: Du, Xinchen, et al.
Pubblicazione: (2025)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge
di: Guo, Longkun, et al.
Pubblicazione: (2024)

Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates
di: Duan, Congyuan, et al.
Pubblicazione: (2024)

Action Robust Reinforcement Learning via Optimal Adversary Aware Policy Optimization
di: Nie, Buqing, et al.
Pubblicazione: (2025)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
di: Soma, Tasuku, et al.
Pubblicazione: (2022)

Near-Optimal Second-Order Guarantees for Model-Based Adversarial Imitation Learning
di: Li, Shangzhe, et al.
Pubblicazione: (2025)

Near-Optimality of Contrastive Divergence Algorithms
di: Glaser, Pierre, et al.
Pubblicazione: (2025)

Adversarial Robustness in Two-Stage Learning-to-Defer: Algorithms and Guarantees
di: Montreuil, Yannis, et al.
Pubblicazione: (2025)