2857 papers
Statistical Machine Learning sits at the exciting intersection of data theory and artificial intelligence, where mathematical rigor meets real-world pattern recognition. This field develops the algorithms that allow computers to learn from vast datasets without explicit programming, turning raw numbers into predictive models that power everything from medical diagnostics to financial forecasting. It is the engine behind many of the most transformative technologies we use today.
Gist.Science monitors the arXiv preprint server daily, ensuring that every new submission in this category is quickly processed and made accessible to a broader audience. We provide both plain-language overviews for general readers and detailed technical summaries for researchers, bridging the gap between complex academic papers and practical understanding. Below are the latest papers in Statistical Machine Learning that have recently appeared on arXiv, now explained for you.
The paper introduces the Cross-Cluster Weighted Forest (CCWF), a novel ensembling method that improves prediction accuracy and generalizability in heterogeneous biological data by clustering training samples, fitting individual Random Forests to each cluster, and combining them via weighted regression, thereby outperforming standard Random Forests by reducing bias.
This paper proposes and experimentally validates the "Gibbs randomness-compression proposition," which establishes a computable connection between model compression and directed randomness by demonstrating a high correlation between learning performance and Gibbs entropy measured over the remaining weights of compressed deep learning models.
This paper introduces Similarity as Reward Alignment (SARA), a robust contrastive framework for preference-based reinforcement learning that learns latent representations to compute rewards as similarities, demonstrating superior stability and noise resilience compared to baselines on continuous control benchmarks.
This paper proposes a framework and a sequential evaluation algorithm to determine the optimal timing for switching from an incumbent machine learning model to a challenger trained on new data sources, balancing the trade-off between improving predictive performance and the costs of retraining to achieve near-oracle economic efficiency.
This paper establishes the statistical foundations of amortized Bayesian inference by analyzing how major neural architectures like feedforward networks, Deep Sets, and Transformers enable efficient, low-cost posterior approximation, while empirically validating their accuracy, robustness, and uncertainty quantification across diverse simulation scenarios.
This paper establishes sharp spectral concentration bounds and improved latent geometry recovery guarantees for sparse high-dimensional random geometric graphs under spherical and Gaussian models, while also proving the first exact recovery result for a Gaussian mixture block model using orthogonal polynomial expansions and matrix concentration techniques.
This paper establishes a tractable framework analyzing the strategic trade-offs between Supervised Fine-Tuning and In-Context Learning for LLM personalization under resource congestion, revealing that offering both methods is always profitable for platforms while user equilibrium choices exhibit non-monotonic sensitivity to pretraining quality and task difficulty.
This paper employs a novel Random Duality Theory (RDT) framework, combining explicit upper bounds with a new bilinear-quadratic lower-bounding mechanism and a two-replica strategy, to derive the precise limiting value of the spectral norm error for sample covariance matrices of centered Gaussians, thereby moving beyond previous scaling characterizations to provide exact closed-form results.
This study demonstrates that adaptive Runge-Kutta step control in optimizers fails to improve generalization or training loss compared to standard Adam under strict compute-matched conditions, as its adaptivity is illusory and its benefits are either fragile, replicable by cheaper first-order methods, or limited to a small regularization effect from gradient averaging.
This paper proves the conjecture that bounded second-order heterogeneity enables improved convergence rates for Local SGD on general convex objectives, establishes nearly tight upper and lower bounds to refine the theoretical understanding of the algorithm, and extends these techniques to derive new lower bounds for serial SGD with replacement.