conftrace
_
Papers
Trends
Conferences
Explore
More
Authors
Topics
Keywords
Insights
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Insights
Achievements
Home
›
Keywords
›
online optimization
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
Discrete-Smoothness in Online Algorithms with Predictions
NIPS 2023
DEFT: Dexterous Fine-Tuning for Hand Policies
CORL 2023
Regularized online DR-submodular optimization
UAI 2023
A Bayesian approach for bandit online optimization with switching cost
UAI 2023
Constant regret for sequence prediction with limited advice
ALT 2023
Riemannian Projection-free Online Learning
NIPS 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions
NIPS 2023
Optimal cross-learning for contextual bandits with unknown context distributions
NIPS 2023
Online Optimization over Riemannian Manifolds
JMLR 2023
A gradient estimator via L1-randomization for online zero-order optimization with two point feedback
NIPS 2022
A Unifying Framework for Online Optimization with Long-Term Constraints
NIPS 2022
Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion
NIPS 2022
Simple and Optimal Greedy Online Contention Resolution Schemes
NIPS 2022
Adaptive Manipulation of Conductive, Nonmagnetic Objects via a Continuous Model of Magnetically Induced Force and Torque
RSS 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
ICML 2022
Gradient and Projection Free Distributed Online Min-Max Resource Optimization
L4DC 2022
OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression
L4DC 2022
Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit
IJCAI 2022
Online Facility Location with Multiple Advice
NIPS 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems
AAAI 2021
Stochastic Online Optimization using Kalman Recursion
JMLR 2021
Global Convergence of Online Optimization for Nonlinear Model Predictive Control
NIPS 2021
Online 3D Bin Packing with Constrained Deep Reinforcement Learning
AAAI 2021
Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions
ICML 2021
Safe Reinforcement Learning Using Robust Action Governor
L4DC 2021
<
1
2
3
4
5
>