Co-occurring keywords · papers mentioning both
Papers
Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap
AAAI 2025
Not in My Backyard! Temporal Voting Over Public Chores
IJCAI 2025
Online and Streaming Algorithms for Constrained k-Submodular Maximization
AAAI 2025
Online Conformal Prediction via Online Optimization
ICML 2025
Online Differentially Private Conformal Prediction for Uncertainty Quantification
ICML 2025
ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS
ICLR 2025
Online Generalized Magician’s Problem with Multiple Workers
UAI 2025
Online Housing Market
IJCAI 2025
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
IJCAI 2025
Online Sparsification of Bipartite-Like Clusters in Graphs
ICML 2025
Regret-Free Reinforcement Learning for Temporal Logic Specifications
ICML 2025
Semi-Clairvoyant Scheduling of Speculative Decoding Requests to Minimize LLM Inference Latency
IJCAI 2025
Unconstrained Robust Online Convex Optimization
ICML 2025
VITS : Variational Inference Thompson Sampling for contextual bandits
ICML 2024
A General Online Algorithm for Optimizing Complex Performance Metrics
ICML 2024
Algorithms for Caching and MTS with reduced number of predictions
ICLR 2024
An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints
NeurIPS 2024
A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
NeurIPS 2024
An Online Bootstrap for Time Series
AISTATS 2024
Approximating the Top Eigenvector in Random Order Streams
NeurIPS 2024
Bandits with Ranking Feedback
NeurIPS 2024
Barely Random Algorithms and Collective Metrical Task Systems
NeurIPS 2024
Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization
IJCAI 2024
Concentration of empirical barycenters in metric spaces
ALT 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case
NeurIPS 2024