19329 papers
The spectrum from Cesium to Lutetium encompasses a fascinating group of elements that bridge the gap between the reactive alkali metals and the complex chemistry of the transition series. These atoms, sitting in the middle of the periodic table, drive innovations in atomic clocks, quantum computing, and advanced medical imaging. Their unique electron configurations allow scientists to probe the fundamental laws of physics with extraordinary precision, offering a window into how matter behaves under extreme conditions.
Gist.Science is dedicated to making the latest discoveries in this niche accessible to everyone. We process every new preprint in this category from arXiv as soon as it appears, translating dense academic findings into clear, plain-language summaries alongside detailed technical breakdowns. This dual approach ensures that both curious readers and specialists can grasp the significance of these rapid scientific advances without getting lost in the jargon.
Below are the latest papers covering these heavy elements and their groundbreaking applications.
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 establishes that Regularized Policy Iteration is formally equivalent to the Newton-Raphson method applied to smoothed Bellman equations, thereby proving its local quadratic convergence (which is dimension-free for Shannon entropy) and enabling the development of a new third-order convergent algorithm for regularized Markov decision processes.
This paper proposes Generalized Fisher-Weighted SVD (GFWSVD), a scalable post-training compression method for large language models that utilizes a Kronecker-factored approximation of the full Fisher information matrix to capture parameter correlations and significantly outperform existing diagonal-based compression techniques.
This paper introduces SOReL and TOReL, a fully offline Bayesian framework that enables reliable hyperparameter tuning and performance estimation for both model-based and model-free reinforcement learning without any online interactions, while also providing theoretical guarantees of minimax-optimal convergence.
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 analyzes the impact of stochasticity in score-based diffusion sampling by deriving KL divergence bounds that reveal a trade-off between error correction and amplification, demonstrating that the optimal stochasticity profile depends on the time-localization of the model's score errors.
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 Green AI-guided adaptive encoder freezing strategy for federated learning in MRI-to-CT conversion that significantly reduces energy consumption and CO2 emissions by up to 23% while maintaining or improving model performance, thereby promoting equitable and sustainable healthcare AI.
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.