Skip to content

Category

data science

3,686 papers

#machine learning Preprint Oct 2026

The Symbol of the Surrogate: Measuring Numerical Provenance in Neural PDE Solvers

Neural PDE surrogates are trained on numerical solver outputs that contain both physical evolution and solver-specific discretization errors. Because surrogates are also evaluated against held-out trajectories from the same solver, standard benchmarks cannot distinguish fidelity to the exact evolution from imitation of...

Ridham Patel · 0 citations
#machine learning Preprint Oct 2026

An Accuracy-Information Tradeoff for Loss-Difference Conditional Mutual Information

Loss-difference conditional mutual information (ld-CMI) uses the smallest of the standard observations in the supersample hierarchy of generalization bounds: it measures what a learner's loss differences reveal about which candidate of each pair it was trained on. Accuracy is known to force information into the model;...

Hazar Yueksel · 0 citations
#machine learning Preprint Oct 2026

Exact Dynamics and Finite-Sample Trajectory Recovery of Linear Recursive Feature Machines

Recursive feature machines (RFMs) learn representations of data by alternating between fitting a predictor to a dataset and updating features of that predictor using the average gradient outer product (AGOP). Connections between AGOPs and feature learning in neural networks motivate linear RFMs as a simple setting for...

Andrew Cheng, B. Kiani, Yue M. Lu et al. · 0 citations
#machine learning Preprint Open access Oct 2026

FedRSPO+: A Heterogeneity-aware Algorithm for Decision-focused Federated Learning

Decision-focused learning (DFL) trains predictive models for downstream optimization, but existing methods largely assume centralized data. In cross-silo settings, federated learning offers a natural alternative, yet standard federated methods optimize prediction over decision quality and do not address heterogeneity i...

Konstantinos Ziliaskopoulos, Alexander Vinel, Jiaqi Wang · 0 citations
#machine learning Preprint Oct 2026

The Best Optimizer Depends on Batch Size

A plethora of new adaptive optimizers are designed to efficiently estimate and use minibatch gradient statistics to shape parameter updates, but they are typically benchmarked at a single batch size. Hyperparameter scaling rules promise to preserve performance as batch size and gradient noise change, suggesting that th...

Xing-Yu Dang, Kai-Yue Wen, Sadhika Malladi · 1 citation · ⚡1
#artificial intelligence Preprint Open access Oct 2026

The Metagame of Interpretability and Meta-Attributions

How can an arbitrary attribution method be generalized from first principles to capture interactions? We answer this with the metagame, a conceptual framework for quantifying second-order interaction effects of model explanations. We cast the attribution value $\phi_i$ of feature $i$ as a cooperative game among the oth...

Hubert Baniecki, Przemyslaw Biecek, Fabian Fumagalli · 0 citations
#artificial intelligence Open access Feb 2026

Multiparameter Uncertainty Mapping in Quantitative Molecular MRI using a Physics-Structured Variational Autoencoder (PS-VAE)

A physics-structured variational autoencoder designed for rapid extraction of voxelwise multi-parameter posterior distributions that is in good agreement with those calculated using a brute-force Bayesian analysis, while providing an orders-of-magnitude acceleration in whole brain quantification.

Alex Finkelstein, Ron Moneta, O. Zohar et al. · 0 citations
#artificial intelligence Preprint Open access Oct 2026

Order-Optimal Sample Complexity of Rectified Flows

Recently, flow-based generative models have shown superior efficiency compared to diffusion models. In this paper, we study rectified flow models, which constrain transport trajectories to be linear from the base distribution to the data distribution. This structural restriction greatly accelerates sampling, often enab...

Hari Krishna Sahoo, Mudit Gaur, Vaneet Aggarwal · 0 citations
#artificial intelligence Preprint Oct 2026

Training Parallel Speculative Draft Models by Directly Minimizing Expected Decoding Rounds

A theoretical framework for training and evaluating parallel and semi-autoregressive drafters by representing speculative decoding as a Markov reward process, which yields the Expected Decoding Rounds (EDR) objective, which weights local rejection costs by state occupancies and exactly equals the expected number of dec...

Yun-Xiao Zhao, Chang-Xiao Cai · 0 citations
#artificial intelligence Preprint Oct 2026

DSReg: Provably Recovering Individual World Latents without Reconstruction

DSReg (Dependency-Sparsity Regularization) recovers individual world latents up to signed permutation, without reconstruction or a decoder, without reconstruction or a decoder, and establishes the first fully identifiable JEPA that recovers every world latent.

Yujia Zheng, David A. Klindt, Randall Balestriero et al. · 0 citations
#artificial intelligence Preprint Open access Oct 2026

Efficient Best-of-N policy evaluation for inference-time alignment

Best-of-N (BoN) is a common inference-time alignment method that selects the highest-scoring response among N samples from a reference model. Evaluating BoN policies from logged data is challenging under sample-only access because standard off-policy estimators require density ratios that depend on unavailable response...

Jonas Schweisthal, Yuxin Wang, Athiya Deviyani et al. · 0 citations

From tech blogs

See all →
GPT-Lab Nov 3, 2026

Sovereignty Is the Option to Leave

Is your company’s AI sovereign? A practical guide for CIOs on AI vendor lock-in, EU Data Act switching, cloud sovereignty, and testing your exit plan before you need it. The post Sovereignty Is the Option to Leave appeared first on GPT-Lab.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.