Skip to content
conftrace_

online decision making

30 papers

Papers

Linear Contextual Bandits With Interference ICML 2025 Pairwise Elimination with Instance-Dependent Guarantees for Bandits with Cost Subsidy ICLR 2025 Bandits with Concave Aggregated Reward IJCAI 2024 Barely Random Algorithms and Collective Metrical Task Systems NeurIPS 2024 Online decision making with history-average dependent costs L4DC 2024 Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility AAAI 2024 Sequential Decision Making with Expert Demonstrations under Unobserved Heterogeneity NeurIPS 2024 Multi-armed Bandit Experimental Design: Online Decision-making and Adaptive Inference AISTATS 2023 Thompson Sampling with Diffusion Generative Prior ICML 2023 Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency COLT 2023 Private Streaming SCO in ℓ_p geometry with Applications in High Dimensional Online Decision Making ICML 2022 Robust Tests in Online Decision-Making AAAI 2022 Conditioning Sparse Variational Gaussian Processes for Online Decision-making NeurIPS 2021 Continuous Mean-Covariance Bandits NeurIPS 2021 Generalized Linear Bandits with Local Differential Privacy NeurIPS 2021 Online Multi-Armed Bandits with Adaptive Inference NeurIPS 2021 Optimal Algorithms for Stochastic Contextual Preference Bandits NeurIPS 2021 Parallelizing Thompson Sampling NeurIPS 2021 ROI Maximization in Stochastic Online Decision-Making NeurIPS 2021 Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NeurIPS 2020 A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 2020 Fiduciary Bandits ICML 2020 Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NeurIPS 2020 Acting and Planning Using Operational Models AAAI 2019 Bootstrapping Upper Confidence Bound NeurIPS 2019