Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.36590

When Scatter Plots Hide the Data: Diagnosing Ties and Choosing the Right Display in R

Sameera Viswakula
View original source ↗Read source document ↗Export metadata ↓

Abstract

Scatter plots draw one mark per observation, so observations that share a location are hidden. In a two-item Likert survey of 2,757 respondents, 98.7% of the data lie under other points and the plot shows only 36 dots. The density-distribution sunflower plot of Dupont and Plummer addresses this by drawing raw points in sparse regions and sunflowers, whose petals count observations, in dense ones. It is not available in R, and its single petal weight for dense cells fails when cell counts span more than an order of magnitude: small dense cells collapse to one petal, and the count a reader decodes can be wrong by 150% or more. We propose geometric petal tiers, in which each cell uses the smallest weight among 1, b, b2, . . . observations per petal that keeps its flower within P petals. Every flower then has between about P/b and P petals, and the relative error of every decoded count is below b/(2P), 17.9% at the defaults b = 5 and P = 14. We also define tie diagnostics and decision rules that use them to choose between an ordinary scatter plot, jitter or transparency, a classic sunflower plot and geometric tiers. Both are implemented in the ggplot2 extension ggsunflower. We illustrate the methods on survey, automotive, historical and large commercial data, and in a simulation over 35 conditions geometric tiers keep the worst-cell error at or below 14% where a single weight reaches a median of 251%.

Explore related subjects

stat.COastro-ph.IMstat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sameera Viswakula. 2026-10-27. When Scatter Plots Hide the Data: Diagnosing Ties and Choosing the Right Display in R. https://arxiv.org/abs/2610.36590

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Unifying Sparse Estimation of Precision and Covariance Matrices

Penalized maximum likelihood is a widely used approach to estimate a sparse precision or a sparse covariance matrix. A zero in the precision matrix encodes a conditional independence and a zero in the covariance matrix a marginal independence, and the two estimators have been developed separately, each with its own algorithm. We show that these two problems can be unified via a single reparametrization of the last column of either matrix. This reparametrization decouples the likelihood function for each problem to a one-dimensional minimization followed by a penalized multiple regression. Our approach applies to any penalty that is separable in the off-diagonal entries and linear on the diagonal. When the penalty is the $\ell_1$ norm, it unifies the graphical Lasso and the covariance graphical Lasso algorithms.

stat.CO↗
arXiv2026

A new gradient-free active subspace estimation method with application to rare event probability estimation

To reduce the cost of estimating the probability of a rare event involving a very large number of random parameters, we propose a new strategy for dimension reduction coupled with a surrogate model for the expensive part of the algorithm. To this end, we extend the Ordinary Kriging Active Subspace (OK-AS) method into a sequential version. Our approach consists of iteratively re-estimating the active subspace using a Kriging surrogate trained in a rotated coordinate system until the active subspace stabilises. This method allows for a reduction in prediction error and a better approximation of the active subspace on a benchmark of test problems. Furthermore, we integrate our algorithm into an efficient pre-existing approach for estimating the probability of a rare event. This approach is based on learning the active subspace associated with the random event whose probability is to be estimated. The sequential learning of an importance sampling density is necessary and corresponds to the expensive part of this strategy. To circumvent this issue, we integrate our sequential OK-AS version into the estimation of the importance sampling density. The numerical results indicate that our method allows for reducing the cost required to obtain a precise estimate of the rare event probability.

stat.CO↗
arXiv2026

ProjGuard: Safety Monitoring for Computer-Use Agents via Low-Dimensional Projections

Computer-use agents are increasingly capable of operating on real operating systems, but this capability has also increased their exposure to prompt injection and other adversarial content that can manipulate their behavior during interaction. Existing defenses typically rely on analyzing the prompt or each potentially malicious input with a second large model at inference time, which can limit coverage or increase deployment cost. We propose ProjGuard, a lightweight runtime monitor that derives a scalar risk signal from the agent's accumulated response history using a supervised linear projection. The monitor evaluates this signal at each step and raises an alert when it exceeds a fitted threshold. When an alert is raised, we selectively activate an auxiliary vision-language model (VLM) to propose the next action and steer execution back toward task completion. Experiments on OS-Harm show that monitoring with on-demand VLM intervention reduces the unsafe rate from 16% to 3% while improving task completion from 59% to 65%. We further evaluate transfer to RiosWorld, where the method remains competitive, reaching 4% unsafe and 64% completion. Overall, these results support a hierarchical safety strategy that combines continuous response monitoring with selective multimodal intervention.

stat.CO↗