Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7031081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Notes on computational-to-statistical gaps: predictions using statistical physics |
scientific article; zbMATH DE number 7031081 |
Statements
Notes on computational-to-statistical gaps: predictions using statistical physics (English)
0 references
28 February 2019
0 references
Summary: In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances. The methods we describe here are based on mature, albeit non-rigorous, tools from statistical physics.
0 references
computational-to-statistical gaps
0 references
phase transitions
0 references
cavity method
0 references
replica method
0 references
approximate message passing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.692785382270813
0 references
0.6927593350410461
0 references
0.6865546703338623
0 references
0.6826874613761902
0 references
0.6773734092712402
0 references