online gradient descent

Dynamic Regret in Outlier-Oblivious Online Optimization using Nonconvex Robust Losses UAI 2026 Federated Linear Dueling Bandits AAAI 2026 Adaptive Data Collection for Robust Learning Across Multiple Distributions ICML 2025 Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play COLT 2025 CausalLM is not optimal for in-context learning ICLR 2024 Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024 Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging AAAI 2024 Online Policy Optimization in Unknown Nonlinear Systems COLT 2024 No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023 Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback COLT 2023 Online Performative Gradient Descent for Learning Nash Equilibria in Decision-Dependent Games NeurIPS 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 Variance Reduced Online Gradient Descent for Kernelized Pairwise Learning with Limited Memory ACML 2023 Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent ICML 2022 On the equivalence of Oja’s algorithm and GROUSE AISTATS 2022 Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor NeurIPS 2022 Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function ICML 2022 A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021 Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems L4DC 2021 Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021 On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021 Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021 Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning NeurIPS 2021 Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NeurIPS 2020 Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games ICML 2020