Imagen de Portada

Multi-Objective $\textit{min-max}$ Online Convex Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Vaze, Rahul, Mishra, Sumiran
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2023)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2024)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2025)

Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
por: Vaze, Rahul, et al.
Publicado: (2024)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
por: Vaze, Rahul, et al.
Publicado: (2025)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
por: Shah, Harsh, et al.
Publicado: (2025)

Breaking the $O(\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\sqrt{T})$ Static Regret in Constrained Online Convex Optimization
por: Balasundaram, Haricharan, et al.
Publicado: (2026)

Convex Optimization with Nested Evolving Feasible Sets
por: M., Karthick Krishna, et al.
Publicado: (2026)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
por: Vaze, Rahul, et al.
Publicado: (2025)

Simple Optimizers for Convex Aligned Multi-Objective Optimization
por: Kretzu, Ben, et al.
Publicado: (2025)

$f$-FUM: Federated Unlearning via min--max and $f$-divergence
por: Karimian, Radmehr, et al.
Publicado: (2026)

MOSS: Multi-Objective Optimization for Stable Rule Sets
por: Liu, Brian, et al.
Publicado: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
por: Sahinoglu, Emre, et al.
Publicado: (2025)

Mirror Descent-Ascent for mean-field min-max problems
por: Lascu, Razvan-Andrei, et al.
Publicado: (2024)

Multi-Objective Preference Optimization: Improving Human Alignment of Generative Models
por: Agnihotri, Akhil, et al.
Publicado: (2025)

Safe Online Convex Optimization with Multi-Point Feedback
por: Hutchinson, Spencer, et al.
Publicado: (2024)

Alternating Regret for Online Convex Optimization
por: Hait, Soumita, et al.
Publicado: (2025)

Distributed Online Private Learning of Convex Nondecomposable Objectives
por: Cheng, Huqiang, et al.
Publicado: (2022)

Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold
por: Zhang, Sixin
Publicado: (2024)

A 4-approximation algorithm for min max correlation clustering
por: Heidrich, Holger, et al.
Publicado: (2023)

Constrained Online Convex Optimization with Memory and Predictions
por: Abdullah, Mohammed, et al.
Publicado: (2026)

Unconstrained Robust Online Convex Optimization
por: Zhang, Jiujia, et al.
Publicado: (2025)

Online Convex Optimization with Unbounded Memory
por: Kumar, Raunak, et al.
Publicado: (2022)

A Fisher-Rao gradient flow for entropic mean-field min-max games
por: Lascu, Razvan-Andrei, et al.
Publicado: (2024)

Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem
por: Rodríguez-Corominas, Guillem, et al.
Publicado: (2026)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
por: Qiu, Hao, et al.
Publicado: (2025)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
por: Wan, Yuanyu, et al.
Publicado: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
por: Chen, Sijia, et al.
Publicado: (2023)

Data-driven forced response analysis with min-max representations of nonlinear restoring forces
por: Saito, Akira, et al.
Publicado: (2026)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
por: Bao, Lingchan, et al.
Publicado: (2025)

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
por: Yan, Wenjing, et al.
Publicado: (2024)

Online Convex Optimization with Memory and Limited Predictions
por: Wang, Zhengmiao, et al.
Publicado: (2024)

Online Convex Optimization with a Separation Oracle
por: Mhammedi, Zakaria
Publicado: (2024)

Global Resolution: Optimal Multi-Draft Speculative Sampling via Convex Minimization
por: Thomas, Rahul Krishna, et al.
Publicado: (2025)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

Online Submodular Maximization via Online Convex Optimization
por: Salem, Tareq Si, et al.
Publicado: (2023)

Multi-Modal Conformal Prediction Regions with Simple Structures by Optimizing Convex Shape Templates
por: Tumu, Renukanandan, et al.
Publicado: (2023)

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
por: Lei, Qi, et al.
Publicado: (2020)

Multi-Objective Causal Bayesian Optimization
por: Bhatija, Shriya, et al.
Publicado: (2025)