Figure 1 - uploaded by Kamal Dingle
Content may be subject to copyright.
Simplicity bias in a model of plant shapes (L-systems). Higher probability shapes are simpler (lower complexity values), and more complex shapes have lower probabilities. Two example plant shapes are illustrated, one simple and one complex. The data points are coloured, separating the outputs which account for the top 50% of the probability from those that account for the bottom 50% of the probability for each complexity value

Simplicity bias in a model of plant shapes (L-systems). Higher probability shapes are simpler (lower complexity values), and more complex shapes have lower probabilities. Two example plant shapes are illustrated, one simple and one complex. The data points are coloured, separating the outputs which account for the top 50% of the probability from those that account for the bottom 50% of the probability for each complexity value

Source publication
Preprint
Full-text available
A layman's introduction to Algorithmic Probability

Context in source publication

Context 1
... Fig 1 (taken from Dingle, Camargo, Louis (2018) Nature Communications) we show an example of a complexity-probability plot for computergenerated plant shapes. The black line is the upper bound prediction just based on the complexities of the shapes. ...

Similar publications

Conference Paper
Full-text available
We study the multiplicity of minimum-∆v impulsive trajectories for long-time-horizon problems. One notable feature of these extremal impulsive trajectories is that many of the impulses are applied at a specific position, highlighting the significance of what we coin as "impulse anchor positions." We demonstrate that for long-time-horizon maneuvers...
Preprint
Full-text available
In this article, for Hamiltonian systems with two degrees of freedom, we study doubly symmetric periodic orbits, i.e. those which are symmetric with respect to two (distinct) commuting antisymplectic involutions. These are ubiquitous in several problems of interest in mechanics. We show that, in dimension four, doubly symmetric periodic orbits cann...
Experiment Findings
Full-text available
Neil DeGrasse Tyson claimed that everytime 1000 people participate in the coin-flipping experiment one person will always flip heads ten consecutive times. The simulation of the coin-flipping experiment included in this article have been used to disprove his claim. The reader is invited to run the simulation several times and see for himself or her...
Preprint
Full-text available
We show that neural networks with access to randomness can outperform deterministic networks by using amplification. We call such networks Coin-Flipping Neural Networks, or CFNNs. We show that a CFNN can approximate the indicator of a $d$-dimensional ball to arbitrary accuracy with only 2 layers and $\mathcal{O}(1)$ neurons, where a 2-layer determi...
Article
Full-text available
A scientific study of two copper coins from 1851 and 1853 reveals well-preserved symbols of a growing, newly independent Chile nation.