Demo Data from EDBT 2026 / reviewers in the wild / expert
Santiago Aranguri
dblp:317/9904
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Computational geometry · 40% Graph algorithms and graph theory · 40% Combinatorics and discrete mathematics · 20% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 50% Learning theory · 50% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
training dynamics |
0.8 | 1 | 2024 | Mixed Dynamics In Linear Networks: Unifying the Lazy and Active Regimes · NeurIPS 2024 |
Computational geometry › curve representation › curve approximation
curve simplification |
0.6 | 1 | 2022 | Untangling Planar Graphs and Curves by Staying Positive · SODA 2022 |
Graph algorithms and graph theory › graph theory › graph transformation
graph reduction |
0.6 | 1 | 2022 | Untangling Planar Graphs and Curves by Staying Positive · SODA 2022 |
Computational geometry
planar curves |
0.6 | 1 | 2022 | Untangling Planar Graphs and Curves by Staying Positive · SODA 2022 |
Graph algorithms and graph theory
planar graphs |
0.6 | 1 | 2022 | Untangling Planar Graphs and Curves by Staying Positive · SODA 2022 |
Combinatorics and discrete mathematics
topological combinatorics |
0.6 | 1 | 2022 | Untangling Planar Graphs and Curves by Staying Positive · SODA 2022 |
Methods — techniques the papers use, named apart from their topics
singular value analysis · 0.8phase diagrams · 0.8potential function · 0.6homotopy moves · 0.6electrical transformations · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Mixed Dynamics In Linear Networks: Unifying the Lazy and Active RegimesabstractThe training dynamics of linear networks are well studied in two distinct
setups: the lazy regime and balanced/active regime, depending on the
initialization and width of the network. We provide a surprisingly
simple unifying formula for the evolution of the learned matrix that
contains as special cases both lazy and balanced regimes but also
a mixed regime in between the two. In the mixed regime, a part of
the network is lazy while the other is balanced. More precisely the
network is lazy along singular values that are below a certain threshold
and balanced along those that are above the same threshold. At initialization,
all singular values are lazy, allowing for the network to align itself
with the task, so that later in time, when some of the singular value
cross the threshold and become active they will converge rapidly (convergence
in the balanced regime is notoriously difficult in the absence of
alignment). The mixed regime is the `best of both worlds': it converges
from any random initialization (in contrast to balanced dynamics which
require special initialization), and has a low rank bias (absent in
the lazy dynamics). This allows us to prove an almost complete phase
diagram of training behavior as a function of the variance at initialization
and the width, for a MSE training task. Zhenfeng Tu, Santiago Aranguri, Arthur Jacot |
NeurIPS | 2 |
| 2022 | Untangling Planar Graphs and Curves by Staying PositiveabstractAny generic planar closed curve with n crossings can be turned into a simple closed curve by applying O(n3/2) homotopy moves without ever increasing the number of self-crossings; this improves over the O(n2) upper bound from Steinitz [Ency. Math. Wiss. III 1916], and matches the best lower bound. We prove the existence of a positive move that decreases the depth-sum potential at every step. Using similar techniques, we show that any 2-terminal plane graph with n vertices can be reduced to a single edge between the terminals using O(n3/2) electrical transformations, consisting of degree-1 reductions, series-parallel reductions, and ΔY-transformations; this proves a conjecture of Feo and Provan that was open for more than 30 years. Santiago Aranguri, Hsien-Chih Chang, Dylan Fridman |
SODA | 1 |