π
π
The Cartographer
Online Combinatorial Linear Optimization via a Frank-Wolfe-based Metarounding Algorithm
October 19, 2023 Β· Declared Dead Β· π IEICE Trans. Inf. Syst.
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ryotaro Mitsuboshi, Kohei Hatano, Eiji Takimoto
arXiv ID
2310.12629
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.LG
Citations
0
Venue
IEICE Trans. Inf. Syst.
Last Checked
5 months ago
Abstract
Metarounding is an approach to convert an approximation algorithm for linear optimization over some combinatorial classes to an online linear optimization algorithm for the same class. We propose a new metarounding algorithm under a natural assumption that a relax-based approximation algorithm exists for the combinatorial class. Our algorithm is much more efficient in both theoretical and practical aspects.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted