AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Strongly-Typed Agents are Guaranteed to Interact Safely

ICML 2017 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 gradient descent in a safe convex game with smooth lossesSafe convex games · Safe convex gamesNash equilibrium convergenceHelped
Impose simultaneous factorization, commuting projections, and monotonic covariationGradient-based agents in strongly-typed games · Strongly-typed gamesSafetyHelped
Use Newton's method on a strictly convex lossSingle-player open game · Strictly convex lossSafetyHelped
Use feedback-alignment error signals satisfying the pseudoinverse conditionNeural network error propagation · Feedback alignmentSafetyHelped
Use kickback's truncated error signalsNeural network error propagation · KickbackSafetyHelped
Use gradient descent in a zero-sum bilinear gameTwo-player block game · Zero-sum bilinear gameNash equilibrium convergenceHurt
Use strong-typing rather than requiring a weighted potential gameGame safety analysis · Strongly-typed gamesSafetyHelped
Treat potential-game structure alone as a safety guaranteePotential games · Potential game exampleSafetyHurt

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