conftrace_

online optimization

108 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) convex optimization (1321) multi-armed bandit (1098) submodular optimization (261) gradient descent (1144) bandit feedback (118) competitive ratio (74) resource allocation (251)

Papers

Fairness-Aware Design for Contextual Experiments: Guaranteeing Reliability and Equity in Heterogeneous Subgroups AAAI 2026
Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract) AAAI 2026
Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms ALT 2026
Learning to Generate Gradients for Test-Time Adaptation via Test-Time Training Layers AAAI 2025
Cross-Granularity Online Optimization with Masked Compensated Information for Learned Image Compression ICCV 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting AAAI 2025
Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding AAAI 2025
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods AISTATS 2024
Dueling Optimization with a Monotone Adversary ALT 2024
Percentile Risk-Constrained Budget Pacing for Guaranteed Display Advertising in Online Optimization AAAI 2024
Online Composite Optimization Between Stochastic and Adversarial Environments NIPS 2024
Sum-max Submodular Bandits AISTATS 2024
Fairness and Optimization in Dynamic Multiagent Allocation Problems IJCAI 2024
Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints NIPS 2024
Risk-Sensitive Online Algorithms (Extended Abstract) COLT 2024
Contextual Pandora’s Box AAAI 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case NIPS 2024
Optimal cross-learning for contextual bandits with unknown context distributions NIPS 2023
Online Optimization over Riemannian Manifolds JMLR 2023
Online Adaptive Policy Selection in Time-Varying Systems: No-Regret via Contractive Perturbations NIPS 2023
Regularized online DR-submodular optimization UAI 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions NIPS 2023
Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis ICML 2023
No-regret Algorithms for Fair Resource Allocation NIPS 2023
Variance-Reduced Gradient Estimation via Noise-Reuse in Online Evolution Strategies NIPS 2023