AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights

Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use ACCELEWEIGHT in a stochastic environmentACCELEWEIGHT · Routing game with noisy costs (24 vertices, 276 edges)convergence of F(X_T)-F(x*)Hurt
use ADAWEIGHT instead of ACCELEWEIGHT in a stochastic environmentADAWEIGHT · Routing game with noisy costs (24 vertices, 276 edges)convergence of F(X_T)-F(x*)Improved
badly tuned initial step size for ACCELEWEIGHT (ablation)ACCELEWEIGHT · SiouxFalls networkconvergenceHurt
vary initial step size for ADAWEIGHT (parameter-agnostic) (ablation)ADAWEIGHT · SiouxFalls networkconvergenceNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy