Skip to content

Category

data science

3,686 papers

#machine learning Preprint May 2026

From Privacy to Generalization: Linear Max-Information Bounds for Differentially Private Learning Algorithms

This work derives explicit upper bounds on the approximate max-information of any algorithm that fulfills $(\epsilon, \delta)$-differential privacy or R\'enyi differential privacy, thereby going beyond the classical results for pure $\epsilon$-differential privacy.

Christoph H. Lampert, Max Cairney-Leeming, Hossein Zakerinia · 0 citations
#machine learning Preprint May 2026

A Dual Representation of Influence Functions for Linearizable Models

This representation can be an efficient alternative to the original influence functions for estimating changes in parameters, model outputs and loss due to data point removal, when model size is large relative to dataset size, or when evaluating the original influence functions in parameter space is infeasible.

Zhen Sun, S. Valaee · 0 citations

Convergence Analysis of Newton's Method for Neural Networks in the Overparameterized Limit

A convergence analysis is developed for the regularized Newton method for training neural networks (NNs) in the overparameterized limit and it is proved that the NN converges exponentially fast to the target data (i.e., a global minimizer with zero loss).

Konstantin Riedl, Konstantinos Spiliopoulos, Justin A. Sirignano · 0 citations
#machine learning Preprint Open access Sep 2026

Why Does Agentic Safety Fail to Generalize Across Tasks?

AI agents are increasingly deployed in multi-task settings, where the task to perform is specified at test time, and the agent must generalize to unseen tasks. A major concern in such settings is safety: often, an agent must not only execute unseen tasks, but do so while avoiding risks and handling ones that materializ...

Yonatan Slutzky, Yotam Alexander, Tomer Slor et al. · 0 citations
#machine learning Preprint Open access Sep 2026

A Theory of Saddle Escape in Deep Nonlinear Networks

In deep networks with small initialization, training can exhibit long plateaus separated by sharp feature-acquisition transitions. Whereas shallow nonlinear networks and deep linear networks are well studied, extending these analyses to deep nonlinear networks remains challenging. We derive exact scalar and matrix iden...

Divit Rawal, Michael R. DeWeese · 0 citations
#machine learning Preprint Jan 2026

Understanding and inverse design of implicit bias in stochastic learning: a geometric perspective

A framework for inverse-designing such biases by constructing novel parametrizations and their associated symmetries is developed and it is shown how holomorphic functions make this construction and calculation simple and explicit.

Nicola Aladrah, Emanuele Ballarin, Matteo Biagetti et al. · 3 citations
#machine learning Preprint Dec 2025

Shapley-based Data Valuation for LLM Alignment via Sequential Preference Optimization

It is shown that, when a model is aligned sequentially source by source, exact optimization makes each stage contribute additively to the log-probability of a full response, up to a prompt-dependent normalization constant, reducing the alignment cost of Shapley-based valuation from exponential to linear.

Mélissa Tamine, Otmane Sakhi, Benjamin Heymann et al. · 1 citation

Neural Tractability via Structure: Learning-Augmented Algorithms for Graph Combinatorial Optimization

The proposed Neural Fixed-Parameter Tractable (N-FPT), a neural-model-agnostic framework that uses parameterized algorithms to improve neural solutions without retraining and guide learning, proves this guarantee and global optimality under perfect advice.

Jialiang Li, Wei-Tong Chen, Ming-Yu Guo · 0 citations

Theoretical Refinement of CLIP by Utilizing Linear Structure of Optimal Similarity

KME-CLIP is proposed, which leverages this structure through the inner product in a reproducing kernel Hilbert space (RKHS) and theoretically proves that the KME-CLIP similarity can bring the contrastive loss arbitrarily close to its optimal value, which is attained by PMI, as the size of the point set grows.

Naoki Yoshida, Satoshi Hayakawa, Yuhta Takida et al. · 2 citations
#machine learning Preprint Oct 2025

Auditing Information Disclosure During Large-Scale Gradient-Based Training via Gradient Uniqueness

This work proposes a principled, attack-agnostic approach that uses mutual information to measure what the final model reveals about a datapoint's training membership and shows that this final-model disclosure is upper bounded by the sum of per-iteration gradient disclosures.

S. Abdelghafar, M. Aliakbarpour, Christopher Jermaine · 0 citations

Demystifying MaskGIT Sampler and Beyond: Adaptive Order Selection in Masked Diffusion

This paper theoretically analyzes the MaskGIT sampler for image modeling, revealing its implicit temperature sampling mechanism, and shows that MaskGIT is asymptotically equivalent to a choose-then-sample (CTS) formulation, instantiated as the "moment sampler," which explicitly separates index selection from token samp...

Satoshi Hayakawa, Yuhta Takida, Masaaki Imaizumi et al. · 10 citations · ⚡1
#machine learning Preprint May 2025

Federated Independent Component Analysis via Spectral Alignment and Robust Aggregation

This paper proposes a novel three-step aggregation method that first aligns the permutations across all local estimators via a particular spectral clustering approach, then aligns the signs within each estimated cluster via another tailored spectral approach, and finally applies the geometric median for robust aggregat...

Xin Bing, Dian Jin, Yu-Qian Zhang · 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.