SearcharxivSearch

arXiv subjects

Kamillo Ferry

Publications and source records attributed to Kamillo Ferry.

9 recordsLinked to original sources

Tracking Representation Dynamics in Large Language Models with Persistent Homology

Large language models are commonly aligned through supervised fine-tuning, yet little is known about how their internal representations evolve during this process. We study alignment dynamics using persistent homology by tracking the topology of activation spaces throughout fine-tuning. Across four transformer language models ranging from 1B to 7B parameters and three alignment objectives corresponding to helpful, harmless, and mixed training data, we find that the majority of topological reorganization occurs during the earliest stages of training. A dense checkpoint analysis reveals a transient peak in topological activity followed by rapid stabilization. We further show that different alignment objectives induce distinguishable topological trajectories, while instruction-tuned and pretrained models exhibit qualitatively different patterns of evolution. Our results suggest that persistent homology provides a complementary perspective on alignment, revealing representation-level changes that are not apparent from behavioral metrics alone.

cs.LG

Counting symmetric unimodular triangulations

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds are given, in combination with full enumerations of a few small cases.

math.CO

Minimum bounding polytropes for estimation of max-linear Bayesian networks

Max-linear Bayesian networks are recursive max-linear structural equation models represented by an edge weighted directed acyclic graph (DAG). The identifiability and estimation of max-linear Bayesian networks is an intricate issue as Gissibl, Kl\"uppelberg, and Lauritzen have shown. As such, a max-linear Bayesian network is generally unidentifiable and standard likelihood theory cannot be applied. We can associate tropical polyhedra to max-linear Bayesian networks. Using this, we investigate the minimum-ratio estimator proposed by Gissibl, Kl\"uppelberg, and Lauritzen and give insight on the structure of minimal best-case samples for parameter recovery which we describe in terms of set covers of certain triangulations. We also combine previous work on estimating max-linear models from Tran, Buck, and Kl\"uppelberg to apply our geometric approach to the structural inference of max-linear models. This is tested extensively on simulated data and on real world data set, the NHANES report for 2015--2016 and the upper Danube network data.

stat.ME

Inference for max-linear Bayesian networks with noise

Max-Linear Bayesian Networks (MLBNs) provide a powerful framework for causal inference in extreme-value settings; we consider MLBNs with noise parameters with a given topology in terms of the max-plus algebra by taking its logarithm. Then, we show that an estimator of a parameter for each edge in a directed acyclic graph (DAG) is distributed normally. We end this paper with computational experiments with the expectation and maximization (EM) algorithm and quadratic optimization.

stat.ML

Polyhedral Aspects of Maxoids

The conditional independence (CI) relation of a distribution in a max-linear Bayesian network depends on its weight matrix through the $C^\ast$-separation criterion. These CI~models, which we call maxoids, are compositional graphoids which are in general not representable by Gaussian random variables. We prove that every maxoid can be obtained from a transitively closed weighted DAG and show that the stratification of generic weight matrices by their maxoids yields a polyhedral~fan. We also use this connection to polyhedral geometry to develop an algorithm for solving the conditional independence implication problem for maxoids.

math.CO

Good Triangulations of Cosmological Polytopes

Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus of interest shifted towards their mathematical properties, e.g., their face structure and triangulations. Juhnke, Solus and Venturello used toric geometry to show that these polytopes have a so-called good triangulation that is unimodular. Based on these results Bruckamp et al. studied the Ehrhart theory of those polytopes and in particular the h*-polynomials of cosmological polytopes of multitrees and multicycles. In this article we complete this part of the story. We enumerate all maximal simplices in good triangulations of any cosmological polytope. Furthermore, we provide a method to turn such a triangulation into a half-open decomposition from which we deduce that the h*-polynomial of a cosmological polytope is a specialization of the Tutte polynomial of the defining graph. This settles several open questions and conjectures of Juhnke, Solus and Venturello as well as Bruckamp et al.

math.CO

The GroebnerWalk.jl package for OSCAR

Computing Gr\"obner bases is known to have a very high upper bound on computation time with respect to input length. Due to the connection between polyhedral geometry and Gr\"obner bases through the Gr\"obner fan, one can attempt an incremental approach to compute Gr\"obner bases. First computing a Gr\"obner basis with respect to an `easy' term order and transforming that result to a Gr\"obner basis with respect to the desired term order by using information about this polyhedral fan is done by a family of algorithms termed as Gr\"obner walk. We implemented two variants of the Gr\"obner walk in the computer algebra system OSCAR and compared their performance with classical Gr\"obner basis methods already found in OSCAR.

math.AC

Tropical Fr\'echet Means: a polyhedral approach to exact optimization

The Fr\'{e}chet mean is a fundamental notion of central tendency defined as a minimizer of a sum of squared distances in a general metric space. In this paper, we study Fr\'{e}chet means in tropical geometry -- a piecewise linear, combinatorial, and polyhedral variant of algebraic geometry -- by formulating and solving the associated tropical quadratic optimization problem. We give a geometric characterization of the collection of all tropical Fr\'{e}chet means as a bounded set that is simultaneously tropically and classically convex, hence a polytrope. We establish the existence of positivity certificates for maxima of finitely many quadratic polynomials in $\mathbb{R}[x_1,\ldots,x_n]$ whose homogeneous quadratic components are sums of squares, which provides a symbolic framework for exact optimization. Using this structure, we develop algorithms for computing tropical Fr\'{e}chet means and the associated Fr\'{e}chet mean polytrope. We further describe a combinatorial type decomposition of the objective function induced by braid arrangements, yielding a piecewise quadratic representation and a fully symbolic method for exact computation.

math.OC

Tropical combinatorics of max-linear Bayesian networks

A polytrope is a tropical polyhedron that is also classically convex. We study the tropical combinatorial types of polytropes associated to weighted directed acyclic graphs (DAGs). This family of polytropes arises in algebraic statistics when describing the model class of max-linear Bayesian networks. We show how the edge weights of a network directly relate to the facet structure of the corresponding polytrope. We also give a classification of polytropes from weighted DAGs at different levels of equivalence. These results give insight on the statistical problem of identifiability for a max-linear Bayesian network.

math.CO