conftrace_

oracle-efficient algorithm

13 papers

Explore in graph

Co-occurring keywords · papers mentioning both

online learning (5) regret bound (4) contextual bandit (3) online estimation (1) offline estimation (1) smoothed analysis (1) no-regret algorithm (1) factored markov decision process (1) interactive decision making (1) policy class (1)

Papers

Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms ICML 2024 Group-wise oracle-efficient algorithms for online multi-group learning NeurIPS 2024 Monotone Individual Fairness ICML 2024 Online Estimation via Offline Estimation: An Information-Theoretic Framework NeurIPS 2024 Oracle-Efficient Pessimism: Offline Policy Optimization In Contextual Bandits AISTATS 2024 Active fairness auditing ICML 2022 Adaptive Oracle-Efficient Online Learning NeurIPS 2022 Oracle-Efficient Online Learning for Smoothed Adversaries NeurIPS 2022 Smoothed Online Learning is as Easy as Statistical Learning COLT 2022 Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits UAI 2020 New Oracle-Efficient Algorithms for Private Synthetic Data Release ICML 2020 Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting NeurIPS 2020 On Oracle-Efficient PAC RL with Rich Observations NeurIPS 2018