怎么判断一个「研究发现」靠不靠谱?
区分「靠谱」与「不靠谱」研究发现的三条可操作标准:研究设计是否严谨、结论是否被夸大、以及来源是否可追溯。
Explore by topic
Physics, chemistry, biology, Earth science, space, and the environment.
区分「靠谱」与「不靠谱」研究发现的三条可操作标准:研究设计是否严谨、结论是否被夸大、以及来源是否可追溯。
A clear boundary map of classical gas counting: it works for dilute, hot gases of distinguishable, massive particles; it breaks for quantum gases (degeneracy), for dense fluids (interactions), and across phase transitions — each failure mode named and bounded.
A capacity-controlled threshold separates approximation from interpolation: once a network has enough parameters to fit every training point exactly, the optimization problem shifts from finding shared patterns to finding any solution, and the learned function changes character accordingly.
The ideal-gas counting picture works only when the box is large enough that particles act as distinguishable classical points; once the box approaches the de Broglie wavelength, quantum statistics (Bose–Einstein or Fermi–Dirac) and discrete energy levels replace the classical tally.
Traffic waves are a useful approximation, but only on uniform stretches of road. Real networks break the assumption the moment intersections, signals, lane drops, or merges interrupt the free flow that the wave equation requires.
Time's arrow emerges because ordered macroscopic states correspond to a tiny minority of microscopic arrangements, while disordered states correspond to an astronomically larger majority — so motion toward disorder is statistically almost inevitable.
Entropy is the tendency of systems to move toward their most probable arrangements, and this single statistical rule governs mixing, information loss, and the arrow of time itself.
Heat flows in one direction because the number of disordered microstates is overwhelmingly larger than the number of ordered ones, making entropy increase a statistical near-certainty.
The Cauchy distribution is preserved by convolution because it is a stable distribution with stability parameter α = 1; its heavy (1/x²) tails ensure that extreme observations keep reappearing, so repeated averaging never concentrates probability around the mean.
Averages of skewed data become normal because each sample mean is a sum of independent random pulls that symmetrizes through aggregation, with the spread shrinking predictably as 1/√n.
Irreversibility creates a quantifiable cost that option value must clear before action becomes rational, turning 'just decide' into 'compare a threshold to the expected upside'.
The Central Limit Theorem requires finite variance and independent (or weakly dependent) summands; heavy tails push variance to infinity, and correlations let individual shocks persist across the average.
The bell shape in bootstrapping comes from the sampling distribution of the mean, not from the underlying dataset — and that distribution becomes bell-shaped by the Central Limit Theorem as resamples grow in size.
Correlation lets rare large steps align across many terms, and this alignment makes extreme outcomes occur far more often than independence predicts.
The bell curve appears only when the Central Limit Theorem can act: it requires enough independent samples, and a source whose variance is finite and not dominated by rare extreme events.
Sample means concentrate around the true mean with spread σ/√n because summing independent values convolves their distributions, an operation that erases sharp edges and corners until only a Gaussian profile remains.
종 모양은 숫자들 자체에서 오는 것이 아니라, 독립적인 흔들림들을 함께 더하는 평균 행위에서 비롯됩니다.
The standard error of a mean shrinks as 1/√n, and this same scaling shows up visibly in dice averages, polling margins, and physics timing experiments.
Bell-shaped distributions appear whenever a single result is the sum of many small, independent influences — and the Central Limit Theorem explains why this happens across heights, test scores, measurement errors, and beyond.
The CLT holds for the sample mean under any finite-variance source distribution, but convergence to normality is slow for skewed and especially heavy-tailed data — so 'large enough n' depends on the tail, not just the sample size.
Gradient descent slows near a saddle because one direction has weak downhill slope and weak curvature, so the update becomes very small in that direction.
Statistical hypothesis testing provides a framework for distinguishing real patterns from chance ones by measuring how often data with no real pattern would look just as interesting.
How unsupervised learning reveals latent structure — clusters, low-dimensional manifolds, and anomalies — hidden inside high-dimensional data.
Unsupervised learning works by turning raw inputs into compressed, similarity-based representations — clusters, dimensions, and patterns — that the model itself defines as 'consistent.'