Statistical Learning Theory
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Statistical Decision Theory with Counterfactual Loss
Announce Type: replace-cross Abstract: Many researchers apply classical statistical decision theory to evaluate treatment choices and learn optimal policies. However, because this framework relies solely on realized outcomes under chosen actions and ignores counterfactuals, it cannot assess the quality of a decision relative to feasible alternatives at the unit level, which is an important requirement in some settings. For example, in pretrial bail decisions, a judge must balance crime...
Early reaction time variability predicts implicit statistical learning: a comparison of four variability indices
High intra-individual reaction time variability (RTV) is traditionally viewed through a deficit perspective and interpreted as a maladaptive signature of attentional lapses, cognitive inefficiency, and systemic noise. However, theories from motor learning and the competitive neurocognitive networks framework suggest that behavioral variability and reduced top-down control might actually facilitate certain forms of implicit skill acquisition. The present study addresses the apparent conflict...
Performative Learning Theory
arXiv:2602.04402v3 Announce Type: replace-cross Abstract: Performative predictions influence the very outcomes they aim to forecast. We study performative predictions that affect a sample (e.g., only existing users of an app) and/or the whole population (e.g., all potential app users). This raises the question of how well models generalize under performativity.
An Empirical Study of Data Scale, Model Complexity, and Input Modalities in Visual Generalization
arXiv:2606.04409v2 Announce Type: replace Abstract: Modern deep neural networks usually have large parameter scales and nonlinear hierarchical structures, and they have achieved strong performance in computer vision. However, the source of their generalization performance remains difficult to explain using traditional statistical learning theory. Among the factors that may affect visual generalization, data scale, model complexity, and input modalities are fundamental and controllable variables.
An Empirical Study of Data Scale, Model Complexity, and Input Modalities in Visual Generalization
arXiv:2606.04409v1 Announce Type: new Abstract: Modern deep neural networks usually have large parameter scales and nonlinear hierarchical structures, and they have achieved strong performance in computer vision. However, the source of their generalization performance remains difficult to explain using traditional statistical learning theory. Among the factors that may affect visual generalization, data scale, model complexity, and input modalities are fundamental and controllable variables.
Structural Decoupling: A Scaffold-Flow Theory of Generalization and Alignment
arXiv:2506.20699v2 Announce Type: replace Abstract: Learning in non-stationary and multi-context environments requires more than ordinary within-task generalization. A system must also discover which contexts exist, route inputs to the correct context, preserve old contexts, and revise the context library when the environment changes. This paper presents Structural Learning Theory (StrLT) as a framework of filling this missing structural gap.
Multimodal sampling via Schr\"odinger-F\"ollmer samplers with temperatures
arXiv:2512.23965v2 Announce Type: replace Abstract: Generating samples from complex and high-dimensional distributions is ubiquitous in various scientific fields of statistical physics, Bayesian inference, scientific computing and machine learning. Very recently, Huang et al. Theory, 2025) proposed new Schr\"odinger-F\"ollmer samplers (SFS), based on the Euler discretization of the Schr\"odinger-F\"ollmer diffusion evolving on the unit interval $[0, 1]$. There, a convergence rate of order...
Deep Embedded Multiplicative DMD for Algebra-Preserving Koopman Learning
Announce Type: new Abstract: Koopman theory turns nonlinear dynamics into a linear spectral problem. In computation, however, everything depends on a hard finite-dimensional choice: the observables must be expressive, nearly invariant under the dynamics, and, ideally, compatible with composition. Deep Koopman methods learn flexible coordinates, whereas structure-preserving methods enforce operator identities on fixed dictionaries.
Interpreting FCDNNs via RG on Exponential Family
arXiv:2606.00157v1 Announce Type: cross Abstract: We consider establishing the interpretability theory of deep learning through constructing a corresponding relationship between the renormalization group (RG) method in statistical physics and the training process of deep neural networks (DNNs). We have proved the constructed relationship using the one-dimensional Ising model as the input data. In this paper we generalize our results to the case of continuous input data, which is a necessary...
Everywhere Learning: Artificial Intelligence with Pointwise Constraints
Announce Type: new Abstract: Everywhere learning is a new paradigm whereby Artificial Intelligence (AI) systems are trained to satisfy loss constraints with probability one over the data distribution. This is in contrast to the standard paradigm of training AI systems to minimize average losses. We develop an approximate duality theory to substantiate a generalization analysis that establishes the proximity between solutions of empirical and statistical everywhere learning problems.