On the relaxation problem in statistical mechanics

• URL: http://arxiv.org/abs/2608.30871v2
• Date: Tue, 01 Sep 2026 12:53:32 GMT
• Title: On the relaxation problem in statistical mechanics
• Abstract summary: We make explicit what are the emphoperational objects subject to relaxation: the local time statistics of the recorded signal $Z(t)$.<n>The subject of prediction is a belief about a future fresh out-of-sample reading of a measurement outcome whose distribution is inferred from the mathematical model believed to be true.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We reformulate the relaxation problem in statistical mechanics by making explicit what are the \emph{operational} objects subject to relaxation: the local time statistics of the recorded signal $Z(t)$. These local time statistics are simply the estimated histograms of observations $\{Z(t_i)\}_{i=1}^M$ performed at uniformly random times $\{t_i\}_{i=1}^M$ by a clockless observer. The subject of prediction is a belief about a future fresh out-of-sample reading of a measurement outcome whose distribution is inferred from the mathematical model believed to be true. For finite bounded systems of $N\ge 1$ degrees of freedom global irreversible relaxation of predictions can occur but special initial conditions exist. The form of the predictions depends on certain loss functions whose choice is up to the particular observer. Finally, entropy is given a learning interpretation as mutual information between the observer and the unknown past of the system under consideration and, in complete generality, its stationary value depends on the information available.

Related papers

• Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements [66.94250413799232]
  We study mean estimation of a random vector $X$ in a distributed parameter-server-worker setup.<n>Key challenges are adversarial measurements and asynchrony.<n>Results provide a unified finite-time characterization of robustness, identifiability, and statistical efficiency in distributed linear estimation with adversarial workers.
  arXiv  Detail & Related papers  (2026-04-07T11:45:55Z)
• Extrapolation of quantum measurement data [0.0]
  We consider the problem of predicting future expectation values of a collection of quantum observables, given their noisy expectation values at past times.<n>We find highly problematic datasets that allow full predictability at any future time $tau$, but only when past averages are known up to precision superexponential in $tau$.<n>We identify "aha! datasets", which drastically increase the predictability of the future statistics of an unrelated measurement.
  arXiv  Detail & Related papers  (2025-07-09T14:49:13Z)
• Bayesian Inference for Left-Truncated Log-Logistic Distributions for Time-to-event Data Analysis [0.19999259391104385]
  We propose a Bayesian approach for estimating the parameters of the left-truncated log-logistic (LTLL) distribution.<n>We show that it provides more stable and reliable parameter estimates, particularly when the likelihood surface is irregular due to left truncation.
  arXiv  Detail & Related papers  (2025-06-21T23:10:07Z)
• On Cold Posteriors of Probabilistic Neural Networks: Understanding the Cold Posterior Effect and A New Way to Learn Cold Posteriors with Tight Generalization Guarantees [4.532517021515833]
  In Bayesian deep learning, neural network weights are treated as random variables with prior distributions. PAC-Bayesian analysis offers a frequentist framework to derive generalization bounds for randomized predictors. By balancing the influence of observed data and prior regularization, temperature adjustments can address issues of underfitting or overfitting in Bayesian models.
  arXiv  Detail & Related papers  (2024-10-20T06:40:35Z)
• Memory effects in a sequence of measurements of non-commuting observables [0.0]
  We describe alternating measurements of two non-commuting observables. Projective measurement of an observable completely destroys memory of the outcome of a previous measurement of the conjugate observable. We apply our methods to a spin 1/2 system and a spin 1 system undergoing alternating measurements of the $S_z$ and $S_x$ spin observables.
  arXiv  Detail & Related papers  (2024-02-13T19:17:34Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Dense Uncertainty Estimation via an Ensemble-based Conditional Latent Variable Model [68.34559610536614]
  We argue that the aleatoric uncertainty is an inherent attribute of the data and can only be correctly estimated with an unbiased oracle model. We propose a new sampling and selection strategy at train time to approximate the oracle model for aleatoric uncertainty estimation. Our results show that our solution achieves both accurate deterministic results and reliable uncertainty estimation.
  arXiv  Detail & Related papers  (2021-11-22T08:54:10Z)
• Minimax Estimation of Partially-Observed Vector AutoRegressions [0.0]
  We study the properties of a partially-observed state-space model. We describe a sparse estimator based on the Dantzig selector and upper bound its non-asymptotic error. An application to open railway data highlights the relevance of this model for public transport traffic analysis.
  arXiv  Detail & Related papers  (2021-06-17T08:46:53Z)
• Understanding the Under-Coverage Bias in Uncertainty Estimation [58.03725169462616]
  quantile regression tends to emphunder-cover than the desired coverage level in reality. We prove that quantile regression suffers from an inherent under-coverage bias. Our theory reveals that this under-coverage bias stems from a certain high-dimensional parameter estimation error.
  arXiv  Detail & Related papers  (2021-06-10T06:11:55Z)
• SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic Regression [68.66245730450915]
  We develop an improved method for debiasing predictions and estimating frequentist uncertainty for practical datasets. Our main contribution is SLOE, an estimator of the signal strength with convergence guarantees that reduces the computation time of estimation and inference by orders of magnitude.
  arXiv  Detail & Related papers  (2021-03-23T17:48:56Z)
• Learning Interpretable Deep State Space Model for Probabilistic Time Series Forecasting [98.57851612518758]
  Probabilistic time series forecasting involves estimating the distribution of future based on its history. We propose a deep state space model for probabilistic time series forecasting whereby the non-linear emission model and transition model are parameterized by networks. We show in experiments that our model produces accurate and sharp probabilistic forecasts.
  arXiv  Detail & Related papers  (2021-01-31T06:49:33Z)
• Estimation of Accurate and Calibrated Uncertainties in Deterministic models [0.8702432681310401]
  We devise a method to transform a deterministic prediction into a probabilistic one. We show that for doing so, one has to compromise between the accuracy and the reliability (calibration) of such a model. We show several examples both with synthetic data, where the underlying hidden noise can accurately be recovered, and with large real-world datasets.
  arXiv  Detail & Related papers  (2020-03-11T04:02:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.