From the 1 of 9 papers with an AI index.
1 citations
- École Normale Supérieure - PSLFR3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Carleton UniversityCA1 paper
- Computer Research Institute of MontréalCA1 paper
- Infosys (India)IN1 paper
- Institut de Biologie de l'École Normale SupérieureFR1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Jagiellonian UniversityPL1 paper
- Keio UniversityJP1 paper
- Laboratoire de Physique de l'Ecole Normale SupérieureFR1 paper
- LIP6FR1 paper
- Monash UniversityAU1 paper
9 papers
Causality Constraints on Black Hole Thermodynamics in Nonlinear Electrodynamics
Yoshihiko Abe, Maxime Médevielle, Toshifumi Noumi +1
The paper investigates how enforcing causality (no superluminal propagation) in nonlinear electrodynamics leads to monotonic relationships between the mass‑to‑charge ratio and entr…
High-Dimensional Analysis of Gradient Flow for Extensive-Width Quadratic Neural Networks
Simon Martin, Giulio Biroli, Francis Bach
We study the high-dimensional training dynamics of a shallow neural network with quadratic activation in a teacher-student setup. We focus on the extensive-width regime, where the…
When Quantum and Classical Models Disagree: Learning Beyond Minimum Norm Least Square
Slimane Thabet, Léo Monbroussou, Eliott Z. Mamon +1
Quantum Machine Learning algorithms based on Variational Quantum Circuits (VQCs) are important candidates for useful application of quantum computing. It is known that a VQC is a l…
Fast Linear Reservoirs via Diagonalization
Romain de Coudenhove, Yannis Bendi-Ouis, Anthony Strock +1
We introduce a diagonalization-based optimization for Linear Echo State Networks (ESNs) that reduces the per-step computational complexity of reservoir state updates from quadratic…
Chaining 2-FWL GNNs for Combinatorial Graph Alignment
Marc Lelarge
For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly init…
The grid-minor theorem revisited
Vida DujmoviÄ, Robert Hickingbotham, JÄdrzej Hodor +6
We prove that for every planar graph of treedepth , there exists a positive integer such that for every -minor-free graph , there exists a graph of treewidth a…