SearcharxivSearch

arXiv subjects

Andras Balint

Publications and source records attributed to Andras Balint.

3 recordsLinked to original sources

Data Leakage in Automotive Perception: Practitioners' Insights

Data leakage is the inadvertent transfer of information between training and evaluation datasets that poses a subtle, yet critical, risk to the reliability of machine learning (ML) models in safety-critical systems such as automotive perception. While leakage is widely recognized in research, little is known about how industrial practitioners actually perceive and manage it in practice. This study investigates practitioners' knowledge, experiences, and mitigation strategies around data leakage through ten semi-structured interviews with system design, development, and verification engineers working on automotive perception functions development. Using reflexive thematic analysis, we identify that knowledge of data leakage is widespread and fragmented along role boundaries: ML engineers conceptualize it as a data-splitting or validation issue, whereas design and verification roles interpret it in terms of representativeness and scenario coverage. Detection commonly arises through generic considerations and observed performance anomalies rather than implying specific tools. However, data leakage prevention is more commonly practiced, which depends mostly on experience and knowledge sharing. These findings suggest that leakage control is a socio-technical coordination problem distributed across roles and workflows. We discuss implications for ML reliability engineering, highlighting the need for shared definitions, traceable data practices, and continuous cross-role communication to institutionalize data leakage awareness within automotive ML development.

cs.CR

The high temperature Ising model on the triangular lattice is a critical percolation model

The Ising model at inverse temperature $β$ and zero external field can be obtained via the Fortuin-Kasteleyn (FK) random-cluster model with $q=2$ and density of open edges $p=1-e^{-β}$ by assigning spin +1 or -1 to each vertex in such a way that (1) all the vertices in the same FK cluster get the same spin and (2) +1 and -1 have equal probability. We generalize the above procedure by assigning spin +1 with probability $r$ and -1 with probability $1-r$, with $r \in [0,1]$, while keeping condition (1). For fixed $β$, this generates a dependent (spin) percolation model with parameter $r$. We show that, on the triangular lattice and for $β<β_c$, this model has a percolation phase transition at $r=1/2$, corresponding to the Ising model. This sheds some light on the conjecture that the high temperature Ising model on the triangular lattice is in the percolation universality class and that its scaling limit can be described in terms of SLE$_6$. We also prove uniqueness of the infinite +1 cluster for $r>1/2$, sharpness of the percolation phase transition (by showing exponential decay of the cluster size distribution for $r<1/2$), and continuity of the percolation function for all $r \in [0,1]$.

math.PR

Sharp phase transition and critical behaviour in 2D divide and colour models

Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and white with probability 1-r, independently of each other. On the square lattice, defining the critical probabilities for the site model and its dual, r_c(p) and r_c^*(p) respectively, as usual, we prove that r_c(p)+r_c^*(p)=1 for all subcritical p. On the triangular lattice, where our method also works, this leads to r_c(p)=1/2, for all subcritical p. On both lattices, we obtain exponential decay of cluster sizes below r_c(p), divergence of the mean cluster size at r_c(p), and continuity of the percolation function in r on [0,1]. We also discuss possible extensions of our results, and formulate some natural conjectures. Our methods rely on duality considerations and on recent extensions of the classical RSW theorem.

math.PR