Origami & Folding
what one sheet can do
Concept

Randomised algorithm — where it appears

A procedure that makes some of its choices by a coin. The coin buys variety — many different answers rather than one — and pays for it in a cost that varies from run to run, which is where a heavy-tailed run time comes from and what a restart strategy is built to exploit.

Named by 4 essays across 2 fields — each of them below, with the objects they name alongside it.

the curve is stop-and-restart; the rule is a constant letter order1001e+31e+41001e+31e+4563 at a cutoff of 10080 nodes, deterministic, nothing to restartexpected nodes in totalcutoff, in nodes

Restarting what cannot be restarted

Stopping a search early and starting it again with a fresh seed costs five hundred and twelve steps in expectation against sixteen thousand for patience. Every number in that is right. The distribution it is right about was made by the search's own coin, and taking the coin out costs eighty — with nothing left to reseed.

complexity · Hardness of folding Paper is made in ChinaPaper reaches JapanPaper is made in EuropeFolded paper is used ceremonially in Japan400 yrPaper is folded for amusement in Japan980 yrThe thousand cranes897 yrThe pajarita is folded in Spain293 yrPaper folding is taught as geometryOne fold solves a cubicThe diamond pattern in a crushed cylinderThe conditions at a flat-foldable vertexThe dashed-and-dotted diagram notationThe Miura foldA five-pointed star from one straight cutAny straight-line drawing, from one straight cutyear of the source500100015002000the date generally giventhe oldest source that says somedian overrun 201.5 years

The cure was named first

A heavy-tailed search runtime, the arithmetic for cutting it off and restarting, and the reason restarts work at all were established in the study of search between 1993 and 1998. This collection imported all three, and inherited with them the phenomenon they answer — which is that randomising a search's choices is what makes the tail.

history · Rediscovery the bar is what the whole job costs in expectation, in nodeson the rhombille patch, over the same 120 measured runs as the fixed cutoffsbest fixed, 100512chosen after seeing the runsunit 132226.30 times the best fixedunit 228545.58 times the best fixedunit 525424.97 times the best fixedunit 1021524.20 times the best fixedunit 2017623.44 times the best fixedunit 508481.66 times the best fixedunit 1005511.08 times the best fixedunit 2006381.25 times the best fixeda unit of one assumes nothing about the runs; every larger unit is a guess at their scale

What the hindsight was worth

The best restart cutoff for the one tessellation search with a heavy tail was read off a hundred and twenty measured runs, which nobody running the search could have done in advance. The universal schedule needs no such knowledge, and on the same runs it costs 3,222 nodes in expectation against 512 for the cutoff chosen by looking — a factor of 6.3, which is close to the base-two logarithm of that cutoff, as the theory of the schedule says it should be. A larger unit brings the schedule within a few per cent of the hindsight, and choosing the unit is choosing the scale the schedule was meant not to need.

history · Rediscovery the expected cost of the whole job under rules that learn from their own failures, in nodeson the rhombille patch, over the same 120 measured runs; the dark bar borrows its unit from other patchesbest fixed, 100512chosen after seeing the runsdouble after every failure1820at least 3.56 times the best fixeddouble after every failure, from sixteen1805at least 3.53 times the best fixedgrow by half after each failure1204at least 2.35 times the best fixeduniversal, unit of one32226.30 times the best fixeduniversal, unit from other patches8721.70 times the best fixeda rule that reads only its own failures cannot beat the best fixed cutoff, and cannot know which that is

A failure teaches a schedule nothing

The universal restart schedule costs 6.3 times the cutoff chosen by hindsight on the one folding search with a heavy tail, and the obvious repair is a schedule that learns its scale from the attempts it has already made. It cannot. A failed attempt costs exactly its cutoff and reports only that the run needed more, so every rule that chooses the next cutoff from its own failures writes down the same list whatever happens — a fixed schedule in disguise. On the measured runs, doubling after every failure costs at least 3.6 times the hindsight, and growing by half at least 2.4. What does come near is information from outside the run: the universal schedule given the longest search on four other patches as its unit costs 1.7 times the hindsight. The field that supplied the schedule reached the same conclusion, and answered it by watching runs from the inside.

history · Rediscovery

Named alongside it

The objects these essays reach for when they reach for this one.

Search costRediscoveryWorst-case analysisDistributionHeuristicRestartSearchAttributionDeterminismDocumentary recordEvidenceExpected-value

All concepts