Learning Theory

ReCode: Robustness Evaluation of Code Generation Models ACL 2023 Recognizable Information Bottleneck IJCAI 2023 Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023 Regret Analysis of Online LQR Control via Trajectory Prediction and Tracking L4DC 2023 Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents ICML 2023 Regret Guarantees for Online Deep Control L4DC 2023 Regret Minimization and Convergence to Equilibria in General-sum Markov Games ICML 2023 Regret Minimization via Saddle Point Optimization NeurIPS 2023 Regret-Minimizing Double Oracle for Extensive-Form Games ICML 2023 Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time NeurIPS 2023 Regularizing Second-Order Influences for Continual Learning CVPR 2023 Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space ICML 2023 Reliable learning in challenging environments NeurIPS 2023 Replicability in Reinforcement Learning NeurIPS 2023 Replicable Bandits ICLR 2023 Replicable Reinforcement Learning NeurIPS 2023 Representational Strengths and Limitations of Transformers NeurIPS 2023 Represent to Control Partially Observed Systems: Representation Learning with Provable Sample Efficiency ICLR 2023 Reproducibility of Training Deep Learning Models for Medical Image Analysis MIDL 2023 Rethinking Document-Level Relation Extraction: A Reality Check ACL 2023 Revisiting Fair-PAC Learning and the Axioms of Cardinal Welfare AISTATS 2023 Revisiting minimum description length complexity in overparameterized models JMLR 2023 Revisiting Sample Size Determination in Natural Language Understanding ACL 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Revisiting the Optimality of Word Lengths EMNLP 2023