Search arXivSearch

arXiv subjects

Philipp Bogdan

Publications and source records attributed to Philipp Bogdan.

3 recordsLinked to original sources

The optimal-transport cartogram: world population as a Brenier map

A contiguous cartogram is a map whose area is proportional to a quantity such as population. The defining condition, that the Jacobian determinant of the deformation equals the density, is one equation for two unknown functions, so every cartogram method adds a tie-breaker, usually implicitly. Optimal transport makes the tie-breaker explicit: among all density-equalising maps of the frame onto itself, take the one that moves the population least in the mean-square sense. By Brenier's theorem that map is the gradient of a convex potential, so it has no local rotation anywhere and cannot fold. We compute this map for the world population of 2025 on a 4096 by 4096 Mercator grid (10 km cells) from the GHS-POP raster, using the fixed-point Monge-Ampère iteration of Benamou, Froese and Oberman with spectral Poisson solves, continuation in the population share and an ocean-only buffer, on a laptop GPU. Against a Gastner-Newman diffusion cartogram of the same density we find the same transport cost to within 0.4 per cent and density errors of a few per cent for both, but a median local rotation of 8.8 degrees for diffusion against 0.01 for transport, and a median anisotropy of 6.30 against 3.93. The construction extends to local refinement, by transporting a city's 100 m population onto the area measure the global map assigns to it, and to a semi-discrete counterpart: 8,192 Laguerre cells of 1.00 million people each. Code, data provenance and every figure's inputs are public.

cs.CG

Atom Learning Model (ALM): how a real classroom got tokenised

The Atom Learning Model (ALM) tokenises a school curriculum. 757 pages of GCSE and Further Mathematics material were read by machine into 1,934 atoms, each one thing a learner can do in a single step, ordered by 4,616 machine-written prerequisite links. Both sides of a lesson are then expressed in that one structure: a question is a set of atoms plus everything beneath them, a child's ability is a score between 0 and 1 on every atom of the same graph, and whether a question suits a child is arithmetic over one index, with no difficulty parameter fitted for either side. Nobody wrote an atom, a link or a question. Reading the 757 pages cost £55, building the whole structure cost between £615 and £1,230, and against it the system composed 6,648 questions for 373 children in two English secondary schools over seven weeks, at 26p per composed question. Four measurements went against expectation. The cost is in the links, not the pages. The composer's own difficulty label has a rank correlation of -0.0123 with measured facility, so a language model shown a question cannot say how hard it is. Children stop working when a mark takes seven seconds instead of three. And the deployment never served a question deeper than two prerequisite steps, which is exactly where the central premise becomes testable, leaving it unfalsified rather than confirmed.

cs.CY

INSTRUMENTAL: Automatic Synthesizer Parameter Recovery from Audio via Evolutionary Optimization

Existing audio-to-MIDI tools extract notes but discard the timbral characteristics that define an instrument's identity. We present Instrumental, a system that recovers continuous synthesizer parameters from audio by coupling a differentiable 28-parameter subtractive synthesizer with CMA-ES, a derivative-free evolutionary optimizer. We optimize a composite perceptual loss combining mel-scaled STFT, spectral centroid, and MFCC divergence, achieving a matching loss of 2.09 on real recorded audio. We systematically evaluate eight hypotheses for improving convergence and find that only parametric EQ boosting yields meaningful improvement. Our results show that CMA-ES outperforms gradient descent on this non-convex landscape, that more parameters do not monotonically improve matching, and that spectral analysis initialization accelerates convergence over random starts.

cs.SD