← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

DFDT: Dynamic Fast Decision Tree for IoT Data Stream Mining on Edge Devices AAAI 2026
Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025
Multiple Trade-offs: An Improved Approach for Lexicographic Linear Bandits AAAI 2025
Smoothed Online Convex Optimization with Delayed Feedback IJCAI 2025
Voting or Consensus? Decision-Making in Multi-Agent Debate ACL 2025
Distribution-Aware Online Learning for Urban Spatiotemporal Forecasting on Streaming Data IJCAI 2025
Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs AAAI 2025
Adaptive Market Making with Inventory Constraints via Online Learning AAAI 2025
Online Quantile Regression JMLR 2025
Problem-dependent Regret for Lexicographic Multi-Armed Bandits with Adversarial Corruptions IJCAI 2025
Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint AAAI 2025
Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025
Lexicographic Lipschitz Bandits: New Algorithms and a Lower Bound JMLR 2025
Lossless Acceleration of Large Language Models with Hierarchical Drafting based on Temporal Locality in Speculative Decoding NAACL 2025
Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback AAAI 2025
Efficient Methods for Non-stationary Online Learning JMLR 2025
Contextual Bandits with Stage-wise Constraints JMLR 2025
Temporal-aware Query Routing for Real-time Video Instance Segmentation ICCV 2025
CompileAgent: Automated Real-World Repo-Level Compilation with Tool-Integrated LLM-based Agent System ACL 2025
Multi-player Multi-armed Bandits with Delayed Feedback IJCAI 2025
Fast Second-Order Online Kernel Learning Through Incremental Matrix Sketching and Decomposition IJCAI 2025
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem AAAI 2024
Learning to Price Homogeneous Data NIPS 2024
Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility AAAI 2024