Image de couverture de livre

Polynomial-Time Approximability of Constrained Reinforcement Learning

Fuente: arXiv

Enregistré dans:

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

Documents similaires

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

Anytime-Constrained Reinforcement Learning
par: McMahan, Jeremy, et autres
Publié: (2023)

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

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

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

Learning Linear Attention in Polynomial Time
par: Yau, Morris, et autres
Publié: (2024)

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

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

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

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

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

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

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)

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)

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

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

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

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)

Guessing Efficiently for Constrained Subspace Approximation
par: Bhaskara, Aditya, et autres
Publié: (2025)

Limits of Approximating the Median Treatment Effect
par: Addanki, Raghavendra, et autres
Publié: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
par: Yau, Morris, et autres
Publié: (2023)

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

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
par: Thejaswi, Suhas, et autres
Publié: (2024)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
par: Schäfer, Patrick, et autres
Publié: (2022)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
par: Wienöbst, Marcel, et autres
Publié: (2025)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
par: Wienöbst, Marcel, et autres
Publié: (2022)

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

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
par: Gupta, Aaryan, et autres
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)

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

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

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

Uncovering Fairness through Data Complexity as an Early Indicator
par: Ferreira, Juliett Suárez, et autres
Publié: (2025)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
par: Chee, Jerry, et autres
Publié: (2025)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
par: Brita, Catalin E., et autres
Publié: (2025)