conftrace_

online gradient descent

39 papers

Explore in graph

Also known as

OGD

Co-occurring keywords

regret bound (1926) online learning (1777) convex optimization (1321) dynamic regret (94) online convex optimization (165) regret minimization (315) kernel methods (1097) gradient descent (1144) random fourier feature (59) pairwise learning (31)

Papers

Federated Linear Dueling Bandits AAAI 2026
Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024
Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging AAAI 2024
No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023
Variance Reduced Online Gradient Descent for Kernelized Pairwise Learning with Limited Memory ACML 2023
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization ICML 2023
Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games NIPS 2023
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function ICML 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NIPS 2022
Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent ICML 2022
On the equivalence of Oja’s algorithm and GROUSE AISTATS 2022
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021
Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning NIPS 2021
Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems L4DC 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021
A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021
Online Convex Optimization in the Random Order Model ICML 2020
Hypothesis Sketching for Online Kernel Selection in Continuous Kernel Space IJCAI 2020
Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games ICML 2020
Revisiting Online Quantum State Learning AAAI 2020
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NIPS 2020
Improper Learning for Non-Stochastic Control COLT 2020
Adaptive Scale-Invariant Online Algorithms for Learning Linear Models ICML 2019
On the Computational Power of Online Gradient Descent COLT 2019