Image de couverture de livre

Anytime-Constrained Reinforcement Learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	McMahan, Jeremy, Zhu, Xiaojin
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Polynomial-Time Approximability of Constrained Reinforcement Learning
par: McMahan, Jeremy
Publié: (2025)

Anytime-Constrained Equilibria in Polynomial Time
par: McMahan, Jeremy
Publié: (2024)

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
par: McMahan, Jeremy
Publié: (2024)

Roping in Uncertainty: Robustness and Regularization in Markov Games
par: McMahan, Jeremy, et autres
Publié: (2024)

Learning-Augmented Priority Queues
par: Benomar, Ziyad, et autres
Publié: (2024)

On Tradeoffs in Learning-Augmented Algorithms
par: Benomar, Ziyad, et autres
Publié: (2025)

Learning-Augmented Online Bipartite Fractional Matching
par: Choo, Davin, et autres
Publié: (2025)

Learning-Based Algorithms for Graph Searching Problems
par: DePavia, Adela Frances, et autres
Publié: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
par: de Wynter, Adrian
Publié: (2020)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
par: Li, Dongyue, et autres
Publié: (2025)

Online Learning with Probing for Sequential User-Centric Selection
par: Xu, Tianyi, et autres
Publié: (2025)

Learning-augmented smooth integer programs with PAC-learnable oracles
par: He, Hao-Yuan, et autres
Publié: (2026)

Provably Learning from Modern Language Models via Low Logit Rank
par: Golowich, Noah, et autres
Publié: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
par: Bini, Lorenzo, et autres
Publié: (2025)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
par: Dvijotham, Krishnamurthy, et autres
Publié: (2024)

Rethinking Model-based, Policy-based, and Value-based Reinforcement Learning via the Lens of Representation Complexity
par: Feng, Guhao, et autres
Publié: (2023)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
par: Pedramfar, Mohammad, et autres
Publié: (2023)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
par: Sharma, Vidya Sagar
Publié: (2023)

The sample complexity of multi-distribution learning
par: Peng, Binghui
Publié: (2023)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
par: Yao, Jasper
Publié: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
par: Guan, Xinyu, et autres
Publié: (2025)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
par: Huisman, Tim, et autres
Publié: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
par: Sun, Yiwen, et autres
Publié: (2024)

Mini-Batch Kernel $k$-means
par: Jourdan, Ben, et autres
Publié: (2024)

Model Stealing for Any Low-Rank Language Model
par: Liu, Allen, et autres
Publié: (2024)

Block-Diagonal Guided DBSCAN Clustering
par: Zhao, Weibing
Publié: (2024)

Contract Scheduling with Distributional and Multiple Advice
par: Angelopoulos, Spyros, et autres
Publié: (2024)

SubGen: Token Generation in Sublinear Time and Memory
par: Zandieh, Amir, et autres
Publié: (2024)

Approximate Lifted Model Construction
par: Luttermann, Malte, et autres
Publié: (2025)

Online bipartite matching with imperfect advice
par: Choo, Davin, et autres
Publié: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

Introduction to Multi-Armed Bandits
par: Slivkins, Aleksandrs
Publié: (2019)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

Demand Selection for VRP with Emission Quota
par: Najar, Farid, et autres
Publié: (2025)

Constructing Decision Trees from Data Streams
par: Pham, Huy, et autres
Publié: (2024)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)

Provably Extracting the Features from a General Superposition
par: Liu, Allen
Publié: (2025)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
par: Luttermann, Malte, et autres
Publié: (2026)