Skip to content
conftrace_

regret bound

2,284 papers

RB

Papers

Doubly Robust Fusion of Many Treatments for Policy Learning ICML 2025 Dynamic Assortment Selection and Pricing with Censored Preference Feedback ICLR 2025 Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback UAI 2025 Efficient Exploitation of Hierarchical Structure in Sparse Reward Reinforcement Learning AISTATS 2025 Efficient Graph Bandit Learning with Side-Observations and Switching Constraints AAAI 2025 Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries COLT 2025 Efficient Reinforcement Learning in Probabilistic Reward Machines AAAI 2025 Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants AISTATS 2025 Experimental Design for Semiparametric Bandits COLT 2025 Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play COLT 2025 Fast Second-Order Online Kernel Learning Through Incremental Matrix Sketching and Decomposition IJCAI 2025 Feature-Based Online Bilateral Trade ICLR 2025 Finding Interior Optimum of Black-box Constrained Objective with Bayesian Optimization UAI 2025 FLIPHAT: Joint Differential Privacy for High Dimensional Linear Bandits AISTATS 2025 From Debate to Equilibrium: Belief-Driven Multi-Agent LLM Reasoning via Bayesian Nash Equilibrium ICML 2025 Gap-Dependent Bounds for Federated Q-Learning ICML 2025 Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition ICLR 2025 Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems ICML 2025 Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits ICLR 2025 Global Optimization of Gaussian Process Acquisition Functions Using a Piecewise-Linear Kernel Approximation AISTATS 2025 Graph Neural Network Generalization With Gaussian Mixture Model Based Augmentation ICML 2025 Heterogeneous Multi-Agent Bandits with Parsimonious Hints AAAI 2025 High Dimensional Bayesian Optimization using Lasso Variable Selection AISTATS 2025 HR-Bandit: Human-AI Collaborated Linear Recourse Bandit AISTATS 2025 Imprecise Multi-Armed Bandits: Representing Irreducible Uncertainty as a Zero-Sum Game JMLR 2025