Copertina

Near-Optimal Learning and Planning in Separated Latent MDPs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Fan, Daskalakis, Constantinos, Golowich, Noah, Rakhlin, Alexander
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Artificial Intelligence Computational Complexity Statistics Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Learning High-dimensional Gaussians from Censored Data
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2025)

Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'?
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2024)

From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces
di: Dagan, Yuval, et al.
Pubblicazione: (2023)

High-accuracy sampling for diffusion models and log-concave distributions
di: Chen, Fan, et al.
Pubblicazione: (2026)

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy
di: Chen, Fan, et al.
Pubblicazione: (2025)

High-accuracy log-concave sampling with stochastic queries
di: Chen, Fan, et al.
Pubblicazione: (2026)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
di: Chen, Fan, et al.
Pubblicazione: (2025)

Reject, Resample, Repeat: Understanding Parallel Reasoning in Language Model Inference
di: Golowich, Noah, et al.
Pubblicazione: (2026)

Causal Discovery under Latent Class Confounding
di: Mazaheri, Bijan, et al.
Pubblicazione: (2023)

The Coverage Principle: How Pre-Training Enables Post-Training
di: Chen, Fan, et al.
Pubblicazione: (2025)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
di: Wein, Alexander S.
Pubblicazione: (2025)

Beyond Covariance Matrix: The Statistical Complexity of Private Linear Regression
di: Chen, Fan, et al.
Pubblicazione: (2025)

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
di: Boudart, Pierre, et al.
Pubblicazione: (2026)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
di: Golowich, Noah, et al.
Pubblicazione: (2024)

Improved Hardness Results for Learning Intersections of Halfspaces
di: Tiegel, Stefan
Pubblicazione: (2024)

On the Hardness of Learning One Hidden Layer Neural Networks
di: Li, Shuchen, et al.
Pubblicazione: (2024)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
di: Buhai, Rares-Darius, et al.
Pubblicazione: (2024)

Smooth Nash Equilibria: Algorithms and Complexity
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2023)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
di: Chen, Siyu, et al.
Pubblicazione: (2025)

Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps
di: Kelner, Jonathan, et al.
Pubblicazione: (2024)

The monotonicity of the Franz-Parisi potential is equivalent with Low-degree MMSE lower bounds
di: Tsirkas, Konstantinos, et al.
Pubblicazione: (2026)

Low degree conjecture implies sharp computational thresholds in stochastic block model
di: Ding, Jingqiu, et al.
Pubblicazione: (2025)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
di: Ji, Kaixuan, et al.
Pubblicazione: (2026)

The Hidden Game Problem
di: Buzaglo, Gon, et al.
Pubblicazione: (2025)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
di: Lou, Mengqi, et al.
Pubblicazione: (2025)

Algorithmic causal structure emerging through compression
di: Wendong, Liang, et al.
Pubblicazione: (2025)

The Agent Capability Problem: Predicting Solvability Through Information-Theoretic Bounds
di: Lutati, Shahar
Pubblicazione: (2025)

Derandomizing Multi-Distribution Learning
di: Larsen, Kasper Green, et al.
Pubblicazione: (2024)

Efficient Pauli channel estimation with logarithmic quantum memory
di: Chen, Sitan, et al.
Pubblicazione: (2023)

Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon
di: Yu, Hao
Pubblicazione: (2025)

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
di: Chen, Bo, et al.
Pubblicazione: (2025)

Cryptographic Hardness of Score Estimation
di: Song, Min Jae
Pubblicazione: (2024)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
di: Chen, Fan, et al.
Pubblicazione: (2026)

Tensor cumulants for statistical inference on invariant distributions
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Unified Algorithms for RL with Decision-Estimation Coefficients: PAC, Reward-Free, Preference-Based Learning, and Beyond
di: Chen, Fan, et al.
Pubblicazione: (2022)

Exponential quantum advantage in processing massive classical data
di: Zhao, Haimeng, et al.
Pubblicazione: (2026)

Learning to Think from Multiple Thinkers
di: Joshi, Nirmit, et al.
Pubblicazione: (2026)

A Theory of Learning with Autoregressive Chain of Thought
di: Joshi, Nirmit, et al.
Pubblicazione: (2025)

Conformal Prediction for Privacy-Preserving Machine Learning
di: Balinsky, Alexander David, et al.
Pubblicazione: (2025)

Foundations of Structural Causal Models with Latent Selection
di: Chen, Leihao, et al.
Pubblicazione: (2024)