Bibliographic record
Abstract
Computerized structural optimization methods are often used to design the shape of structures to achieve a desired function, such as a specific compliance. In the simplest case of a structure built from a material with small deformations obeying Cauchy elasticity, the compliance is constant and the relationship between the forces applied on the structure and its deformation is linear. This linearity severely limits the types of functions which can be achieved by such materials. Here we study mechanical metamaterials made of repeating unit cells, each with specific dimensional parameters and with one-sided contact non-linearities. We show that the force and displacement equilibrium configurations of these metamaterials are mathematically equivalent to the fixed points of a recurrent artificial neural network. By exploiting this equivalence, we demonstrate mechanical metamaterials that can be designed (trained) to implement complex non-linear functions, using a gradient descent algorithm as in artificial neural networks . One of our metamaterial structures has a higher compliance when it is pressed against a pattern of raised bumps corresponding to the vowels in the Braille alphabet, than when it is pressed against patterns for six consonants. As artificial neural networks are known to be efficient models for numerous problems in machine learning, our results reveal that beneficial features of neural networks can be transferred to physical objects (mechanical structures). These features include the design of systems with complex input–output relationships by using generic methods that only rely on the repetitive processing of pairs of inputs and desired outputs, as well as remarkable generalization capabilities. We anticipate our methodology to be a starting point for the transfer of some of the breakthroughs in the rapidly advancing field of machine learning to highly functional physical devices in applications that are constrained by energy, volume, data processing or response time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".