Co-occurring keywords · papers mentioning both
Papers
Blackwell Approachability and Gradient Equilibrium are Equivalent
COLT 2026
Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract)
AAAI 2026
Fairness-Aware Design for Contextual Experiments: Guaranteeing Reliability and Equity in Heterogeneous Subgroups
AAAI 2026
Invited Open Problem: Online Optimization of Piecewise-Lipschitz Functions with Applications to Data-Driven Algorithm Design
COLT 2026
Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms
ALT 2026
Swap Regret Minimization Through Response-Based Approachability
COLT 2026
BSO: Binary Spiking Online Optimization Algorithm
ICML 2025
Cross-Granularity Online Optimization with Masked Compensated Information for Learned Image Compression
ICCV 2025
Learning to Generate Gradients for Test-Time Adaptation via Test-Time Training Layers
AAAI 2025
Online Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
AAAI 2025
Online Laplacian-Based Representation Learning in Reinforcement Learning
ICML 2025
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
AAAI 2025
Adaptive Regret for Bandits Made Possible: Two Queries Suffice
ICLR 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case
NeurIPS 2024
Contextual Pandora’s Box
AAAI 2024
Dueling Optimization with a Monotone Adversary
ALT 2024
Fairness and Optimization in Dynamic Multiagent Allocation Problems
IJCAI 2024
Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints
NeurIPS 2024
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
AISTATS 2024
Online Composite Optimization Between Stochastic and Adversarial Environments
NeurIPS 2024
Percentile Risk-Constrained Budget Pacing for Guaranteed Display Advertising in Online Optimization
AAAI 2024
Risk-Sensitive Online Algorithms (Extended Abstract)
COLT 2024
Sum-max Submodular Bandits
AISTATS 2024
Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
ICLR 2024
A Bayesian approach for bandit online optimization with switching cost
UAI 2023