Picture for Rémi Gribonval

Rémi Gribonval

OCKHAM

PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms

Add code
Dec 18, 2024
Viaarxiv icon

Path-metrics, pruning, and generalization

Add code
May 23, 2024
Figure 1 for Path-metrics, pruning, and generalization
Figure 2 for Path-metrics, pruning, and generalization
Figure 3 for Path-metrics, pruning, and generalization
Figure 4 for Path-metrics, pruning, and generalization
Viaarxiv icon

Keep the Momentum: Conservation Laws beyond Euclidean Gradient Flows

Add code
May 21, 2024
Figure 1 for Keep the Momentum: Conservation Laws beyond Euclidean Gradient Flows
Figure 2 for Keep the Momentum: Conservation Laws beyond Euclidean Gradient Flows
Figure 3 for Keep the Momentum: Conservation Laws beyond Euclidean Gradient Flows
Figure 4 for Keep the Momentum: Conservation Laws beyond Euclidean Gradient Flows
Viaarxiv icon

Sketch and shift: a robust decoder for compressive clustering

Add code
Dec 15, 2023
Figure 1 for Sketch and shift: a robust decoder for compressive clustering
Figure 2 for Sketch and shift: a robust decoder for compressive clustering
Figure 3 for Sketch and shift: a robust decoder for compressive clustering
Figure 4 for Sketch and shift: a robust decoder for compressive clustering
Viaarxiv icon

Revisiting RIP guarantees for sketching operators on mixture models

Add code
Dec 09, 2023
Viaarxiv icon

Compressive Recovery of Sparse Precision Matrices

Add code
Nov 08, 2023
Viaarxiv icon

A path-norm toolkit for modern networks: consequences, promises and challenges

Add code
Oct 19, 2023
Viaarxiv icon

Abide by the Law and Follow the Flow: Conservation Laws for Gradient Flows

Add code
Jun 30, 2023
Viaarxiv icon

About the Cost of Global Privacy in Density Estimation

Add code
Jun 26, 2023
Figure 1 for About the Cost of Global Privacy in Density Estimation
Viaarxiv icon

Does a sparse ReLU network training problem always admit an optimum?

Add code
Jun 05, 2023
Figure 1 for Does a sparse ReLU network training problem always admit an optimum?
Figure 2 for Does a sparse ReLU network training problem always admit an optimum?
Figure 3 for Does a sparse ReLU network training problem always admit an optimum?
Figure 4 for Does a sparse ReLU network training problem always admit an optimum?
Viaarxiv icon