activity
20172026
most citedSampling Markov Models under Constraints: Complexity Results for Binary Equalities and Grammar Membership

2 citations · 4 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2026

CAGE-NAS: Certified Functional Descent for Efficient Model Growth

Santiago Florido Gomez, Stéphane Rivaud

The progressive growth of neural networks requires deciding when the current representation remains sufficient for optimization and when it should be expanded. CAGE-NAS formulates…

cs.LG2025

Growth strategies for arbitrary DAG neural architectures

Stella Douka, Manon Verbockhaven, Théo Rudkiewicz +4

Deep learning has shown impressive results obtained at the cost of training huge neural networks. However, the larger the architecture, the higher the computational, financial, and…

cs.LG2024

PETRA: Parallel End-to-end Training with Reversible Architectures

Stéphane Rivaud, Louis Fournier, Thomas Pumir +3

Reversible architectures have been shown to be capable of performing on par with their non-reversible architectures, being applied in deep learning for memory savings and generativ…

cs.LG2023★ 2 cited

Can Forward Gradient Match Backpropagation?

Louis Fournier, Stéphane Rivaud, Eugene Belilovsky +2

Forward Gradients - the idea of using directional derivatives in forward differentiation mode - have recently been shown to be utilizable for neural network training while avoiding…

cs.CC2017★ 2 cited

Sampling Markov Models under Constraints: Complexity Results for Binary Equalities and Grammar Membership

Stephane Rivaud, François Pachet

We aim at enforcing hard constraints to impose a global structure on sequences generated from Markov models. In this report, we study the complexity of sampling Markov sequences un…