Picture for Lampros Flokas

Lampros Flokas

Assessing SATNet's Ability to Solve the Symbol Grounding Problem

Add code
Dec 13, 2023
Viaarxiv icon

Principled Weight Initialization for Hypernetworks

Add code
Dec 13, 2023
Viaarxiv icon

Chaos persists in large-scale multi-agent learning despite adaptive learning rates

Add code
Jun 01, 2023
Viaarxiv icon

Enabling SQL-based Training Data Debugging for Federated Learning

Add code
Aug 26, 2021
Figure 1 for Enabling SQL-based Training Data Debugging for Federated Learning
Figure 2 for Enabling SQL-based Training Data Debugging for Federated Learning
Figure 3 for Enabling SQL-based Training Data Debugging for Federated Learning
Figure 4 for Enabling SQL-based Training Data Debugging for Federated Learning
Viaarxiv icon

Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent

Add code
Jan 13, 2021
Figure 1 for Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
Figure 2 for Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
Figure 3 for Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
Figure 4 for Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
Viaarxiv icon

No-regret learning and mixed Nash equilibria: They do not mix

Add code
Oct 20, 2020
Figure 1 for No-regret learning and mixed Nash equilibria: They do not mix
Figure 2 for No-regret learning and mixed Nash equilibria: They do not mix
Figure 3 for No-regret learning and mixed Nash equilibria: They do not mix
Figure 4 for No-regret learning and mixed Nash equilibria: They do not mix
Viaarxiv icon

Complaint-driven Training Data Debugging for Query 2.0

Add code
Apr 12, 2020
Viaarxiv icon

Efficiently avoiding saddle points with zero order methods: No gradients required

Add code
Oct 29, 2019
Figure 1 for Efficiently avoiding saddle points with zero order methods: No gradients required
Figure 2 for Efficiently avoiding saddle points with zero order methods: No gradients required
Figure 3 for Efficiently avoiding saddle points with zero order methods: No gradients required
Viaarxiv icon

Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games

Add code
Oct 28, 2019
Figure 1 for Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games
Figure 2 for Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games
Figure 3 for Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games
Figure 4 for Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games
Viaarxiv icon