Cover Image

Online Dynamic Submodular Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lesage-Landry, Antoine, Pallage, Julien
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Wasserstein Distributionally Robust Shallow Convex Neural Networks
by: Pallage, Julien, et al.
Published: (2024)

Sliced-Wasserstein Distance-based Data Selection
by: Pallage, Julien, et al.
Published: (2025)

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

Online Interior-point Methods for Time-varying Equality-constrained Optimization
by: Lupien, Jean-Luc, et al.
Published: (2023)

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
by: Lu, Yiyang, et al.
Published: (2025)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
by: Lu, Yiyang, et al.
Published: (2026)

Ex Post Conditions for the Exactness of Optimal Power Flow Conic Relaxations
by: Lupien, Jean-Luc, et al.
Published: (2023)

Inexact Column Generation for Bayesian Network Structure Learning via Difference-of-Submodular Optimization
by: Yang, Yiran, et al.
Published: (2025)

Effective Policy Learning for Multi-Agent Online Coordination Beyond Submodular Objectives
by: Zhang, Qixin, et al.
Published: (2025)

Online Sketched Newton-Raphson
by: Lupien, Jean-Luc, et al.
Published: (2026)

Distributed Online Submodular Maximization under Communication Delays: A Simultaneous Decision-Making Approach
by: Xu, Zirui, et al.
Published: (2026)

Near-Optimal Online Learning for Multi-Agent Submodular Coordination: Tight Approximation and Communication Efficiency
by: Zhang, Qixin, et al.
Published: (2025)

Sliced-Wasserstein-based Anomaly Detection and Open Dataset for Localized Critical Peak Rebates
by: Pallage, Julien, et al.
Published: (2024)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
by: Godichon-Baggioni, Antoine, et al.
Published: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

Online Control in Population Dynamics
by: Golowich, Noah, et al.
Published: (2024)

$k$-Submodular Interdiction Problems under Distributional Risk-Receptiveness and Robustness: Application to Machine Learning
by: Park, Seonghun, et al.
Published: (2024)

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

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
by: Farzin, Amir Ali, et al.
Published: (2026)

Machine Learning for K-adaptability in Two-stage Robust Optimization
by: Julien, Esther, et al.
Published: (2022)

Online Learning for Dynamic Constellation Topologies
by: Norberto, João, et al.
Published: (2026)

PAC-Bayes Meets Online Contextual Optimization
by: Xie, Zhuojun, et al.
Published: (2025)

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

Online Nonconvex Bilevel Optimization with Bregman Divergences
by: Bohne, Jason, et al.
Published: (2024)

Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Distributed Combined Space Partitioning and Network Flow Optimization: an Optimal Transport Approach (Extended Version)
by: Laurentin, Théo, et al.
Published: (2025)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

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

Learning-Augmented Decentralized Online Convex Optimization in Networks
by: Li, Pengfei, et al.
Published: (2023)

Learning to Cover: Online Learning and Optimization with Irreversible Decisions
by: Jacquillat, Alexandre, et al.
Published: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)

Fully First-Order Algorithms for Online Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

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

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Distributed Online Convex Optimization with Nonseparable Costs and Constraints
by: Pan, Zhaoye, et al.
Published: (2026)