Online Algorithms

Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 Online Clustering of Dueling Bandits ICML 2025 Online Clustering with Nearly Optimal Consistency ICLR 2025 Online Conformal Prediction via Online Optimization ICML 2025 Online Convex Optimization with a Separation Oracle COLT 2025 Online Episodic Convex Reinforcement Learning ICML 2025 ONLINE EPSILON NET & PIERCING SET FOR GEOMETRIC CONCEPTS ICLR 2025 Online Generalized Magician’s Problem with Multiple Workers UAI 2025 Online Learning in the Random-Order Model ICML 2025 Online Learning of Coalition Structures by Selfish Agents AAAI 2025 Online Learning of Quantum States with Logarithmic Loss via VB-FTRL ALT 2025 Online Learning with Stochastically Partitioning Experts UAI 2025 Online Linear Classification with Massart Noise ICML 2025 Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025 Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting AAAI 2025 Online Quantile Regression JMLR 2025 Online Sparsification of Bipartite-Like Clusters in Graphs ICML 2025 On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback ICML 2025 On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs AAAI 2025 On the Power of Learning-Augmented Search Trees ICML 2025 On the Power of Optimism in Constrained Online Convex Optimization IJCAI 2025 Optimal Algorithm for Max-Min Fair Bandit ICML 2025 Optimal and Efficient Algorithms for Decentralized Online Convex Optimization JMLR 2025 Optimal and Practical Batched Linear Bandit Algorithm ICML 2025 Optimal Bounds for Dissatisfaction in Perpetual Voting AAAI 2025