Copertina

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gupta, Swati, Moondra, Jai, Singh, Mohit
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Data Structures and Algorithms Machine Learning 68W27 (Primary) 90C25, 68Q25 (Secondary)
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
di: Gupta, Swati, et al.
Pubblicazione: (2023)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
di: Gupta, Swati, et al.
Pubblicazione: (2025)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
di: Gupta, Swati, et al.
Pubblicazione: (2022)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
di: Bubeck, Sébastien, et al.
Pubblicazione: (2022)

A simple Path-based LP Relaxation for Directed Steiner Tree
di: Pashkovich, Kanstantsin, et al.
Pubblicazione: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
di: Liu, Bowen
Pubblicazione: (2025)

Approximating k-Center via Farthest-First on $δ$-Covers
di: Wilson, Jason R.
Pubblicazione: (2026)

Stochastic Function Certification with Correlations
di: Ghuge, Rohan, et al.
Pubblicazione: (2026)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
di: Ito, Takehiro, et al.
Pubblicazione: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
di: Bansal, Ishan, et al.
Pubblicazione: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
di: Garg, Mohit, et al.
Pubblicazione: (2024)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
di: Simmons, Miles, et al.
Pubblicazione: (2026)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
di: Michel, Stefan
Pubblicazione: (2025)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
di: Schwardt, J., et al.
Pubblicazione: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
di: Goerigk, Marc, et al.
Pubblicazione: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
di: Grobben, Kobe, et al.
Pubblicazione: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
di: Lin, Yankai, et al.
Pubblicazione: (2022)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
di: Ryabchenko, Alexander, et al.
Pubblicazione: (2026)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
di: Ammann, Sabrina C. L., et al.
Pubblicazione: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

A scalable clustering algorithm to approximate graph cuts
di: Suchan, Leo, et al.
Pubblicazione: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Online Trading as a Secretary Problem Variant
di: Chen, Xujin, et al.
Pubblicazione: (2026)

Adaptive Approximation Schemes for Matching Queues
di: AmaniHamedani, Alireza, et al.
Pubblicazione: (2025)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
di: Burns, Matthew X., et al.
Pubblicazione: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2025)

Supermodular Maximization with Cardinality Constraints
di: Chen, Xujin, et al.
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
di: Cui, Jinchuan, et al.
Pubblicazione: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

Fundamentals of Partial Rejection Sampling
di: Jerrum, Mark
Pubblicazione: (2021)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
di: Gribling, Sander, et al.
Pubblicazione: (2025)