Skip to content
conftrace_

Online Algorithms

2,404 papers

1
16
59
229
182
'5
'10
'15
'20
'25

Papers

Linear Contextual Bandits With Interference ICML 2025 Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification AAAI 2025 List Update with Prediction AAAI 2025 Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit ALT 2025 Logarithmic regret of exploration in average reward Markov decision processes COLT 2025 Market Making without Regret COLT 2025 MATWA: A Web Toolkit for Matching Under Preferences AAAI 2025 MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters ICML 2025 Minimalistic Predictions for Online Class Constraint Scheduling ICLR 2025 Mixture of Online and Offline Experts for Non-Stationary Time Series AAAI 2025 More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules IJCAI 2025 Multi-Armed Bandits with Interference: Bridging Causal Inference and Adversarial Bandits ICML 2025 Multi-play Multi-armed Bandits with Shareable Arm Capacities Revisited: Settling Scarce Capacity ACML 2025 Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem ALT 2025 Nearly Tight Bounds for Exploration in Streaming Multi-Armed Bandits with Known Optimality Gap AAAI 2025 Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems ICML 2025 Near Optimal Non-asymptotic Sample Complexity of 1-Identification ICML 2025 Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback ICML 2025 Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely (Extended Abstract) COLT 2025 Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability ICML 2025 Non-stochastic Bandits With Evolving Observations ALT 2025 Non-stochastic Budgeted Online Pricing with Semi-Bandit Feedback AAAI 2025 No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization ICML 2025 Okapi: Decoupling Data Striping and Redundancy Grouping in Cluster File Systems OSDI 2025 One-Pass Feature Evolvable Learning with Theoretical Guarantees ICML 2025