Cover Image

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	McMahan, Jeremy
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

Anytime-Constrained Equilibria in Polynomial Time
by: McMahan, Jeremy
Published: (2024)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
by: Dvijotham, Krishnamurthy, et al.
Published: (2024)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Testably Learning Polynomial Threshold Functions
by: Slot, Lucas, et al.
Published: (2024)

Deterministic Coreset for Lp Subspace
by: Chhaya, Rachit, et al.
Published: (2026)

A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
by: Diakonikolas, Ilias, et al.
Published: (2024)

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
by: Zeng, Shiwei, et al.
Published: (2023)

Outlier Robust Multivariate Polynomial Regression
by: Arora, Vipul, et al.
Published: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
by: Pham, Ninh, et al.
Published: (2025)

Multi-Agent Reinforcement Learning with Submodular Reward
by: Chen, Wenjing, et al.
Published: (2026)

Sample-Optimal Private Regression in Polynomial Time
by: Anderson, Prashanti, et al.
Published: (2025)

Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025)

Precedence-Constrained Decision Trees and Coverings
by: Szyfelbein, Michał, et al.
Published: (2026)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)

Polynomial-time derivation of optimal k-tree topology from Markov networks
by: Dastjerdi, Fereshteh R., et al.
Published: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
by: Alman, Josh, et al.
Published: (2025)

Learning Linear Attention in Polynomial Time
by: Yau, Morris, et al.
Published: (2024)

Learning-Augmented Moment Estimation on Time-Decay Models
by: Nagawanshi, Soham, et al.
Published: (2026)

Experimental Design Using Interlacing Polynomials
by: Lau, Lap Chi, et al.
Published: (2024)

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
by: Nath, Ankur, et al.
Published: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)

A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions
by: Singhal, Vikrant
Published: (2023)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
by: Lee, Jane H., et al.
Published: (2024)

Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Training Overparametrized Neural Networks in Sublinear Time
by: Deng, Yichuan, et al.
Published: (2022)

Fast-MWEM: Private Data Release in Sublinear Time
by: Haris, Themistoklis, et al.
Published: (2026)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
by: Hu, Hang, et al.
Published: (2022)

Settling Time vs. Accuracy Tradeoffs for Clustering Big Data
by: Draganov, Andrew, et al.
Published: (2024)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)

LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions
by: Kannan, Ravindran, et al.
Published: (2024)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
by: Hines, Christian L., et al.
Published: (2025)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)

Log-Time K-Means Clustering for 1D Data: Novel Approaches with Proof and Implementation
by: Hyun, Jake
Published: (2024)